Struct RopeScanner
pub struct RopeScanner<'a> { /* private fields */ }Expand description
Utility for efficiently comparing two ropes.
Implementations§
§impl<'a> RopeScanner<'a>
impl<'a> RopeScanner<'a>
pub fn new( base: &'a Node<RopeInfo>, target: &'a Node<RopeInfo>, ) -> RopeScanner<'a>
pub fn find_ne_char_back<T>(
&mut self,
base_off: usize,
targ_off: usize,
stop: T,
) -> usize
pub fn find_ne_char_back<T>( &mut self, base_off: usize, targ_off: usize, stop: T, ) -> usize
Starting from the two provided offsets in the corresponding ropes, Returns the distance, moving backwards, to the first non-equal codepoint. If no such position exists, returns the distance to the closest 0 offset.
if stop is not None, the scan will stop at if it reaches this value.
§Examples
let one = Rope::from("hiii");
let two = Rope::from("siii");
let mut scanner = RopeScanner::new(&one, &two);
assert_eq!(scanner.find_ne_char_back(one.len(), two.len(), None), 3);
assert_eq!(scanner.find_ne_char_back(one.len(), two.len(), 2), 2);pub fn find_ne_char<T>(
&mut self,
base_off: usize,
targ_off: usize,
stop: T,
) -> usize
pub fn find_ne_char<T>( &mut self, base_off: usize, targ_off: usize, stop: T, ) -> usize
Starting from the two provided offsets into the two ropes, returns the distance (in bytes) to the first non-equal codepoint. If no such position exists, returns the shortest distance to the end of a rope.
This can be thought of as the length of the longest common substring
between base[base_off..] and target[targ_off..].
if stop is not None, the scan will stop at if it reaches this value.
§Examples
let one = Rope::from("uh-oh🙈");
let two = Rope::from("uh-oh🙉");
let mut scanner = RopeScanner::new(&one, &two);
assert_eq!(scanner.find_ne_char(0, 0, None), 5);
assert_eq!(scanner.find_ne_char(0, 0, 3), 3);pub fn find_min_diff_range(&mut self) -> (usize, usize)
pub fn find_min_diff_range(&mut self) -> (usize, usize)
Returns the positive offset from the start of the rope to the first non-equal byte, and the negative offset from the end of the rope to the first non-equal byte.
The two offsets are guaranteed not to overlap;
thus sum(start_offset, end_offset) <= min(one.len(), two.len()).
§Examples
let one = Rope::from("123xxx12345");
let two = Rope::from("123ZZZ12345");
let mut scanner = RopeScanner::new(&one, &two);
assert_eq!(scanner.find_min_diff_range(), (3, 5));
let one = Rope::from("friends");
let two = Rope::from("fiends");
let mut scanner = RopeScanner::new(&one, &two);
assert_eq!(scanner.find_min_diff_range(), (1, 5))Auto Trait Implementations§
impl<'a> Freeze for RopeScanner<'a>
impl<'a> RefUnwindSafe for RopeScanner<'a>
impl<'a> Send for RopeScanner<'a>
impl<'a> Sync for RopeScanner<'a>
impl<'a> Unpin for RopeScanner<'a>
impl<'a> UnsafeUnpin for RopeScanner<'a>
impl<'a> UnwindSafe for RopeScanner<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more