aboutsummaryrefslogtreecommitdiff
path: root/helix-core
diff options
context:
space:
mode:
Diffstat (limited to 'helix-core')
-rw-r--r--helix-core/src/graphemes.rs23
-rw-r--r--helix-core/src/line_ending.rs7
-rw-r--r--helix-core/src/movement.rs146
-rw-r--r--helix-core/src/object.rs2
-rw-r--r--helix-core/src/position.rs4
-rw-r--r--helix-core/src/search.rs12
-rw-r--r--helix-core/src/selection.rs478
-rw-r--r--helix-core/src/surround.rs76
-rw-r--r--helix-core/src/syntax.rs18
-rw-r--r--helix-core/src/textobject.rs267
10 files changed, 676 insertions, 357 deletions
diff --git a/helix-core/src/graphemes.rs b/helix-core/src/graphemes.rs
index f71b6d5f..0465fe51 100644
--- a/helix-core/src/graphemes.rs
+++ b/helix-core/src/graphemes.rs
@@ -71,6 +71,8 @@ pub fn nth_prev_grapheme_boundary(slice: RopeSlice, char_idx: usize, n: usize) -
}
/// Finds the previous grapheme boundary before the given char position.
+#[must_use]
+#[inline(always)]
pub fn prev_grapheme_boundary(slice: RopeSlice, char_idx: usize) -> usize {
nth_prev_grapheme_boundary(slice, char_idx, 1)
}
@@ -117,21 +119,38 @@ pub fn nth_next_grapheme_boundary(slice: RopeSlice, char_idx: usize, n: usize) -
}
/// Finds the next grapheme boundary after the given char position.
+#[must_use]
+#[inline(always)]
pub fn next_grapheme_boundary(slice: RopeSlice, char_idx: usize) -> usize {
nth_next_grapheme_boundary(slice, char_idx, 1)
}
/// Returns the passed char index if it's already a grapheme boundary,
/// or the next grapheme boundary char index if not.
-pub fn ensure_grapheme_boundary(slice: RopeSlice, char_idx: usize) -> usize {
+#[must_use]
+#[inline]
+pub fn ensure_grapheme_boundary_next(slice: RopeSlice, char_idx: usize) -> usize {
if char_idx == 0 {
- 0
+ char_idx
} else {
next_grapheme_boundary(slice, char_idx - 1)
}
}
+/// Returns the passed char index if it's already a grapheme boundary,
+/// or the prev grapheme boundary char index if not.
+#[must_use]
+#[inline]
+pub fn ensure_grapheme_boundary_prev(slice: RopeSlice, char_idx: usize) -> usize {
+ if char_idx == slice.len_chars() {
+ char_idx
+ } else {
+ prev_grapheme_boundary(slice, char_idx + 1)
+ }
+}
+
/// Returns whether the given char position is a grapheme boundary.
+#[must_use]
pub fn is_grapheme_boundary(slice: RopeSlice, char_idx: usize) -> bool {
// Bounds check
debug_assert!(char_idx <= slice.len_chars());
diff --git a/helix-core/src/line_ending.rs b/helix-core/src/line_ending.rs
index e3ff6478..18ea5f9f 100644
--- a/helix-core/src/line_ending.rs
+++ b/helix-core/src/line_ending.rs
@@ -159,6 +159,13 @@ pub fn line_end_char_index(slice: &RopeSlice, line: usize) -> usize {
.unwrap_or(0)
}
+/// Fetches line `line_idx` from the passed rope slice, sans any line ending.
+pub fn line_without_line_ending<'a>(slice: &'a RopeSlice, line_idx: usize) -> RopeSlice<'a> {
+ let start = slice.line_to_char(line_idx);
+ let end = line_end_char_index(slice, line_idx);
+ slice.slice(start..end)
+}
+
/// Returns the char index of the end of the given RopeSlice, not including
/// any final line ending.
pub fn rope_end_without_line_ending(slice: &RopeSlice) -> usize {
diff --git a/helix-core/src/movement.rs b/helix-core/src/movement.rs
index f9e5deb4..2cb4b40d 100644
--- a/helix-core/src/movement.rs
+++ b/helix-core/src/movement.rs
@@ -5,8 +5,11 @@ use ropey::iter::Chars;
use crate::{
chars::{categorize_char, char_is_line_ending, CharCategory},
coords_at_pos,
- graphemes::{nth_next_grapheme_boundary, nth_prev_grapheme_boundary},
- line_ending::{get_line_ending, line_end_char_index},
+ graphemes::{
+ next_grapheme_boundary, nth_next_grapheme_boundary, nth_prev_grapheme_boundary,
+ prev_grapheme_boundary, RopeGraphemes,
+ },
+ line_ending::line_without_line_ending,
pos_at_coords, Position, Range, RopeSlice,
};
@@ -29,25 +32,31 @@ pub fn move_horizontally(
count: usize,
behaviour: Movement,
) -> Range {
- let pos = range.head;
- let line = slice.char_to_line(pos);
- // TODO: we can optimize clamping by passing in RopeSlice limited to current line. that way
- // we stop calculating past start/end of line.
- let pos = match dir {
- Direction::Backward => {
- let start = slice.line_to_char(line);
- nth_prev_grapheme_boundary(slice, pos, count).max(start)
- }
- Direction::Forward => {
- let end_char_idx = line_end_char_index(&slice, line);
- nth_next_grapheme_boundary(slice, pos, count).min(end_char_idx)
- }
+ use Movement::Extend;
+
+ // Shift back one grapheme if needed, to account for
+ // the cursor being visually 1-width.
+ let pos = if range.head > range.anchor {
+ prev_grapheme_boundary(slice, range.head)
+ } else {
+ range.head
};
- let anchor = match behaviour {
- Movement::Extend => range.anchor,
- Movement::Move => pos,
+
+ // Compute the new position.
+ let mut new_pos = if dir == Direction::Backward {
+ nth_prev_grapheme_boundary(slice, pos, count)
+ } else {
+ nth_next_grapheme_boundary(slice, pos, count)
+ };
+
+ // Shift forward one grapheme if needed, for the
+ // visual 1-width cursor.
+ if behaviour == Extend && new_pos >= range.anchor {
+ new_pos = next_grapheme_boundary(slice, new_pos);
};
- Range::new(anchor, pos)
+
+ // Compute the final new range.
+ range.put(slice, new_pos, behaviour == Extend)
}
pub fn move_vertically(
@@ -57,36 +66,51 @@ pub fn move_vertically(
count: usize,
behaviour: Movement,
) -> Range {
- let Position { row, col } = coords_at_pos(slice, range.head);
+ // Shift back one grapheme if needed, to account for
+ // the cursor being visually 1-width.
+ let pos = if range.head > range.anchor {
+ prev_grapheme_boundary(slice, range.head)
+ } else {
+ range.head
+ };
+ // Compute the current position's 2d coordinates.
+ let Position { row, col } = coords_at_pos(slice, pos);
let horiz = range.horiz.unwrap_or(col as u32);
- let new_line = match dir {
- Direction::Backward => row.saturating_sub(count),
- Direction::Forward => std::cmp::min(
- row.saturating_add(count),
- slice.len_lines().saturating_sub(2),
- ),
- };
+ // Compute the new position.
+ let new_pos = {
+ let new_row = if dir == Direction::Backward {
+ row.saturating_sub(count)
+ } else {
+ (row + count).min(slice.len_lines().saturating_sub(1))
+ };
+ let max_col = RopeGraphemes::new(line_without_line_ending(&slice, new_row)).count();
+ let new_col = col.max(horiz as usize).min(max_col);
- // Length of the line sans line-ending.
- let new_line_len = {
- let line = slice.line(new_line);
- line.len_chars() - get_line_ending(&line).map(|le| le.len_chars()).unwrap_or(0)
+ pos_at_coords(slice, Position::new(new_row, new_col))
};
- let new_col = std::cmp::min(horiz as usize, new_line_len);
-
- let pos = pos_at_coords(slice, Position::new(new_line, new_col));
-
- let anchor = match behaviour {
- Movement::Extend => range.anchor,
- Movement::Move => pos,
- };
+ // Compute the new range according to the type of movement.
+ match behaviour {
+ Movement::Move => Range {
+ anchor: new_pos,
+ head: new_pos,
+ horiz: Some(horiz),
+ },
+
+ Movement::Extend => {
+ let new_head = if new_pos >= range.anchor {
+ next_grapheme_boundary(slice, new_pos)
+ } else {
+ new_pos
+ };
- let mut range = Range::new(anchor, pos);
- range.horiz = Some(horiz);
- range
+ let mut new_range = range.put(slice, new_head, true);
+ new_range.horiz = Some(horiz);
+ new_range
+ }
+ }
}
pub fn move_next_word_start(slice: RopeSlice, range: Range, count: usize) -> Range {
@@ -330,7 +354,7 @@ mod test {
}
#[test]
- fn horizontal_moves_through_single_line_in_single_line_text() {
+ fn horizontal_moves_through_single_line_text() {
let text = Rope::from(SINGLE_LINE_SAMPLE);
let slice = text.slice(..);
let position = pos_at_coords(slice, (0, 0).into());
@@ -353,7 +377,7 @@ mod test {
}
#[test]
- fn horizontal_moves_through_single_line_in_multiline_text() {
+ fn horizontal_moves_through_multiline_text() {
let text = Rope::from(MULTILINE_SAMPLE);
let slice = text.slice(..);
let position = pos_at_coords(slice, (0, 0).into());
@@ -361,15 +385,15 @@ mod test {
let mut range = Range::point(position);
let moves_and_expected_coordinates = IntoIter::new([
- ((Direction::Forward, 1usize), (0, 1)), // M|ultiline\n
- ((Direction::Forward, 2usize), (0, 3)), // Mul|tiline\n
- ((Direction::Backward, 6usize), (0, 0)), // |Multiline\n
- ((Direction::Backward, 999usize), (0, 0)), // |Multiline\n
- ((Direction::Forward, 3usize), (0, 3)), // Mul|tiline\n
- ((Direction::Forward, 0usize), (0, 3)), // Mul|tiline\n
- ((Direction::Backward, 0usize), (0, 3)), // Mul|tiline\n
- ((Direction::Forward, 999usize), (0, 9)), // Multiline|\n
- ((Direction::Forward, 999usize), (0, 9)), // Multiline|\n
+ ((Direction::Forward, 11usize), (1, 1)), // Multiline\nt|ext sample\n...
+ ((Direction::Backward, 1usize), (1, 0)), // Multiline\n|text sample\n...
+ ((Direction::Backward, 5usize), (0, 5)), // Multi|line\ntext sample\n...
+ ((Direction::Backward, 999usize), (0, 0)), // |Multiline\ntext sample\n...
+ ((Direction::Forward, 3usize), (0, 3)), // Mul|tiline\ntext sample\n...
+ ((Direction::Forward, 0usize), (0, 3)), // Mul|tiline\ntext sample\n...
+ ((Direction::Backward, 0usize), (0, 3)), // Mul|tiline\ntext sample\n...
+ ((Direction::Forward, 999usize), (5, 0)), // ...and whitespaced\n|
+ ((Direction::Forward, 999usize), (5, 0)), // ...and whitespaced\n|
]);
for ((direction, amount), coordinates) in moves_and_expected_coordinates {
@@ -403,18 +427,19 @@ mod test {
#[test]
fn vertical_moves_in_single_column() {
let text = Rope::from(MULTILINE_SAMPLE);
- let slice = dbg!(&text).slice(..);
+ let slice = text.slice(..);
let position = pos_at_coords(slice, (0, 0).into());
let mut range = Range::point(position);
let moves_and_expected_coordinates = IntoIter::new([
((Direction::Forward, 1usize), (1, 0)),
((Direction::Forward, 2usize), (3, 0)),
+ ((Direction::Forward, 1usize), (4, 0)),
((Direction::Backward, 999usize), (0, 0)),
- ((Direction::Forward, 3usize), (3, 0)),
- ((Direction::Forward, 0usize), (3, 0)),
- ((Direction::Backward, 0usize), (3, 0)),
- ((Direction::Forward, 5), (4, 0)),
- ((Direction::Forward, 999usize), (4, 0)),
+ ((Direction::Forward, 4usize), (4, 0)),
+ ((Direction::Forward, 0usize), (4, 0)),
+ ((Direction::Backward, 0usize), (4, 0)),
+ ((Direction::Forward, 5), (5, 0)),
+ ((Direction::Forward, 999usize), (5, 0)),
]);
for ((direction, amount), coordinates) in moves_and_expected_coordinates {
@@ -446,7 +471,8 @@ mod test {
((Axis::V, Direction::Forward, 1usize), (3, 8)),
// Behaviour is preserved even through long jumps
((Axis::V, Direction::Backward, 999usize), (0, 8)),
- ((Axis::V, Direction::Forward, 999usize), (4, 8)),
+ ((Axis::V, Direction::Forward, 4usize), (4, 8)),
+ ((Axis::V, Direction::Forward, 999usize), (5, 0)),
]);
for ((axis, direction, amount), coordinates) in moves_and_expected_coordinates {
diff --git a/helix-core/src/object.rs b/helix-core/src/object.rs
index 33d90971..d9558dd8 100644
--- a/helix-core/src/object.rs
+++ b/helix-core/src/object.rs
@@ -5,7 +5,7 @@ use crate::{Range, RopeSlice, Selection, Syntax};
pub fn expand_selection(syntax: &Syntax, text: RopeSlice, selection: &Selection) -> Selection {
let tree = syntax.tree();
- selection.transform(|range| {
+ selection.clone().transform(|range| {
let from = text.char_to_byte(range.from());
let to = text.char_to_byte(range.to());
diff --git a/helix-core/src/position.rs b/helix-core/src/position.rs
index 3d114b52..c4e8c9d6 100644
--- a/helix-core/src/position.rs
+++ b/helix-core/src/position.rs
@@ -53,6 +53,8 @@ impl From<Position> for tree_sitter::Point {
}
/// Convert a character index to (line, column) coordinates.
pub fn coords_at_pos(text: RopeSlice, pos: usize) -> Position {
+ // TODO: this isn't correct. This needs to work in terms of
+ // visual horizontal position, not graphemes.
let line = text.char_to_line(pos);
let line_start = text.line_to_char(line);
let col = RopeGraphemes::new(text.slice(line_start..pos)).count();
@@ -61,6 +63,8 @@ pub fn coords_at_pos(text: RopeSlice, pos: usize) -> Position {
/// Convert (line, column) coordinates to a character index.
pub fn pos_at_coords(text: RopeSlice, coords: Position) -> usize {
+ // TODO: this isn't correct. This needs to work in terms of
+ // visual horizontal position, not graphemes.
let Position { row, col } = coords;
let line_start = text.line_to_char(row);
// line_start + col
diff --git a/helix-core/src/search.rs b/helix-core/src/search.rs
index 73be68c7..d4eb11a9 100644
--- a/helix-core/src/search.rs
+++ b/helix-core/src/search.rs
@@ -7,12 +7,11 @@ pub fn find_nth_next(
n: usize,
inclusive: bool,
) -> Option<usize> {
- if pos >= text.len_chars() {
+ if pos >= text.len_chars() || n == 0 {
return None;
}
- // start searching right after pos
- let mut chars = text.chars_at(pos + 1);
+ let mut chars = text.chars_at(pos);
for _ in 0..n {
loop {
@@ -40,14 +39,17 @@ pub fn find_nth_prev(
n: usize,
inclusive: bool,
) -> Option<usize> {
- // start searching right before pos
+ if pos == 0 || n == 0 {
+ return None;
+ }
+
let mut chars = text.chars_at(pos);
for _ in 0..n {
loop {
let c = chars.prev()?;
- pos = pos.saturating_sub(1);
+ pos -= 1;
if c == ch {
break;
diff --git a/helix-core/src/selection.rs b/helix-core/src/selection.rs
index 63b9b557..21a6c108 100644
--- a/helix-core/src/selection.rs
+++ b/helix-core/src/selection.rs
@@ -1,30 +1,50 @@
-//! Selections are the primary editing construct. Even a single cursor is defined as an empty
-//! single selection range.
+//! Selections are the primary editing construct. Even a single cursor is
+//! defined as a single empty or 1-wide selection range.
//!
//! All positioning is done via `char` offsets into the buffer.
-use crate::{Assoc, ChangeSet, RopeSlice};
+use crate::{
+ graphemes::{
+ ensure_grapheme_boundary_next, ensure_grapheme_boundary_prev, next_grapheme_boundary,
+ prev_grapheme_boundary,
+ },
+ Assoc, ChangeSet, RopeSlice,
+};
use smallvec::{smallvec, SmallVec};
use std::borrow::Cow;
-#[inline]
-fn abs_difference(x: usize, y: usize) -> usize {
- if x < y {
- y - x
- } else {
- x - y
- }
-}
-
-/// A single selection range. Anchor-inclusive, head-exclusive.
+/// A single selection range.
+///
+/// The range consists of an "anchor" and "head" position in
+/// the text. The head is the part that the user moves when
+/// directly extending the selection. The head and anchor
+/// can be in any order: either can precede or follow the
+/// other in the text, and they can share the same position
+/// for a zero-width range.
+///
+/// Below are some example `Range` configurations to better
+/// illustrate. The anchor and head indices are show as
+/// "(anchor, head)", followed by example text with "[" and "]"
+/// inserted to visually represent the anchor and head positions:
+///
+/// - (0, 3): [Som]e text.
+/// - (3, 0): ]Som[e text.
+/// - (2, 7): So[me te]xt.
+/// - (1, 1): S[]ome text.
+///
+/// Ranges are considered to be inclusive on the left and
+/// exclusive on the right, regardless of anchor-head ordering.
+/// This means, for example, that non-zero-width ranges that
+/// are directly adjecent, sharing an edge, do not overlap.
+/// However, a zero-width range will overlap with the shared
+/// left-edge of another range.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub struct Range {
- // TODO: optimize into u32
/// The anchor of the range: the side that doesn't move when extending.
pub anchor: usize,
/// The head of the range, moved when extending.
pub head: usize,
pub horiz: Option<u32>,
-} // TODO: might be cheaper to store normalized as from/to and an inverted flag
+}
impl Range {
pub fn new(anchor: usize, head: usize) -> Self {
@@ -62,25 +82,14 @@ impl Range {
/// Check two ranges for overlap.
#[must_use]
pub fn overlaps(&self, other: &Self) -> bool {
- // cursor overlap is checked differently
- if self.is_empty() {
- let pos = self.head;
- pos >= other.from() && other.to() >= pos
- } else {
- self.to() > other.from() && other.to() > self.from()
- }
+ // To my eye, it's non-obvious why this works, but I arrived
+ // at it after transforming the slower version that explicitly
+ // enumerated more cases. The unit tests are thorough.
+ self.from() == other.from() || (self.to() > other.from() && other.to() > self.from())
}
pub fn contains(&self, pos: usize) -> bool {
- if self.is_empty() {
- return false;
- }
-
- if self.anchor < self.head {
- self.anchor <= pos && pos < self.head
- } else {
- self.head < pos && pos <= self.anchor
- }
+ self.from() <= pos && pos < self.to()
}
/// Map a range through a set of changes. Returns a new range representing the same position
@@ -89,10 +98,10 @@ impl Range {
let anchor = changes.map_pos(self.anchor, Assoc::After);
let head = changes.map_pos(self.head, Assoc::After);
- // TODO: possibly unnecessary
- if self.anchor == anchor && self.head == head {
- return self;
- }
+ // We want to return a new `Range` with `horiz == None` every time,
+ // even if the anchor and head haven't changed, because we don't
+ // know if the *visual* position hasn't changed due to
+ // character-width or grapheme changes earlier in the text.
Self {
anchor,
head,
@@ -103,30 +112,130 @@ impl Range {
/// Extend the range to cover at least `from` `to`.
#[must_use]
pub fn extend(&self, from: usize, to: usize) -> Self {
- if from <= self.anchor && to >= self.anchor {
- return Self {
- anchor: from,
- head: to,
+ debug_assert!(from <= to);
+
+ if self.anchor <= self.head {
+ Self {
+ anchor: self.anchor.min(from),
+ head: self.head.max(to),
horiz: None,
- };
+ }
+ } else {
+ Self {
+ anchor: self.anchor.max(to),
+ head: self.head.min(from),
+ horiz: None,
+ }
}
+ }
- Self {
- anchor: self.anchor,
- head: if abs_difference(from, self.anchor) > abs_difference(to, self.anchor) {
- from
+ /// Returns a range that encompasses both input ranges.
+ ///
+ /// This is like `extend()`, but tries to negotiate the
+ /// anchor/head ordering between the two input ranges.
+ #[must_use]
+ pub fn merge(&self, other: Self) -> Self {
+ if self.anchor > self.head && other.anchor > other.head {
+ Range {
+ anchor: self.anchor.max(other.anchor),
+ head: self.head.min(other.head),
+ horiz: None,
+ }
+ } else {
+ Range {
+ anchor: self.from().min(other.from()),
+ head: self.to().max(other.to()),
+ horiz: None,
+ }
+ }
+ }
+
+ /// Compute a possibly new range from this range, attempting to ensure
+ /// a minimum range width of 1 char by shifting the head in the forward
+ /// direction as needed.
+ ///
+ /// This method will never shift the anchor, and will only shift the
+ /// head in the forward direction. Therefore, this method can fail
+ /// at ensuring the minimum width if and only if the passed range is
+ /// both zero-width and at the end of the `RopeSlice`.
+ ///
+ /// If the input range is grapheme-boundary aligned, the returned range
+ /// will also be. Specifically, if the head needs to shift to achieve
+ /// the minimum width, it will shift to the next grapheme boundary.
+ #[must_use]
+ #[inline]
+ pub fn min_width_1(&self, slice: RopeSlice) -> Self {
+ if self.anchor == self.head {
+ Range {
+ anchor: self.anchor,
+ head: next_grapheme_boundary(slice, self.head),
+ horiz: self.horiz,
+ }
+ } else {
+ *self
+ }
+ }
+
+ /// Compute a possibly new range from this range, with its ends
+ /// shifted as needed to align with grapheme boundaries.
+ ///
+ /// Zero-width ranges will always stay zero-width, and non-zero-width
+ /// ranges will never collapse to zero-width.
+ #[must_use]
+ pub fn grapheme_aligned(&self, slice: RopeSlice) -> Self {
+ use std::cmp::Ordering;
+ let (new_anchor, new_head) = match self.anchor.cmp(&self.head) {
+ Ordering::Equal => {
+ let pos = ensure_grapheme_boundary_prev(slice, self.anchor);
+ (pos, pos)
+ }
+ Ordering::Less => (
+ ensure_grapheme_boundary_prev(slice, self.anchor),
+ ensure_grapheme_boundary_next(slice, self.head),
+ ),
+ Ordering::Greater => (
+ ensure_grapheme_boundary_next(slice, self.anchor),
+ ensure_grapheme_boundary_prev(slice, self.head),
+ ),
+ };
+ Range {
+ anchor: new_anchor,
+ head: new_head,
+ horiz: if new_anchor == self.anchor {
+ self.horiz
} else {
- to
+ None
},
- horiz: None,
}
}
+ /// Moves the `Range` to `char_idx`. If `extend == true`, then only the head
+ /// is moved to `char_idx`, and the anchor is adjusted only as needed to
+ /// preserve 1-width range semantics.
+ ///
+ /// This method assumes that the range and `char_idx` are already properly
+ /// grapheme-aligned.
+ #[must_use]
+ #[inline]
+ pub fn put(self, text: RopeSlice, char_idx: usize, extend: bool) -> Range {
+ let anchor = if !extend {
+ char_idx
+ } else if self.head >= self.anchor && char_idx < self.anchor {
+ next_grapheme_boundary(text, self.anchor)
+ } else if self.head < self.anchor && char_idx >= self.anchor {
+ prev_grapheme_boundary(text, self.anchor)
+ } else {
+ self.anchor
+ };
+
+ Range::new(anchor, char_idx)
+ }
+
// groupAt
#[inline]
pub fn fragment<'a, 'b: 'a>(&'a self, text: RopeSlice<'b>) -> Cow<'b, str> {
- Cow::from(text.slice(self.from()..self.to() + 1))
+ text.slice(self.from()..self.to()).into()
}
}
@@ -175,10 +284,8 @@ impl Selection {
}
pub fn push(mut self, range: Range) -> Self {
- let index = self.ranges.len();
self.ranges.push(range);
-
- Self::normalize(self.ranges, index)
+ self.normalize()
}
// replace_range
@@ -224,80 +331,68 @@ impl Selection {
Self::single(pos, pos)
}
- fn normalize(mut ranges: SmallVec<[Range; 1]>, mut primary_index: usize) -> Self {
- let primary = ranges[primary_index];
- ranges.sort_unstable_by_key(Range::from);
- primary_index = ranges.iter().position(|&range| range == primary).unwrap();
-
- let mut result = SmallVec::with_capacity(ranges.len()); // approx
-
- // TODO: we could do with one vec by removing elements as we mutate
-
- let mut i = 0;
-
- for range in ranges.into_iter() {
- // if previous value exists
- if let Some(prev) = result.last_mut() {
- // and we overlap it
-
- // TODO: we used to simply check range.from() <(=) prev.to()
- // avoiding two comparisons
- if range.overlaps(prev) {
- let from = prev.from();
- let to = std::cmp::max(range.to(), prev.to());
-
- if i <= primary_index {
- primary_index -= 1
- }
-
- // merge into previous
- if range.anchor > range.head {
- prev.anchor = to;
- prev.head = from;
- } else {
- prev.anchor = from;
- prev.head = to;
- }
- continue;
+ /// Normalizes a `Selection`.
+ fn normalize(mut self) -> Self {
+ let primary = self.ranges[self.primary_index];
+ self.ranges.sort_unstable_by_key(Range::from);
+ self.primary_index = self
+ .ranges
+ .iter()
+ .position(|&range| range == primary)
+ .unwrap();
+
+ let mut prev_i = 0;
+ for i in 1..self.ranges.len() {
+ if self.ranges[prev_i].overlaps(&self.ranges[i]) {
+ if i == self.primary_index {
+ self.primary_index = prev_i;
}
+ self.ranges[prev_i] = self.ranges[prev_i].merge(self.ranges[i]);
+ } else {
+ prev_i += 1;
+ self.ranges[prev_i] = self.ranges[i];
}
-
- result.push(range);
- i += 1
}
- Self {
- ranges: result,
- primary_index,
- }
+ self.ranges.truncate(prev_i + 1);
+
+ self
}
// TODO: consume an iterator or a vec to reduce allocations?
#[must_use]
pub fn new(ranges: SmallVec<[Range; 1]>, primary_index: usize) -> Self {
assert!(!ranges.is_empty());
+ debug_assert!(primary_index < ranges.len());
- // fast path for a single selection (cursor)
- if ranges.len() == 1 {
- return Self {
- ranges,
- primary_index: 0,
- };
+ let mut selection = Self {
+ ranges,
+ primary_index,
+ };
+
+ if selection.ranges.len() > 1 {
+ // TODO: only normalize if needed (any ranges out of order)
+ selection = selection.normalize();
}
- // TODO: only normalize if needed (any ranges out of order)
- Self::normalize(ranges, primary_index)
+ selection
}
- /// Takes a closure and maps each selection over the closure.
- pub fn transform<F>(&self, f: F) -> Self
+ /// Takes a closure and maps each `Range` over the closure.
+ pub fn transform<F>(mut self, f: F) -> Self
where
F: Fn(Range) -> Range,
{
- Self::new(
- self.ranges.iter().copied().map(f).collect(),
- self.primary_index,
- )
+ for range in self.ranges.iter_mut() {
+ *range = f(*range)
+ }
+
+ self.normalize()
+ }
+
+ /// A convenience short-cut for `transform(|r| r.min_width_1(text))`.
+ pub fn min_width_1(self, text: RopeSlice) -> Self {
+ self.transform(|r| r.min_width_1(text))
}
pub fn fragments<'a>(&'a self, text: RopeSlice<'a>) -> impl Iterator<Item = Cow<str>> + 'a {
@@ -363,7 +458,7 @@ pub fn select_on_matches(
let start = text.byte_to_char(start_byte + mat.start());
let end = text.byte_to_char(start_byte + mat.end());
- result.push(Range::new(start, end.saturating_sub(1)));
+ result.push(Range::new(start, end));
}
}
@@ -384,6 +479,12 @@ pub fn split_on_matches(
let mut result = SmallVec::with_capacity(selection.len());
for sel in selection {
+ // Special case: zero-width selection.
+ if sel.from() == sel.to() {
+ result.push(*sel);
+ continue;
+ }
+
// TODO: can't avoid occasional allocations since Regex can't operate on chunks yet
let fragment = sel.fragment(text);
@@ -396,13 +497,12 @@ pub fn split_on_matches(
for mat in regex.find_iter(&fragment) {
// TODO: retain range direction
-
let end = text.byte_to_char(start_byte + mat.start());
- result.push(Range::new(start, end.saturating_sub(1)));
+ result.push(Range::new(start, end));
start = text.byte_to_char(start_byte + mat.end());
}
- if start <= sel_end {
+ if start < sel_end {
result.push(Range::new(start, sel_end));
}
}
@@ -484,7 +584,7 @@ mod test {
.collect::<Vec<String>>()
.join(",");
- assert_eq!(res, "8/10,10/12");
+ assert_eq!(res, "8/10,10/12,12/12");
}
#[test]
@@ -498,35 +598,171 @@ mod test {
assert_eq!(range.contains(13), false);
let range = Range::new(9, 6);
- assert_eq!(range.contains(9), true);
+ assert_eq!(range.contains(9), false);
assert_eq!(range.contains(7), true);
- assert_eq!(range.contains(6), false);
+ assert_eq!(range.contains(6), true);
+ }
+
+ #[test]
+ fn test_overlaps() {
+ fn overlaps(a: (usize, usize), b: (usize, usize)) -> bool {
+ Range::new(a.0, a.1).overlaps(&Range::new(b.0, b.1))
+ }
+
+ // Two non-zero-width ranges, no overlap.
+ assert!(!overlaps((0, 3), (3, 6)));
+ assert!(!overlaps((0, 3), (6, 3)));
+ assert!(!overlaps((3, 0), (3, 6)));
+ assert!(!overlaps((3, 0), (6, 3)));
+ assert!(!overlaps((3, 6), (0, 3)));
+ assert!(!overlaps((3, 6), (3, 0)));
+ assert!(!overlaps((6, 3), (0, 3)));
+ assert!(!overlaps((6, 3), (3, 0)));
+
+ // Two non-zero-width ranges, overlap.
+ assert!(overlaps((0, 4), (3, 6)));
+ assert!(overlaps((0, 4), (6, 3)));
+ assert!(overlaps((4, 0), (3, 6)));
+ assert!(overlaps((4, 0), (6, 3)));
+ assert!(overlaps((3, 6), (0, 4)));
+ assert!(overlaps((3, 6), (4, 0)));
+ assert!(overlaps((6, 3), (0, 4)));
+ assert!(overlaps((6, 3), (4, 0)));
+
+ // Zero-width and non-zero-width range, no overlap.
+ assert!(!overlaps((0, 3), (3, 3)));
+ assert!(!overlaps((3, 0), (3, 3)));
+ assert!(!overlaps((3, 3), (0, 3)));
+ assert!(!overlaps((3, 3), (3, 0)));
+
+ // Zero-width and non-zero-width range, overlap.
+ assert!(overlaps((1, 4), (1, 1)));
+ assert!(overlaps((4, 1), (1, 1)));
+ assert!(overlaps((1, 1), (1, 4)));
+ assert!(overlaps((1, 1), (4, 1)));
+
+ assert!(overlaps((1, 4), (3, 3)));
+ assert!(overlaps((4, 1), (3, 3)));
+ assert!(overlaps((3, 3), (1, 4)));
+ assert!(overlaps((3, 3), (4, 1)));
+
+ // Two zero-width ranges, no overlap.
+ assert!(!overlaps((0, 0), (1, 1)));
+ assert!(!overlaps((1, 1), (0, 0)));
+
+ // Two zero-width ranges, overlap.
+ assert!(overlaps((1, 1), (1, 1)));
+ }
+
+ #[test]
+ fn test_graphem_aligned() {
+ let r = Rope::from_str("\r\nHi\r\n");
+ let s = r.slice(..);
+
+ // Zero-width.
+ assert_eq!(Range::new(0, 0).grapheme_aligned(s), Range::new(0, 0));
+ assert_eq!(Range::new(1, 1).grapheme_aligned(s), Range::new(0, 0));
+ assert_eq!(Range::new(2, 2).grapheme_aligned(s), Range::new(2, 2));
+ assert_eq!(Range::new(3, 3).grapheme_aligned(s), Range::new(3, 3));
+ assert_eq!(Range::new(4, 4).grapheme_aligned(s), Range::new(4, 4));
+ assert_eq!(Range::new(5, 5).grapheme_aligned(s), Range::new(4, 4));
+ assert_eq!(Range::new(6, 6).grapheme_aligned(s), Range::new(6, 6));
+
+ // Forward.
+ assert_eq!(Range::new(0, 1).grapheme_aligned(s), Range::new(0, 2));
+ assert_eq!(Range::new(1, 2).grapheme_aligned(s), Range::new(0, 2));
+ assert_eq!(Range::new(2, 3).grapheme_aligned(s), Range::new(2, 3));
+ assert_eq!(Range::new(3, 4).grapheme_aligned(s), Range::new(3, 4));
+ assert_eq!(Range::new(4, 5).grapheme_aligned(s), Range::new(4, 6));
+ assert_eq!(Range::new(5, 6).grapheme_aligned(s), Range::new(4, 6));
+
+ assert_eq!(Range::new(0, 2).grapheme_aligned(s), Range::new(0, 2));
+ assert_eq!(Range::new(1, 3).grapheme_aligned(s), Range::new(0, 3));
+ assert_eq!(Range::new(2, 4).grapheme_aligned(s), Range::new(2, 4));
+ assert_eq!(Range::new(3, 5).grapheme_aligned(s), Range::new(3, 6));
+ assert_eq!(Range::new(4, 6).grapheme_aligned(s), Range::new(4, 6));
+
+ // Reverse.
+ assert_eq!(Range::new(1, 0).grapheme_aligned(s), Range::new(2, 0));
+ assert_eq!(Range::new(2, 1).grapheme_aligned(s), Range::new(2, 0));
+ assert_eq!(Range::new(3, 2).grapheme_aligned(s), Range::new(3, 2));
+ assert_eq!(Range::new(4, 3).grapheme_aligned(s), Range::new(4, 3));
+ assert_eq!(Range::new(5, 4).grapheme_aligned(s), Range::new(6, 4));
+ assert_eq!(Range::new(6, 5).grapheme_aligned(s), Range::new(6, 4));
+
+ assert_eq!(Range::new(2, 0).grapheme_aligned(s), Range::new(2, 0));
+ assert_eq!(Range::new(3, 1).grapheme_aligned(s), Range::new(3, 0));
+ assert_eq!(Range::new(4, 2).grapheme_aligned(s), Range::new(4, 2));
+ assert_eq!(Range::new(5, 3).grapheme_aligned(s), Range::new(6, 3));
+ assert_eq!(Range::new(6, 4).grapheme_aligned(s), Range::new(6, 4));
+ }
+
+ #[test]
+ fn test_min_width_1() {
+ let r = Rope::from_str("\r\nHi\r\n");
+ let s = r.slice(..);
+
+ // Zero-width.
+ assert_eq!(Range::new(0, 0).min_width_1(s), Range::new(0, 2));
+ assert_eq!(Range::new(1, 1).min_width_1(s), Range::new(1, 2));
+ assert_eq!(Range::new(2, 2).min_width_1(s), Range::new(2, 3));
+ assert_eq!(Range::new(3, 3).min_width_1(s), Range::new(3, 4));
+ assert_eq!(Range::new(4, 4).min_width_1(s), Range::new(4, 6));
+ assert_eq!(Range::new(5, 5).min_width_1(s), Range::new(5, 6));
+ assert_eq!(Range::new(6, 6).min_width_1(s), Range::new(6, 6));
+
+ // Forward.
+ assert_eq!(Range::new(0, 1).min_width_1(s), Range::new(0, 1));
+ assert_eq!(Range::new(1, 2).min_width_1(s), Range::new(1, 2));
+ assert_eq!(Range::new(2, 3).min_width_1(s), Range::new(2, 3));
+ assert_eq!(Range::new(3, 4).min_width_1(s), Range::new(3, 4));
+ assert_eq!(Range::new(4, 5).min_width_1(s), Range::new(4, 5));
+ assert_eq!(Range::new(5, 6).min_width_1(s), Range::new(5, 6));
+
+ // Reverse.
+ assert_eq!(Range::new(1, 0).min_width_1(s), Range::new(1, 0));
+ assert_eq!(Range::new(2, 1).min_width_1(s), Range::new(2, 1));
+ assert_eq!(Range::new(3, 2).min_width_1(s), Range::new(3, 2));
+ assert_eq!(Range::new(4, 3).min_width_1(s), Range::new(4, 3));
+ assert_eq!(Range::new(5, 4).min_width_1(s), Range::new(5, 4));
+ assert_eq!(Range::new(6, 5).min_width_1(s), Range::new(6, 5));
}
#[test]
fn test_split_on_matches() {
use crate::regex::Regex;
- let text = Rope::from("abcd efg wrs xyz 123 456");
+ let text = Rope::from(" abcd efg wrs xyz 123 456");
- let selection = Selection::new(smallvec![Range::new(0, 8), Range::new(10, 19),], 0);
+ let selection = Selection::new(smallvec![Range::new(0, 9), Range::new(11, 20),], 0);
let result = split_on_matches(text.slice(..), &selection, &Regex::new(r"\s+").unwrap());
assert_eq!(
result.ranges(),
&[
- Range::new(0, 3),
- Range::new(5, 7),
- Range::new(10, 11),
- Range::new(15, 17),
- Range::new(19, 19),
+ // TODO: rather than this behavior, maybe we want it
+ // to be based on which side is the anchor?
+ //
+ // We get a leading zero-width range when there's
+ // a leading match because ranges are inclusive on
+ // the left. Imagine, for example, if the entire
+ // selection range were matched: you'd still want
+ // at least one range to remain after the split.
+ Range::new(0, 0),
+ Range::new(1, 5),
+ Range::new(6, 9),
+ Range::new(11, 13),
+ Range::new(16, 19),
+ // In contrast to the comment above, there is no
+ // _trailing_ zero-width range despite the trailing
+ // match, because ranges are exclusive on the right.
]
);
assert_eq!(
result.fragments(text.slice(..)).collect::<Vec<_>>(),
- &["abcd", "efg", "rs", "xyz", "1"]
+ &["", "abcd", "efg", "rs", "xyz"]
);
}
}
diff --git a/helix-core/src/surround.rs b/helix-core/src/surround.rs
index 52f60cab..af357c96 100644
--- a/helix-core/src/surround.rs
+++ b/helix-core/src/surround.rs
@@ -1,3 +1,4 @@
+use crate::graphemes::next_grapheme_boundary;
use crate::{search, Selection};
use ropey::RopeSlice;
@@ -40,23 +41,35 @@ pub fn find_nth_pairs_pos(
) -> Option<(usize, usize)> {
let (open, close) = get_pair(ch);
- let (open_pos, close_pos) = if open == close {
- let prev = search::find_nth_prev(text, open, pos, n, true);
- let next = search::find_nth_next(text, close, pos, n, true);
- if text.char(pos) == open {
- // cursor is *on* a pair
- next.map(|n| (pos, n)).or_else(|| prev.map(|p| (p, pos)))?
+ if text.len_chars() < 2 || pos >= text.len_chars() {
+ return None;
+ }
+
+ if open == close {
+ if Some(open) == text.get_char(pos) {
+ // Special case: cursor is directly on a matching char.
+ match pos {
+ 0 => Some((pos, search::find_nth_next(text, close, pos + 1, n, true)?)),
+ _ if (pos + 1) == text.len_chars() => Some((
+ search::find_nth_prev(text, open, pos, n, true)?,
+ text.len_chars(),
+ )),
+ // We return no match because there's no way to know which
+ // side of the char we should be searching on.
+ _ => None,
+ }
} else {
- (prev?, next?)
+ Some((
+ search::find_nth_prev(text, open, pos, n, true)?,
+ search::find_nth_next(text, close, pos, n, true)?,
+ ))
}
} else {
- (
+ Some((
find_nth_open_pair(text, open, close, pos, n)?,
- find_nth_close_pair(text, open, close, pos, n)?,
- )
- };
-
- Some((open_pos, close_pos))
+ next_grapheme_boundary(text, find_nth_close_pair(text, open, close, pos, n)?),
+ ))
+ }
}
fn find_nth_open_pair(
@@ -173,12 +186,13 @@ mod test {
let slice = doc.slice(..);
// cursor on [t]ext
- assert_eq!(find_nth_pairs_pos(slice, '(', 6, 1), Some((5, 10)));
- assert_eq!(find_nth_pairs_pos(slice, ')', 6, 1), Some((5, 10)));
+ assert_eq!(find_nth_pairs_pos(slice, '(', 6, 1), Some((5, 11)));
+ assert_eq!(find_nth_pairs_pos(slice, ')', 6, 1), Some((5, 11)));
// cursor on so[m]e
assert_eq!(find_nth_pairs_pos(slice, '(', 2, 1), None);
// cursor on bracket itself
- assert_eq!(find_nth_pairs_pos(slice, '(', 5, 1), Some((5, 10)));
+ assert_eq!(find_nth_pairs_pos(slice, '(', 5, 1), Some((5, 11)));
+ assert_eq!(find_nth_pairs_pos(slice, '(', 10, 1), Some((5, 11)));
}
#[test]
@@ -187,9 +201,9 @@ mod test {
let slice = doc.slice(..);
// cursor on go[o]d
- assert_eq!(find_nth_pairs_pos(slice, '(', 13, 1), Some((10, 15)));
- assert_eq!(find_nth_pairs_pos(slice, '(', 13, 2), Some((4, 21)));
- assert_eq!(find_nth_pairs_pos(slice, '(', 13, 3), Some((0, 27)));
+ assert_eq!(find_nth_pairs_pos(slice, '(', 13, 1), Some((10, 16)));
+ assert_eq!(find_nth_pairs_pos(slice, '(', 13, 2), Some((4, 22)));
+ assert_eq!(find_nth_pairs_pos(slice, '(', 13, 3), Some((0, 28)));
}
#[test]
@@ -198,14 +212,14 @@ mod test {
let slice = doc.slice(..);
// cursor on go[o]d
- assert_eq!(find_nth_pairs_pos(slice, '\'', 13, 1), Some((10, 15)));
- assert_eq!(find_nth_pairs_pos(slice, '\'', 13, 2), Some((4, 21)));
- assert_eq!(find_nth_pairs_pos(slice, '\'', 13, 3), Some((0, 27)));
+ assert_eq!(find_nth_pairs_pos(slice, '\'', 13, 1), Some((10, 16)));
+ assert_eq!(find_nth_pairs_pos(slice, '\'', 13, 2), Some((4, 22)));
+ assert_eq!(find_nth_pairs_pos(slice, '\'', 13, 3), Some((0, 28)));
// cursor on the quotes
- assert_eq!(find_nth_pairs_pos(slice, '\'', 10, 1), Some((10, 15)));
+ assert_eq!(find_nth_pairs_pos(slice, '\'', 10, 1), None);
// this is the best we can do since opening and closing pairs are same
- assert_eq!(find_nth_pairs_pos(slice, '\'', 0, 1), Some((0, 4)));
- assert_eq!(find_nth_pairs_pos(slice, '\'', 27, 1), Some((21, 27)));
+ assert_eq!(find_nth_pairs_pos(slice, '\'', 0, 1), Some((0, 5)));
+ assert_eq!(find_nth_pairs_pos(slice, '\'', 27, 1), Some((21, 28)));
}
#[test]
@@ -214,8 +228,8 @@ mod test {
let slice = doc.slice(..);
// cursor on go[o]d
- assert_eq!(find_nth_pairs_pos(slice, '(', 15, 1), Some((5, 24)));
- assert_eq!(find_nth_pairs_pos(slice, '(', 15, 2), Some((0, 31)));
+ assert_eq!(find_nth_pairs_pos(slice, '(', 15, 1), Some((5, 25)));
+ assert_eq!(find_nth_pairs_pos(slice, '(', 15, 2), Some((0, 32)));
}
#[test]
@@ -224,9 +238,9 @@ mod test {
let slice = doc.slice(..);
// cursor on go[o]d
- assert_eq!(find_nth_pairs_pos(slice, '{', 13, 1), Some((10, 15)));
- assert_eq!(find_nth_pairs_pos(slice, '[', 13, 1), Some((4, 21)));
- assert_eq!(find_nth_pairs_pos(slice, '(', 13, 1), Some((0, 27)));
+ assert_eq!(find_nth_pairs_pos(slice, '{', 13, 1), Some((10, 16)));
+ assert_eq!(find_nth_pairs_pos(slice, '[', 13, 1), Some((4, 22)));
+ assert_eq!(find_nth_pairs_pos(slice, '(', 13, 1), Some((0, 28)));
}
#[test]
@@ -243,7 +257,7 @@ mod test {
get_surround_pos(slice, &selection, '(', 1)
.unwrap()
.as_slice(),
- &[0, 5, 7, 13, 15, 23]
+ &[0, 6, 7, 14, 15, 24]
);
}
diff --git a/helix-core/src/syntax.rs b/helix-core/src/syntax.rs
index f249f5fe..d9bfc16f 100644
--- a/helix-core/src/syntax.rs
+++ b/helix-core/src/syntax.rs
@@ -1759,10 +1759,20 @@ impl<I: Iterator<Item = HighlightEvent>> Iterator for Merge<I> {
self.next_event = self.iter.next();
Some(event)
}
- // can happen if deleting and cursor at EOF, and diagnostic reaches past the end
- (None, Some((_, _))) => {
- self.next_span = None;
- None
+ // Can happen if cursor at EOF and/or diagnostic reaches past the end.
+ // We need to actually emit events for the cursor-at-EOF situation,
+ // even though the range is past the end of the text. This needs to be
+ // handled appropriately by the drawing code by not assuming that
+ // all `Source` events point to valid indices in the rope.
+ (None, Some((span, range))) => {
+ let event = HighlightStart(Highlight(*span));
+ self.queue.push(HighlightEnd);
+ self.queue.push(Source {
+ start: range.start,
+ end: range.end,
+ });
+ self.next_span = self.spans.next();
+ Some(event)
}
(None, None) => None,
e => unreachable!("{:?}", e),
diff --git a/helix-core/src/textobject.rs b/helix-core/src/textobject.rs
index fbf66256..ae18d7cf 100644
--- a/helix-core/src/textobject.rs
+++ b/helix-core/src/textobject.rs
@@ -1,21 +1,16 @@
use ropey::RopeSlice;
-use crate::chars::{categorize_char, char_is_line_ending, char_is_whitespace, CharCategory};
-use crate::movement::{self, Direction};
+use crate::chars::{categorize_char, CharCategory};
+use crate::graphemes::{next_grapheme_boundary, prev_grapheme_boundary};
+use crate::movement::Direction;
use crate::surround;
use crate::Range;
-fn this_word_end_pos(slice: RopeSlice, pos: usize) -> usize {
- this_word_bound_pos(slice, pos, Direction::Forward)
-}
-
-fn this_word_start_pos(slice: RopeSlice, pos: usize) -> usize {
- this_word_bound_pos(slice, pos, Direction::Backward)
-}
+fn find_word_boundary(slice: RopeSlice, mut pos: usize, direction: Direction) -> usize {
+ use CharCategory::{Eol, Whitespace};
-fn this_word_bound_pos(slice: RopeSlice, mut pos: usize, direction: Direction) -> usize {
let iter = match direction {
- Direction::Forward => slice.chars_at(pos + 1),
+ Direction::Forward => slice.chars_at(pos),
Direction::Backward => {
let mut iter = slice.chars_at(pos);
iter.reverse();
@@ -23,25 +18,32 @@ fn this_word_bound_pos(slice: RopeSlice, mut pos: usize, direction: Direction) -
}
};
- match categorize_char(slice.char(pos)) {
- CharCategory::Eol | CharCategory::Whitespace => pos,
- category => {
- for peek in iter {
- let curr_category = categorize_char(peek);
- if curr_category != category
- || curr_category == CharCategory::Eol
- || curr_category == CharCategory::Whitespace
- {
+ let mut prev_category = match direction {
+ Direction::Forward if pos == 0 => Whitespace,
+ Direction::Forward => categorize_char(slice.char(pos - 1)),
+ Direction::Backward if pos == slice.len_chars() => Whitespace,
+ Direction::Backward => categorize_char(slice.char(pos)),
+ };
+
+ for ch in iter {
+ match categorize_char(ch) {
+ Eol | Whitespace => return pos,
+ category => {
+ if category != prev_category && pos != 0 && pos != slice.len_chars() {
return pos;
- }
- pos = match direction {
- Direction::Forward => pos + 1,
- Direction::Backward => pos.saturating_sub(1),
+ } else {
+ if direction == Direction::Forward {
+ pos += 1;
+ } else {
+ pos = pos.saturating_sub(1);
+ }
+ prev_category = category;
}
}
- pos
}
}
+
+ pos
}
#[derive(Copy, Clone, PartialEq, Eq, Debug)]
@@ -55,46 +57,42 @@ pub fn textobject_word(
slice: RopeSlice,
range: Range,
textobject: TextObject,
- count: usize,
+ _count: usize,
) -> Range {
- let this_word_start = this_word_start_pos(slice, range.head);
- let this_word_end = this_word_end_pos(slice, range.head);
+ // For 1-width cursor semantics.
+ let head = if range.head > range.anchor {
+ prev_grapheme_boundary(slice, range.head)
+ } else {
+ range.head
+ };
+
+ let word_start = find_word_boundary(slice, head, Direction::Backward);
+ let word_end = match slice.get_char(head).map(categorize_char) {
+ None | Some(CharCategory::Whitespace | CharCategory::Eol) => head,
+ _ => find_word_boundary(slice, head + 1, Direction::Forward),
+ };
+
+ // Special case.
+ if word_start == word_end {
+ return Range::new(word_start, word_end);
+ }
- let (anchor, head);
match textobject {
- TextObject::Inside => {
- anchor = this_word_start;
- head = this_word_end;
- }
- TextObject::Around => {
- if slice
- .get_char(this_word_end + 1)
- .map_or(true, char_is_line_ending)
+ TextObject::Inside => Range::new(word_start, word_end),
+ TextObject::Around => Range::new(
+ match slice
+ .get_char(word_start.saturating_sub(1))
+ .map(categorize_char)
{
- head = this_word_end;
- if slice
- .get_char(this_word_start.saturating_sub(1))
- .map_or(true, char_is_line_ending)
- {
- // single word on a line
- anchor = this_word_start;
- } else {
- // last word on a line, select the whitespace before it too
- anchor = movement::move_prev_word_end(slice, range, count).head;
- }
- } else if char_is_whitespace(slice.char(range.head)) {
- // select whole whitespace and next word
- head = movement::move_next_word_end(slice, range, count).head;
- anchor = movement::backwards_skip_while(slice, range.head, |c| c.is_whitespace())
- .map(|p| p + 1) // p is first *non* whitespace char, so +1 to get whitespace pos
- .unwrap_or(0);
- } else {
- head = movement::move_next_word_start(slice, range, count).head;
- anchor = this_word_start;
- }
- }
- };
- Range::new(anchor, head)
+ None | Some(CharCategory::Eol) => word_start,
+ _ => prev_grapheme_boundary(slice, word_start),
+ },
+ match slice.get_char(word_end).map(categorize_char) {
+ None | Some(CharCategory::Eol) => word_end,
+ _ => next_grapheme_boundary(slice, word_end),
+ },
+ ),
+ }
}
pub fn textobject_surround(
@@ -106,7 +104,10 @@ pub fn textobject_surround(
) -> Range {
surround::find_nth_pairs_pos(slice, ch, range.head, count)
.map(|(anchor, head)| match textobject {
- TextObject::Inside => Range::new(anchor + 1, head.saturating_sub(1)),
+ TextObject::Inside => Range::new(
+ next_grapheme_boundary(slice, anchor),
+ prev_grapheme_boundary(slice, head),
+ ),
TextObject::Around => Range::new(anchor, head),
})
.unwrap_or(range)
@@ -126,70 +127,70 @@ mod test {
let tests = &[
(
"cursor at beginning of doc",
- vec![(0, Inside, (0, 5)), (0, Around, (0, 6))],
+ vec![(0, Inside, (0, 6)), (0, Around, (0, 7))],
),
(
"cursor at middle of word",
vec![
- (13, Inside, (10, 15)),
- (10, Inside, (10, 15)),
- (15, Inside, (10, 15)),
- (13, Around, (10, 16)),
- (10, Around, (10, 16)),
- (15, Around, (10, 16)),
+ (13, Inside, (10, 16)),
+ (10, Inside, (10, 16)),
+ (15, Inside, (10, 16)),
+ (13, Around, (9, 17)),
+ (10, Around, (9, 17)),
+ (15, Around, (9, 17)),
],
),
(
"cursor between word whitespace",
- vec![(6, Inside, (6, 6)), (6, Around, (6, 13))],
+ vec![(6, Inside, (6, 6)), (6, Around, (6, 6))],
),
(
"cursor on word before newline\n",
vec![
- (22, Inside, (22, 28)),
- (28, Inside, (22, 28)),
- (25, Inside, (22, 28)),
- (22, Around, (21, 28)),
- (28, Around, (21, 28)),
- (25, Around, (21, 28)),
+ (22, Inside, (22, 29)),
+ (28, Inside, (22, 29)),
+ (25, Inside, (22, 29)),
+ (22, Around, (21, 29)),
+ (28, Around, (21, 29)),
+ (25, Around, (21, 29)),
],
),
(
"cursor on newline\nnext line",
- vec![(17, Inside, (17, 17)), (17, Around, (17, 22))],
+ vec![(17, Inside, (17, 17)), (17, Around, (17, 17))],
),
(
"cursor on word after newline\nnext line",
vec![
- (29, Inside, (29, 32)),
- (30, Inside, (29, 32)),
- (32, Inside, (29, 32)),
- (29, Around, (29, 33)),
- (30, Around, (29, 33)),
- (32, Around, (29, 33)),
+ (29, Inside, (29, 33)),
+ (30, Inside, (29, 33)),
+ (32, Inside, (29, 33)),
+ (29, Around, (29, 34)),
+ (30, Around, (29, 34)),
+ (32, Around, (29, 34)),
],
),
(
"cursor on #$%:;* punctuation",
vec![
- (13, Inside, (10, 15)),
- (10, Inside, (10, 15)),
- (15, Inside, (10, 15)),
- (13, Around, (10, 16)),
- (10, Around, (10, 16)),
- (15, Around, (10, 16)),
+ (13, Inside, (10, 16)),
+ (10, Inside, (10, 16)),
+ (15, Inside, (10, 16)),
+ (13, Around, (9, 17)),
+ (10, Around, (9, 17)),
+ (15, Around, (9, 17)),
],
),
(
"cursor on punc%^#$:;.tuation",
vec![
- (14, Inside, (14, 20)),
- (20, Inside, (14, 20)),
- (17, Inside, (14, 20)),
- (14, Around, (14, 20)),
+ (14, Inside, (14, 21)),
+ (20, Inside, (14, 21)),
+ (17, Inside, (14, 21)),
+ (14, Around, (13, 22)),
// FIXME: edge case
// (20, Around, (14, 20)),
- (17, Around, (14, 20)),
+ (17, Around, (13, 22)),
],
),
(
@@ -198,14 +199,14 @@ mod test {
(9, Inside, (9, 9)),
(10, Inside, (10, 10)),
(11, Inside, (11, 11)),
- (9, Around, (9, 16)),
- (10, Around, (9, 16)),
- (11, Around, (9, 16)),
+ (9, Around, (9, 9)),
+ (10, Around, (10, 10)),
+ (11, Around, (11, 11)),
],
),
(
"cursor at end of doc",
- vec![(19, Inside, (17, 19)), (19, Around, (16, 19))],
+ vec![(19, Inside, (17, 20)), (19, Around, (16, 20))],
),
];
@@ -234,67 +235,67 @@ mod test {
"simple (single) surround pairs",
vec![
(3, Inside, (3, 3), '(', 1),
- (7, Inside, (8, 13), ')', 1),
- (10, Inside, (8, 13), '(', 1),
- (14, Inside, (8, 13), ')', 1),
+ (7, Inside, (8, 14), ')', 1),
+ (10, Inside, (8, 14), '(', 1),
+ (14, Inside, (8, 14), ')', 1),
(3, Around, (3, 3), '(', 1),
- (7, Around, (7, 14), ')', 1),
- (10, Around, (7, 14), '(', 1),
- (14, Around, (7, 14), ')', 1),
+ (7, Around, (7, 15), ')', 1),
+ (10, Around, (7, 15), '(', 1),
+ (14, Around, (7, 15), ')', 1),
],
),
(
"samexx 'single' surround pairs",
vec![
(3, Inside, (3, 3), '\'', 1),
- (7, Inside, (8, 13), '\'', 1),
- (10, Inside, (8, 13), '\'', 1),
- (14, Inside, (8, 13), '\'', 1),
+ (7, Inside, (7, 7), '\'', 1),
+ (10, Inside, (8, 14), '\'', 1),
+ (14, Inside, (14, 14), '\'', 1),
(3, Around, (3, 3), '\'', 1),
- (7, Around, (7, 14), '\'', 1),
- (10, Around, (7, 14), '\'', 1),
- (14, Around, (7, 14), '\'', 1),
+ (7, Around, (7, 7), '\'', 1),
+ (10, Around, (7, 15), '\'', 1),
+ (14, Around, (14, 14), '\'', 1),
],
),
(
"(nested (surround (pairs)) 3 levels)",
vec![
- (0, Inside, (1, 34), '(', 1),
- (6, Inside, (1, 34), ')', 1),
- (8, Inside, (9, 24), '(', 1),
- (8, Inside, (9, 34), ')', 2),
- (20, Inside, (9, 24), '(', 2),
- (20, Inside, (1, 34), ')', 3),
- (0, Around, (0, 35), '(', 1),
- (6, Around, (0, 35), ')', 1),
- (8, Around, (8, 25), '(', 1),
- (8, Around, (8, 35), ')', 2),
- (20, Around, (8, 25), '(', 2),
- (20, Around, (0, 35), ')', 3),
+ (0, Inside, (1, 35), '(', 1),
+ (6, Inside, (1, 35), ')', 1),
+ (8, Inside, (9, 25), '(', 1),
+ (8, Inside, (9, 35), ')', 2),
+ (20, Inside, (9, 25), '(', 2),
+ (20, Inside, (1, 35), ')', 3),
+ (0, Around, (0, 36), '(', 1),
+ (6, Around, (0, 36), ')', 1),
+ (8, Around, (8, 26), '(', 1),
+ (8, Around, (8, 36), ')', 2),
+ (20, Around, (8, 26), '(', 2),
+ (20, Around, (0, 36), ')', 3),
],
),
(
"(mixed {surround [pair] same} line)",
vec![
- (2, Inside, (1, 33), '(', 1),
- (9, Inside, (8, 27), '{', 1),
- (18, Inside, (18, 21), '[', 1),
- (2, Around, (0, 34), '(', 1),
- (9, Around, (7, 28), '{', 1),
- (18, Around, (17, 22), '[', 1),
+ (2, Inside, (1, 34), '(', 1),
+ (9, Inside, (8, 28), '{', 1),
+ (18, Inside, (18, 22), '[', 1),
+ (2, Around, (0, 35), '(', 1),
+ (9, Around, (7, 29), '{', 1),
+ (18, Around, (17, 23), '[', 1),
],
),
(
"(stepped (surround) pairs (should) skip)",
- vec![(22, Inside, (1, 38), '(', 1), (22, Around, (0, 39), '(', 1)],
+ vec![(22, Inside, (1, 39), '(', 1), (22, Around, (0, 40), '(', 1)],
),
(
"[surround pairs{\non different]\nlines}",
vec![
- (7, Inside, (1, 28), '[', 1),
- (15, Inside, (16, 35), '{', 1),
- (7, Around, (0, 29), '[', 1),
- (15, Around, (15, 36), '{', 1),
+ (7, Inside, (1, 29), '[', 1),
+ (15, Inside, (16, 36), '{', 1),
+ (7, Around, (0, 30), '[', 1),
+ (15, Around, (15, 37), '{', 1),
],
),
];
generated by cgit v1.2.3-70-g09d2 (git 2.47.1) at 2025-01-04 11:06:34 +0000