[−][src]Struct luaparse::InputCursor
An input cursor.
Implementations
impl<'a> InputCursor<'a>
[src]
pub fn new(buf: &'a str) -> Self
[src]
Create a new cursor from a buffer.
pub fn peek_nth(&self, n: usize) -> Option<char>
[src]
Returns the n
th character after the cursor without advancing the cursor.
let cursor = InputCursor::new("hello world!"); assert_eq!(cursor.peek_nth(0), Some('h')); assert_eq!(cursor.peek_nth(2), Some('l'));
pub fn peek(&self) -> Option<char>
[src]
Returns the next character without advancing the cursor. Equivalent to peek_nth(0)
.
let cursor = InputCursor::new("hello world!"); assert_eq!(cursor.peek(), Some('h')); assert_eq!(cursor.peek(), cursor.peek_nth(0));
pub fn pos(&self) -> Position
[src]
Returns the position of the following character.
let mut cursor = InputCursor::new("hello\nworld"); assert_eq!(cursor.pos(), Position { byte: 0, line: 1, col: 1, }); cursor.skip_n(5); assert_eq!(cursor.pos(), Position { byte: 5, line: 1, col: 6, }); cursor.next(); assert_eq!(cursor.pos(), Position { byte: 6, line: 2, col: 1, });
pub fn pos_no_newline(&self) -> Position
[src]
Returns the position of the following character.
Only differs from pos
when the cursor is immediately after a newline character.
In that case, unlike pos
, this method does not go to the next line.
let mut cursor = InputCursor::new("hello\nworld"); assert_eq!(cursor.pos(), Position { byte: 0, line: 1, col: 1, }); cursor.skip_n(5); assert_eq!(cursor.pos(), Position { byte: 5, line: 1, col: 6, }); cursor.next(); assert_eq!(cursor.pos(), Position { byte: 6, line: 1, col: 7, });
pub fn prev_pos(&self) -> Position
[src]
Returns the position of the preceding character.
let mut cursor = InputCursor::new("hello\nworld"); assert_eq!(cursor.prev_pos(), Position { byte: 0, line: 1, col: 1, }); cursor.skip_n(5); assert_eq!(cursor.prev_pos(), Position { byte: 4, line: 1, col: 5, }); cursor.next(); assert_eq!(cursor.prev_pos(), Position { byte: 5, line: 1, col: 6, });
pub fn remaining(&self) -> &'a str
[src]
Returns the remaining string as a subslice.
let mut cursor = InputCursor::new("hello world"); cursor.skip_n(6); assert_eq!(cursor.remaining(), "world");
pub fn substr<I>(&self, range: I) -> &'a str where
I: RangeBounds<Position>,
[src]
I: RangeBounds<Position>,
Returns a substring of the buffer.
Accepts a range defined by two Position
s.
The positions must be previously obtained using pos
or its variant. The function may
panic if the position is invalid.
let mut cursor = InputCursor::new("hello world!"); let start = cursor.pos(); cursor.skip_n(5); let end = cursor.prev_pos(); assert_eq!(cursor.substr(start..=end), "hello");
pub fn skip_n(&mut self, n: usize)
[src]
Advances the cursor by n
characters.
let mut cursor = InputCursor::new("hello world!"); cursor.skip_n(6); assert_eq!(cursor.remaining(), "world!");
pub fn consume_n(&mut self, n: usize) -> &'a str
[src]
Consumes n
characters starting from the current position.
let mut cursor = InputCursor::new("hello world!"); let s = cursor.consume_n(5); assert_eq!(s, "hello"); assert_eq!(cursor.remaining(), " world!");
pub fn consume_n_if<P>(&mut self, n: usize, predicate: P) -> Option<&'a str> where
P: FnOnce(&str) -> bool,
[src]
P: FnOnce(&str) -> bool,
Consumes n
characters starting from the current position if the consumed string satisfies
a predicate.
let mut cursor = InputCursor::new("hello world!"); assert_eq!(cursor.consume_n_if(5, |s| s.chars().all(|c| c.is_ascii_alphanumeric())), Some("hello")); assert_eq!(cursor.remaining(), " world!"); assert_eq!(cursor.consume_n_if(5, |s| s.chars().all(|c| c.is_ascii_alphanumeric())), None); assert_eq!(cursor.remaining(), " world!"); assert_eq!(cursor.consume_n_if(100, |_| true), None);
pub fn consume_if<P>(&mut self, predicate: P) -> Option<char> where
P: FnOnce(char) -> bool,
[src]
P: FnOnce(char) -> bool,
Consumes the following character if it satisfies the predicate.
let mut cursor = InputCursor::new("hello world!"); assert_eq!(cursor.consume_if(|c| c.is_ascii_alphanumeric()), Some('h')); assert_eq!(cursor.consume_if(|c| c == ' '), None);
pub fn consume_while<P>(&mut self, predicate: P) -> Option<&'a str> where
P: FnMut(char) -> bool,
[src]
P: FnMut(char) -> bool,
Consumes characters while the predicate is satisfied. Returns None
if the string is
empty.
let mut cursor = InputCursor::new("hello\nworld!"); assert_eq!(cursor.consume_while(|c| c != '\n'), Some("hello")); assert_eq!(cursor.consume_while(|c| c != '\n'), None); assert_eq!(cursor.next(), Some('\n'));
pub fn consume_first_n_while<P>(
&mut self,
n: usize,
predicate: P
) -> Option<&'a str> where
P: FnMut(char) -> bool,
[src]
&mut self,
n: usize,
predicate: P
) -> Option<&'a str> where
P: FnMut(char) -> bool,
Consumes no more than n
characters while they satisfy the predicate. Returns None
if
the string is empty.
let mut cursor = InputCursor::new("hello\nworld!"); assert_eq!(cursor.consume_first_n_while(4, |c| c != '\n'), Some("hell")); assert_eq!(cursor.consume_first_n_while(4, |c| c != '\n'), Some("o")); assert_eq!(cursor.consume_first_n_while(4, |c| c != '\n'), None);
pub fn starts_with(&self, s: &str) -> bool
[src]
Checks whether the remaining string starts with the given substring.
let mut cursor = InputCursor::new("hello\nworld!"); assert!(cursor.starts_with("hell")); cursor.skip_n(2); assert!(cursor.starts_with("llo\nw")); assert!(!cursor.starts_with("jelly"));
pub fn skip_line(&mut self) -> Position
[src]
Skips the characters until the next line. Returns the position of the character preceding
the line terminator (\r
, \n
, \r\n
, \n\r
).
let mut cursor = InputCursor::new("hello\r\nworld!"); let start = cursor.pos(); let end = cursor.skip_line(); assert_eq!(cursor.substr(start..=end), "hello"); assert_eq!(cursor.remaining(), "world!");
Trait Implementations
impl<'a> Clone for InputCursor<'a>
[src]
fn clone(&self) -> InputCursor<'a>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<'a> Debug for InputCursor<'a>
[src]
impl<'a> Iterator for InputCursor<'a>
[src]
type Item = char
The type of the elements being iterated over.
fn next(&mut self) -> Option<char>
[src]
fn size_hint(&self) -> (usize, Option<usize>)
1.0.0[src]
fn count(self) -> usize
1.0.0[src]
fn last(self) -> Option<Self::Item>
1.0.0[src]
fn nth(&mut self, n: usize) -> Option<Self::Item>
1.0.0[src]
fn step_by(self, step: usize) -> StepBy<Self>
1.28.0[src]
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
1.0.0[src]
U: IntoIterator<Item = Self::Item>,
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
1.0.0[src]
U: IntoIterator,
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
1.0.0[src]
F: FnMut(Self::Item) -> B,
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
1.21.0[src]
F: FnMut(Self::Item),
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(Self::Item) -> Option<B>,
fn enumerate(self) -> Enumerate<Self>
1.0.0[src]
fn peekable(self) -> Peekable<Self>
1.0.0[src]
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where
P: FnMut(Self::Item) -> Option<B>,
[src]
P: FnMut(Self::Item) -> Option<B>,
fn skip(self, n: usize) -> Skip<Self>
1.0.0[src]
fn take(self, n: usize) -> Take<Self>
1.0.0[src]
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(&mut St, Self::Item) -> Option<B>,
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
1.0.0[src]
F: FnMut(Self::Item) -> U,
U: IntoIterator,
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
1.29.0[src]
Self::Item: IntoIterator,
fn fuse(self) -> Fuse<Self>
1.0.0[src]
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item),
1.0.0[src]
F: FnMut(&Self::Item),
fn by_ref(&mut self) -> &mut Self
1.0.0[src]
#[must_use =
"if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
1.0.0[src]
B: FromIterator<Self::Item>,
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
1.0.0[src]
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
P: FnMut(&T) -> bool,
Self: DoubleEndedIterator<Item = &'a mut T>,
T: 'a,
[src]
P: FnMut(&T) -> bool,
Self: DoubleEndedIterator<Item = &'a mut T>,
T: 'a,
fn is_partitioned<P>(self, predicate: P) -> bool where
P: FnMut(Self::Item) -> bool,
[src]
P: FnMut(Self::Item) -> bool,
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
1.27.0[src]
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
fn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
1.27.0[src]
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.0.0[src]
F: FnMut(B, Self::Item) -> B,
fn fold_first<F>(self, f: F) -> Option<Self::Item> where
F: FnMut(Self::Item, Self::Item) -> Self::Item,
[src]
F: FnMut(Self::Item, Self::Item) -> Self::Item,
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
fn find_map<B, F>(&mut self, f: F) -> Option<B> where
F: FnMut(Self::Item) -> Option<B>,
1.30.0[src]
F: FnMut(Self::Item) -> Option<B>,
fn try_find<F, E, R>(&mut self, f: F) -> Result<Option<Self::Item>, E> where
F: FnMut(&Self::Item) -> R,
R: Try<Ok = bool, Error = E>,
[src]
F: FnMut(&Self::Item) -> R,
R: Try<Ok = bool, Error = E>,
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
fn max(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
fn min(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
1.0.0[src]
Self: DoubleEndedIterator,
fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
1.0.0[src]
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
fn copied<'a, T>(self) -> Copied<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
1.36.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
1.0.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
fn cycle(self) -> Cycle<Self> where
Self: Clone,
1.0.0[src]
Self: Clone,
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
1.11.0[src]
S: Sum<Self::Item>,
fn product<P>(self) -> P where
P: Product<Self::Item>,
1.11.0[src]
P: Product<Self::Item>,
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
1.5.0[src]
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
I: IntoIterator,
[src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
I: IntoIterator,
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
I: IntoIterator,
[src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
I: IntoIterator,
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn eq_by<I, F>(self, other: I, eq: F) -> bool where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
I: IntoIterator,
[src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
I: IntoIterator,
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,
[src]
Self::Item: PartialOrd<Self::Item>,
fn is_sorted_by<F>(self, compare: F) -> bool where
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
[src]
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
[src]
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
Auto Trait Implementations
impl<'a> RefUnwindSafe for InputCursor<'a>
impl<'a> Send for InputCursor<'a>
impl<'a> Sync for InputCursor<'a>
impl<'a> Unpin for InputCursor<'a>
impl<'a> UnwindSafe for InputCursor<'a>
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,