1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128
//! See [`Scanner`] docs for more information and its [methods]
//! for many examples.
//!
//! [methods]: Scanner#implementations
#![forbid(unsafe_code)]
#![forbid(elided_lifetimes_in_paths)]
#[cfg(feature = "ext")]
pub mod ext;
pub mod prelude {
pub use super::{ScanResult, Scanner, ScannerItem, ScannerResult};
}
mod private {
pub trait Sealed {}
impl Sealed for crate::Scanner<'_> {}
impl Sealed for str {}
}
pub use char_ranges::{CharRanges, CharRangesExt, CharRangesOffset};
use std::ops::Range;
pub type ScannerItem<T> = (Range<usize>, T);
pub type ScannerResult<'text, T> = Result<ScannerItem<T>, ScannerItem<&'text str>>;
pub type ScanResult<'text> = Result<(), ScannerItem<&'text str>>;
/// A `Scanner` is a UTF-8 [`char`] text scanner, implementing various methods
/// for scanning a string slice, as well as backtracking capabilities, which
/// can be used to implement lexers for tokenizing text or code. It is essentially
/// just a fancy wrapper around [`CharRanges`].
///
/// **Note:** Cloning `Scanner` is essentially a copy, as it just contains
/// a `&str` and a `usize` for its `cursor`. However, `Copy` is not
/// implemented, to avoid accidentally copying immutable `Scanner`s.
#[derive(Clone, Debug)]
pub struct Scanner<'text> {
text: &'text str,
cursor: usize,
}
impl<'text> Scanner<'text> {
/// Constructs a new [`Scanner`] with `text`.
#[inline]
pub fn new(text: &'text str) -> Self {
Self { text, cursor: 0 }
}
/// Returns the `text` the scanner was constructed with.
///
/// **Note:** This has the same lifetime as the original `text`,
/// so the scanner can continue to be used while this exists.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello World");
///
/// assert_eq!(scanner.next(), Ok((0..1, 'H')));
/// assert_eq!(scanner.next(), Ok((1..2, 'e')));
///
/// assert_eq!(scanner.text(), "Hello World");
/// assert_eq!(scanner.remaining_text(), "llo World");
/// ```
#[inline]
pub fn text(&self) -> &'text str {
self.text
}
/// Returns the remaining `text` of the scanner, i.e. the [`text()`]
/// after [`cursor_pos()`], in other words
/// <code style="white-space: nowrap;">self.[text()]\[self.[cursor_pos()]..]</code>.
///
/// **Note:** This has the same lifetime as the original `text`,
/// so the scanner can continue to be used while this exists.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello World");
///
/// assert_eq!(scanner.text(), "Hello World");
/// assert_eq!(scanner.remaining_text(), "Hello World");
///
/// assert_eq!(scanner.next(), Ok((0..1, 'H')));
/// assert_eq!(scanner.next(), Ok((1..2, 'e')));
///
/// assert_eq!(scanner.text(), "Hello World");
/// assert_eq!(scanner.remaining_text(), "llo World");
/// ```
///
/// [`text()`]: Self::text
/// [text()]: Self::text
/// [`cursor_pos()`]: Self::cursor_pos
/// [cursor_pos()]: Self::cursor_pos
#[inline]
pub fn remaining_text(&self) -> &'text str {
&self.text[self.cursor..]
}
/// Returns `true` if [`remaining_text()`] has text, i.e.
/// if it is not [empty].
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Foo");
///
/// # assert_eq!(scanner.text(), "Foo");
/// assert_eq!(scanner.remaining_text(), "Foo");
/// assert_eq!(scanner.has_remaining_text(), true);
///
/// assert_eq!(scanner.next(), Ok((0..1, 'F')));
/// assert_eq!(scanner.next(), Ok((1..2, 'o')));
/// assert_eq!(scanner.next(), Ok((2..3, 'o')));
///
/// # assert_eq!(scanner.text(), "Foo");
/// assert_eq!(scanner.remaining_text(), "");
/// assert_eq!(scanner.has_remaining_text(), false);
/// ```
///
/// [`remaining_text()`]: Self::remaining_text
/// [empty]: https://doc.rust-lang.org/std/primitive.str.html#method.is_empty
#[inline]
pub fn has_remaining_text(&self) -> bool {
self.cursor < self.text.len()
}
/// Utility for turning a `Range<usize>` into `(Range<usize>, &'text str)`.
/// Where `range` is the start end end byte index relative to [`text()`].
///
/// The same as `(range.clone(), &self.text()[range])`.
///
/// [`text()`]: Self::text
#[inline]
pub fn ranged_text(&self, range: Range<usize>) -> ScannerItem<&'text str> {
(range.clone(), &self.text[range])
}
/// Returns the current cursor position of the
/// scanner, i.e. the byte offset into [`text()`].
///
/// [`text()`]: Self::text
#[inline]
pub fn cursor_pos(&self) -> usize {
self.cursor
}
/// Replaces the current cursor position with `pos`,
/// while returning the old cursor position.
///
/// # Panics
///
/// If `pos` is not at a valid UTF-8 sequence boundary,
/// then the next operation using the cursor position
/// will panic.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello World");
///
/// assert_eq!(scanner.next(), Ok((0..1, 'H')));
///
/// let backtrack = scanner.cursor_pos();
///
/// assert_eq!(scanner.next(), Ok((1..2, 'e')));
/// assert_eq!(scanner.next(), Ok((2..3, 'l')));
/// assert_eq!(scanner.next(), Ok((3..4, 'l')));
///
/// scanner.set_cursor_pos(backtrack);
///
/// assert_eq!(scanner.next(), Ok((1..2, 'e')));
/// assert_eq!(scanner.next(), Ok((2..3, 'l')));
/// assert_eq!(scanner.next(), Ok((3..4, 'l')));
/// ```
#[inline]
pub fn set_cursor_pos(&mut self, pos: usize) -> usize {
let old_pos = self.cursor;
self.cursor = pos;
old_pos
}
/// Resets the cursor position to the start, while returning
/// the old cursor position.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// # let mut scanner = Scanner::new("Hello World");
/// # assert_eq!(scanner.next(), Ok((0..1, 'H')));
/// # assert_eq!(scanner.next(), Ok((1..2, 'e')));
/// # assert_eq!(scanner.remaining_text(), "llo World");
/// let old_pos = scanner.reset();
/// // same as
/// let old_pos = scanner.set_cursor_pos(0);
/// # assert_eq!(scanner.remaining_text(), "Hello World");
/// # assert_eq!(scanner.next(), Ok((0..1, 'H')));
/// ```
#[inline]
pub fn reset(&mut self) -> usize {
self.set_cursor_pos(0)
}
/// Advances the scanner cursor and returns the next
/// [`char`] and its [`Range`], if any.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello");
///
/// assert_eq!(scanner.next(), Ok((0..1, 'H')));
/// assert_eq!(scanner.next(), Ok((1..2, 'e')));
///
/// assert_eq!(scanner.remaining_text(), "llo");
///
/// assert_eq!(scanner.next(), Ok((2..3, 'l')));
/// assert_eq!(scanner.next(), Ok((3..4, 'l')));
/// assert_eq!(scanner.next(), Ok((4..5, 'o')));
/// assert_eq!(scanner.next(), Err((5..5, "")));
///
/// assert_eq!(scanner.remaining_text(), "");
/// ```
#[inline]
pub fn next(&mut self) -> ScannerResult<'text, char> {
let (r, c) = self.peek()?;
self.cursor = r.end;
Ok((r, c))
}
/// Returns the next [`char`] and its [`Range`], if any,
/// without advancing the cursor position.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello World");
///
/// assert_eq!(scanner.peek(), Ok((0..1, 'H')));
/// assert_eq!(scanner.peek(), Ok((0..1, 'H')));
///
/// assert_eq!(scanner.next(), Ok((0..1, 'H')));
///
/// assert_eq!(scanner.peek(), Ok((1..2, 'e')));
/// assert_eq!(scanner.peek(), Ok((1..2, 'e')));
///
/// assert_eq!(scanner.remaining_text(), "ello World");
/// ```
#[inline]
pub fn peek(&self) -> ScannerResult<'text, char> {
match self.peek_iter().next() {
Some((r, c)) => Ok((r, c)),
// No character remaining
None => Err((self.cursor..self.cursor, "")),
}
}
/// Returns the `n`th [`char`] and its [`Range`], if any,
/// without advancing the cursor position.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello World");
///
/// assert_eq!(scanner.peek_nth(0), Ok((0..1, 'H')));
/// assert_eq!(scanner.peek_nth(1), Ok((1..2, 'e')));
/// assert_eq!(scanner.peek_nth(2), Ok((2..3, 'l')));
///
/// assert_eq!(scanner.peek_nth(6), Ok((6..7, 'W')));
///
/// assert_eq!(scanner.next(), Ok((0..1, 'H')));
///
/// assert_eq!(scanner.remaining_text(), "ello World");
/// ```
#[inline]
pub fn peek_nth(&self, n: usize) -> ScannerResult<'text, char> {
match self.peek_iter().nth(n) {
Some((r, c)) => Ok((r, c)),
None => Err(self.ranged_text(self.cursor..self.text.len())),
}
}
/// Returns an iterator that produces all the remaining [`char`]s
/// and their [`Range`]s, if any, without advancing the cursor position.
///
/// **Note:** This has the same lifetime as the original `text`,
/// so the scanner can continue to be used while this exists.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello World");
///
/// assert_eq!(scanner.next(), Ok((0..1, 'H')));
/// assert_eq!(scanner.remaining_text(), "ello World");
///
/// let mut peek = scanner.peek_iter();
/// assert_eq!(peek.next(), Some((1..2, 'e')));
/// assert_eq!(peek.next(), Some((2..3, 'l')));
/// assert_eq!(peek.next(), Some((3..4, 'l')));
/// assert_eq!(scanner.remaining_text(), "ello World");
///
/// assert_eq!(scanner.next(), Ok((1..2, 'e')));
/// assert_eq!(scanner.next(), Ok((2..3, 'l')));
/// assert_eq!(scanner.remaining_text(), "lo World");
/// ```
#[inline]
pub fn peek_iter(&self) -> CharRangesOffset<'text> {
self.remaining_text().char_ranges().offset(self.cursor)
}
/// Advances the scanner cursor and returns the next
/// [`char`] and its [`Range`], if `f(c)` returns `true`
/// where `c` is the next character.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello World");
///
/// assert_eq!(scanner.accept_if(char::is_alphabetic), Ok((0..1, 'H')));
/// assert_eq!(scanner.accept_if(char::is_alphabetic), Ok((1..2, 'e')));
/// assert_eq!(scanner.accept_if(char::is_alphabetic), Ok((2..3, 'l')));
/// assert_eq!(scanner.accept_if(char::is_alphabetic), Ok((3..4, 'l')));
/// assert_eq!(scanner.accept_if(char::is_alphabetic), Ok((4..5, 'o')));
/// assert_eq!(scanner.accept_if(char::is_alphabetic), Err((5..5, "")));
///
/// assert_eq!(scanner.remaining_text(), " World");
/// ```
#[inline]
pub fn accept_if<F>(&mut self, f: F) -> ScannerResult<'text, char>
where
F: FnOnce(char) -> bool,
{
let (r, c) = self.peek()?;
if f(c) {
self.cursor = r.end;
Ok((r, c))
} else {
Err((self.cursor..self.cursor, ""))
}
}
#[allow(dead_code)]
#[inline]
pub(crate) fn accept_if_ext<A, Args>(&mut self, accept: A) -> ScannerResult<'text, char>
where
A: ScanOne<Args>,
{
self.accept_if(|c| accept.scan_one(c))
}
/// Advances the scanner cursor and returns the next
/// [`char`] and its [`Range`], if the next character
/// matches `expected`.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello World");
///
/// assert_eq!(scanner.accept_char('H'), Ok((0..1, 'H')));
/// assert_eq!(scanner.accept_char('E'), Err((1..1, "")));
/// assert_eq!(scanner.accept_char('e'), Ok((1..2, 'e')));
/// assert_eq!(scanner.accept_char('W'), Err((2..2, "")));
///
/// assert_eq!(scanner.remaining_text(), "llo World");
/// ```
#[inline]
pub fn accept_char(&mut self, expected: char) -> ScannerResult<'text, char> {
self.accept_if(|c| c == expected)
}
/// Advances the scanner cursor and returns the next
/// [`char`] and its [`Range`], if the next character
/// matches any `char` produced by `expected`.
///
/// # Panics
///
/// Panics in non-optimized builds, if `expected` is [empty].
///
/// In optimized builds <code>Err(([cursor]..[cursor], ""))</code>
/// is returned instead, regardless of whether there is any remaining
/// characters.
///
/// In short there is a <code>[debug_assert!]\(!expected.is_empty())</code>.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello World");
///
/// let any = &['H', 'e', 'l', 'o', ' '];
/// assert_eq!(scanner.accept_char_any(any), Ok((0..1, 'H')));
/// assert_eq!(scanner.accept_char_any(any), Ok((1..2, 'e')));
/// assert_eq!(scanner.accept_char_any(any), Ok((2..3, 'l')));
/// assert_eq!(scanner.accept_char_any(any), Ok((3..4, 'l')));
/// assert_eq!(scanner.accept_char_any(any), Ok((4..5, 'o')));
/// assert_eq!(scanner.accept_char_any(any), Ok((5..6, ' ')));
/// assert_eq!(scanner.accept_char_any(any), Err((6..6, "")));
///
/// assert_eq!(scanner.remaining_text(), "World");
/// ```
///
/// [cursor]: Self::cursor_pos
/// [empty]: https://doc.rust-lang.org/std/primitive.slice.html#method.is_empty
pub fn accept_char_any(&mut self, expected: &[char]) -> ScannerResult<'text, char> {
debug_assert!(!expected.is_empty(), "`expected` is empty");
let (r, c) = self.peek()?;
if expected.contains(&c) {
self.cursor = r.end;
Ok((r, c))
} else {
Err((self.cursor..self.cursor, ""))
}
}
/// Advances the scanner cursor and returns `Ok` with the `&'text str`
/// and its [`Range`], if the next characters matches the characters
/// in `expected`. If not, then an `Err` is returned, with the longest
/// matching substring and its [`Range`].
///
/// **Note:** The returned string slice has the same lifetime as
/// the original `text`, so the scanner can continue to be used
/// while this exists.
///
/// If `expected` is only 1 character, then use [`accept_char()`]
/// instead.
///
/// # Panics
///
/// Panics in non-optimized builds, if `expected` is [empty].
///
/// In optimized builds <code>Err(([cursor]..[cursor], ""))</code>
/// is returned instead, regardless of whether there is any remaining
/// characters.
///
/// In short there is a <code>[debug_assert!]\(!expected.is_empty())</code>.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("FooBaaar");
///
/// // The next 3 characters matches "Foo", so `Ok` is returned
/// assert_eq!(scanner.accept_str("Foo"), Ok((0..3, "Foo")));
///
/// // The next 3 characters is "Baa" not "Bar", so `Err` is
/// // returned, with the longest matching part, i.e. "Ba"
/// assert_eq!(scanner.accept_str("Bar"), Err((3..5, "Ba")));
///
/// assert_eq!(scanner.remaining_text(), "Baaar");
/// ```
///
/// [`accept_char()`]: Self::accept_char
/// [cursor]: Self::cursor_pos
/// [empty]: https://doc.rust-lang.org/std/primitive.str.html#method.is_empty
pub fn accept_str(&mut self, expected: &str) -> ScannerResult<'text, &'text str> {
debug_assert!(!expected.is_empty(), "`expected` is empty");
if expected.is_empty() {
return Err((self.cursor..self.cursor, ""));
}
let start = self.cursor;
let mut chars = self.peek_iter();
for expected in expected.chars() {
match chars.next() {
Some((r, c)) if c == expected => {
self.cursor = r.end;
}
_ => {
let end = self.cursor;
self.cursor = start;
return Err(self.ranged_text(start..end));
}
}
}
Ok(self.ranged_text(start..self.cursor))
}
/// Advances the scanner cursor and returns `Ok` with the `&'text str`
/// and its [`Range`], if the next characters matches any `&str`
/// in `expected`. If not, then an `Err` is returned, with the longest
/// matching substring and its [`Range`].
///
/// **Warning:** The strings are tested in sequential order, thereby
/// if `accept_str_any()` is called with e.g. `["foo", "foobar"]`,
/// then `"foobar"` would never be tested, as `"foo"` would be
/// matched and return `Ok` beforehand. Instead simply change the
/// order of the strings into longest-to-shortest order,
/// i.e. `["foo", "foobar"]` into `["foobar", "foo"]`.
///
/// **Note:** The returned string slice has the same lifetime as
/// the original `text`, so the scanner can continue to be used
/// while this exists.
///
/// If `expected` only contains 1 character strings, then use
/// [`accept_char_any()`] instead.
///
/// # Panics
///
/// Panics in non-optimized builds, if `expected` is [empty],
/// or if `expected` contains an [empty][empty2] `&str`.
///
/// In optimized builds <code>Err(([cursor]..[cursor], ""))</code>
/// is returned instead, regardless of whether there is any remaining
/// characters.
///
/// In short there is a <code>[debug_assert!]\(!expected.is_empty())</code>
/// (along with a similar assertion for the strings).
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("FooBarFooBaaar");
///
/// let any = &["Foo", "Bar"];
///
/// // The next 3 characters matches "Foo", so `Ok` is returned
/// assert_eq!(scanner.accept_str_any(any), Ok((0..3, "Foo")));
/// assert_eq!(scanner.accept_str_any(any), Ok((3..6, "Bar")));
/// assert_eq!(scanner.accept_str_any(any), Ok((6..9, "Foo")));
///
/// // The next 3 characters is "Baa" not "Foo" nor "Bar", so `Err`
/// // is returned, with the longest matching part, i.e. "Ba"
/// assert_eq!(scanner.accept_str_any(any), Err((9..11, "Ba")));
///
/// assert_eq!(scanner.remaining_text(), "Baaar");
/// ```
///
/// [`accept_char_any()`]: Self::accept_char_any
/// [cursor]: Self::cursor_pos
/// [empty]: https://doc.rust-lang.org/std/primitive.slice.html#method.is_empty
/// [empty2]: https://doc.rust-lang.org/std/primitive.str.html#method.is_empty
pub fn accept_str_any(&mut self, expected: &[&str]) -> ScannerResult<'text, &'text str> {
debug_assert!(!expected.is_empty(), "`expected` is empty");
if expected.is_empty() {
return Err((self.cursor..self.cursor, ""));
}
let mut max_end = self.cursor;
for expected in expected {
match self.accept_str(expected) {
Ok((r, s)) => return Ok((r, s)),
Err((r, _s)) => {
max_end = max_end.max(r.end);
}
}
}
let r = self.cursor..max_end;
Err(self.ranged_text(r))
}
/// Advances the scanner cursor and skips zero-to-many characters,
/// **while** `f(c)` returns `true`, where `c` is the [remaining characters]
/// in sequential order.
///
/// Returns the string slice and its [`Range`], of the matched
/// (i.e. skipped) characters.
///
/// Returns <code>([cursor]..[cursor], "")</code> if 0 characters
/// were matched (i.e. skipped).
///
/// **Note:** The returned string slice has the same lifetime as
/// the original `text`, so the scanner can continue to be used
/// while this exists.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello World");
///
/// // Skip all alphabetic characters
/// assert_eq!(scanner.skip_while(|c| c.is_alphabetic()), (0..5, "Hello"));
///
/// // Returns an empty range and an empty string slice
/// // since 0 characters were skipped
/// assert_eq!(scanner.skip_while(|c| c.is_alphabetic()), (5..5, ""));
///
/// // Skip 1 whitespace character
/// assert_eq!(scanner.skip_while(char::is_whitespace), (5..6, " "));
///
/// assert_eq!(scanner.remaining_text(), "World");
/// ```
///
/// [remaining characters]: Self::remaining_text
/// [cursor]: Self::cursor_pos
pub fn skip_while<F>(&mut self, mut f: F) -> ScannerItem<&'text str>
where
F: FnMut(char) -> bool,
{
let start = self.cursor;
for (r, c) in self.peek_iter() {
if f(c) {
self.cursor = r.end;
} else {
break;
}
}
let r = start..self.cursor;
self.ranged_text(r)
}
#[allow(dead_code)]
#[inline]
pub(crate) fn skip_while_ext<A, Args>(&mut self, mut skip: A) -> ScannerItem<&'text str>
where
A: ScanMany<Args>,
{
self.skip_while(|c| skip.scan_many(c))
}
/// Skips zero-to-many characters matching `expected`, same as:
///
/// ```rust
/// # use text_scanner::Scanner;
/// # let mut scanner = Scanner::new("Hello World");
/// # let expected = 'H';
/// scanner.skip_while(|c| c == expected);
/// # assert_eq!(scanner.remaining_text(), "ello World");
/// ```
#[inline]
pub fn skip_while_char(&mut self, expected: char) -> ScannerItem<&'text str> {
self.skip_while(|c| c == expected)
}
/// Skips zero-to-many characters, which match any
/// character in `expected`, same as:
///
/// ```rust
/// # use text_scanner::Scanner;
/// # let mut scanner = Scanner::new("Hello World");
/// # let expected = ['H', 'e', 'L'];
/// scanner.skip_while(|c| expected.contains(&c));
/// # assert_eq!(scanner.remaining_text(), "llo World");
/// ```
#[inline]
pub fn skip_while_char_any(&mut self, expected: &[char]) -> ScannerItem<&'text str> {
self.skip_while(|c| expected.contains(&c))
}
/// Skips zero-to-many characters, while the next characters
/// matches the characters in `expected` completely.
///
/// **Note:** The returned string slice has the same lifetime as
/// the original `text`, so the scanner can continue to be used
/// while this exists.
///
/// If `expected` is only 1 character, then use [`skip_while_char()`]
/// instead.
///
/// # Panics
///
/// Panics in non-optimized builds, if `expected` is [empty].
///
/// In optimized builds 0 characters are skipped, and
/// <code>([cursor]..[cursor], "")</code> is returned instead,
/// regardless of whether there is any remaining characters.
///
/// In short there is a <code>[debug_assert!]\(!expected.is_empty())</code>.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("FooFooFooBarBaz");
/// assert_eq!(scanner.skip_while_str("Foo"), (0..9, "FooFooFoo"));
/// assert_eq!(scanner.remaining_text(), "BarBaz");
/// ```
///
/// [`skip_while_char()`]: Self::skip_while_char
/// [cursor]: Self::cursor_pos
/// [empty]: https://doc.rust-lang.org/std/primitive.str.html#method.is_empty
#[inline]
pub fn skip_while_str(&mut self, expected: &str) -> ScannerItem<&'text str> {
let start = self.cursor;
while self.accept_str(expected).is_ok() {}
self.ranged_text(start..self.cursor)
}
/// Skips zero-to-many characters, while the next characters
/// matches the characters of any `&str` in `expected` completely.
///
/// **Warning:** The strings are tested in sequential order, thereby
/// if `skip_while_str_any()` is called with e.g. `["foo", "foobar"]`,
/// then `"foobar"` would never be tested, as `"foo"` would be
/// matched and continue beforehand. Instead simply change the
/// order of the strings into longest-to-shortest order,
/// i.e. `["foo", "foobar"]` into `["foobar", "foo"]`.
///
/// **Note:** The returned string slice has the same lifetime as
/// the original `text`, so the scanner can continue to be used
/// while this exists.
///
/// If `expected` only contains 1 character strings, then use
/// [`skip_while_char_any()`] instead.
///
/// # Panics
///
/// Panics in non-optimized builds, if `expected` is [empty],
/// or if `expected` contains an [empty][empty2] `&str`.
///
/// In optimized builds 0 characters are skipped, and
/// <code>([cursor]..[cursor], "")</code> is returned instead,
/// regardless of whether there is any remaining characters.
///
/// In short there is a <code>[debug_assert!]\(!expected.is_empty())</code>
/// (along with a similar assertion for the strings).
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("FooBarFooBarFooBaaarBaz");
/// assert_eq!(scanner.skip_while_str_any(&["Foo", "Bar"]), (0..15, "FooBarFooBarFoo"));
/// assert_eq!(scanner.remaining_text(), "BaaarBaz");
/// ```
///
/// [`skip_while_char_any()`]: Self::skip_while_char_any
/// [cursor]: Self::cursor_pos
/// [empty]: https://doc.rust-lang.org/std/primitive.slice.html#method.is_empty
/// [empty2]: https://doc.rust-lang.org/std/primitive.str.html#method.is_empty
#[inline]
pub fn skip_while_str_any(&mut self, expected: &[&str]) -> ScannerItem<&'text str> {
let start = self.cursor;
while self.accept_str_any(expected).is_ok() {}
self.ranged_text(start..self.cursor)
}
/// Advances the scanner cursor and skips zero-to-many characters,
/// **while** `f(c)` returns `false`, where `c` is the [remaining characters]
/// in sequential order.
///
/// Returns the string slice and its [`Range`], of the matched
/// (i.e. skipped) characters.
///
/// Returns <code>([cursor]..[cursor], "")</code> if 0 characters
/// were matched (i.e. skipped).
///
/// **Note:** The returned string slice has the same lifetime as
/// the original `text`, so the scanner can continue to be used
/// while this exists.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("Hello World");
///
/// // Skip all characters until a whitespace is found
/// assert_eq!(scanner.skip_until(|c| c.is_whitespace()), (0..5, "Hello"));
///
/// // Returns an empty range and an empty string slice
/// // since 0 characters were skipped
/// assert_eq!(scanner.skip_until(|c| c.is_whitespace()), (5..5, ""));
///
/// // Skip 1 whitespace character
/// assert_eq!(scanner.skip_until(char::is_alphabetic), (5..6, " "));
///
/// assert_eq!(scanner.remaining_text(), "World");
/// ```
///
/// [remaining characters]: Self::remaining_text
/// [cursor]: Self::cursor_pos
#[inline]
pub fn skip_until<F>(&mut self, mut f: F) -> ScannerItem<&'text str>
where
F: FnMut(char) -> bool,
{
self.skip_while(|c| !f(c))
}
#[allow(dead_code)]
#[inline]
pub(crate) fn skip_until_ext<A, Args>(&mut self, mut skip: A) -> ScannerItem<&'text str>
where
A: ScanMany<Args>,
{
self.skip_until(|c| skip.scan_many(c))
}
/// Skips zero-to-many characters, until the next character
/// matches `expected`, same as:
///
/// ```rust
/// # use text_scanner::Scanner;
/// # let mut scanner = Scanner::new("Hello World");
/// # let expected = ' ';
/// scanner.skip_until(|c| c == expected);
/// # assert_eq!(scanner.remaining_text(), " World");
/// ```
#[inline]
pub fn skip_until_char(&mut self, expected: char) -> ScannerItem<&'text str> {
self.skip_until(|c| c == expected)
}
/// Skips zero-to-many characters, until the next character
/// match any in `expected`, same as:
///
/// ```rust
/// # use text_scanner::Scanner;
/// # let mut scanner = Scanner::new("Hello World");
/// # let expected = [' ', 'o'];
/// scanner.skip_until(|c| expected.contains(&c));
/// # assert_eq!(scanner.remaining_text(), "o World");
/// ```
#[inline]
pub fn skip_until_char_any(&mut self, expected: &[char]) -> ScannerItem<&'text str> {
self.skip_until(|c| expected.contains(&c))
}
/// Skips zero-to-many characters, until the next characters
/// matches the characters in `expected` completely.
///
/// **Note:** The returned string slice has the same lifetime as
/// the original `text`, so the scanner can continue to be used
/// while this exists.
///
/// If `expected` is only 1 character, then use [`skip_until_char()`]
/// instead.
///
/// # Panics
///
/// Panics in non-optimized builds, if `expected` is [empty].
///
/// In optimized builds 0 characters are skipped, and
/// <code>([cursor]..[cursor], "")</code> is returned instead,
/// regardless of whether there is any remaining characters.
///
/// In short there is a <code>[debug_assert!]\(!expected.is_empty())</code>.
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("FooFooFooBarBaz");
/// assert_eq!(scanner.skip_until_str("Bar"), (0..9, "FooFooFoo"));
/// assert_eq!(scanner.remaining_text(), "BarBaz");
/// ```
///
/// [`skip_until_char()`]: Self::skip_until_char
/// [cursor]: Self::cursor_pos
/// [empty]: https://doc.rust-lang.org/std/primitive.str.html#method.is_empty
pub fn skip_until_str(&mut self, expected: &str) -> ScannerItem<&'text str> {
let remaining_text = self.remaining_text();
let end = remaining_text
.find(expected)
.unwrap_or(remaining_text.len());
let start = self.cursor;
self.cursor = end;
self.ranged_text(start..end)
}
/// Skips zero-to-many characters, until the next characters
/// matches the characters of any `&str` in `expected` completely.
///
/// **Warning:** The strings are tested in sequential order, thereby
/// if `skip_until_str_any()` is called with e.g. `["foo", "foobar"]`,
/// then `"foobar"` would never be tested, as `"foo"` would be
/// matched and continue beforehand. Instead simply change the
/// order of the strings into longest-to-shortest order,
/// i.e. `["foo", "foobar"]` into `["foobar", "foo"]`.
///
/// **Note:** The returned string slice has the same lifetime as
/// the original `text`, so the scanner can continue to be used
/// while this exists.
///
/// If `expected` only contains 1 character strings, then use
/// [`skip_until_char_any()`] instead.
///
/// # Panics
///
/// Panics in non-optimized builds, if `expected` is [empty],
/// or if `expected` contains an [empty][empty2] `&str`.
///
/// In optimized builds 0 characters are skipped, and
/// <code>([cursor]..[cursor], "")</code> is returned instead,
/// regardless of whether there is any remaining characters.
///
/// In short there is a <code>[debug_assert!]\(!expected.is_empty())</code>
/// (along with a similar assertion for the strings).
///
/// # Example
///
/// ```rust
/// # use text_scanner::Scanner;
/// let mut scanner = Scanner::new("FooBarFooBarFooBaaarBaz");
/// assert_eq!(scanner.skip_until_str_any(&["Baaar", "Baz"]), (0..15, "FooBarFooBarFoo"));
/// assert_eq!(scanner.remaining_text(), "BaaarBaz");
/// ```
///
/// [`skip_until_char_any()`]: Self::skip_until_char_any
/// [cursor]: Self::cursor_pos
/// [empty]: https://doc.rust-lang.org/std/primitive.slice.html#method.is_empty
/// [empty2]: https://doc.rust-lang.org/std/primitive.str.html#method.is_empty
pub fn skip_until_str_any(&mut self, expected: &[&str]) -> ScannerItem<&'text str> {
let start = self.cursor;
while self.has_remaining_text() {
if let Ok((r, _)) = self.accept_str_any(expected) {
self.cursor = r.start;
break;
}
_ = self.next();
}
self.ranged_text(start..self.cursor)
}
/// Skips zero-to-many characters, while the next character
/// is a [whitespace], same as:
///
/// ```rust
/// # use text_scanner::Scanner;
/// # let mut scanner = Scanner::new(" Hello World");
/// scanner.skip_while(char::is_whitespace);
/// # assert_eq!(scanner.remaining_text(), "Hello World");
/// ```
///
/// [whitespace]: https://doc.rust-lang.org/std/primitive.char.html#method.is_whitespace
#[inline]
pub fn skip_whitespace(&mut self) -> ScannerItem<&'text str> {
self.skip_while(char::is_whitespace)
}
/// Advances the cursor if `f()` returns `Ok`, otherwise on `Err` the
/// cursor position is backtracked to before `f()` was called.
///
/// Utility for scanning [tokens], where an unexpected character during
/// scanning, should restore the cursor position before the the scan
/// was started.
///
/// Additionally, returns `Err` if `f()` returns `Ok`, without advancing
/// the cursor position.
///
/// # Example
///
/// ```rust
/// # use text_scanner::{Scanner, ScannerItem};
/// fn scan_word<'text>(scanner: &mut Scanner<'text>) -> Result<(), ScannerItem<&'text str>> {
/// // Get next char if alphabetic or return err
/// let (first, _c) = scanner.accept_if(char::is_alphabetic)?;
/// // Skip zero-to-many alphabetic characters
/// let (last, _s) = scanner.skip_while(char::is_alphabetic);
/// Ok(())
/// }
///
/// let text = "Hello World";
/// let mut scanner = Scanner::new(text);
///
/// assert_eq!(scanner.scan_with(scan_word), Ok((0..5, "Hello")));
/// assert_eq!(scanner.scan_with(scan_word), Err((5..5, "")));
/// assert_eq!(scanner.next(), Ok((5..6, ' ')));
/// assert_eq!(scanner.scan_with(scan_word), Ok((6..11, "World")));
/// # assert_eq!(scanner.remaining_text(), "");
/// ```
///
/// [tokens]: https://en.wikipedia.org/wiki/Lexical_analysis#Token
#[inline]
pub fn scan_with<F>(&mut self, f: F) -> ScannerResult<'text, &'text str>
where
F: FnOnce(&mut Self) -> ScanResult<'text>,
{
let start = self.cursor;
let mut scanner = self.clone();
match f(&mut scanner) {
Ok(()) => {
self.cursor = scanner.cursor;
if self.cursor == start {
return Err((start..start, ""));
}
let r = start..self.cursor;
Ok(self.ranged_text(r))
}
Err((last, _last_s)) => {
let r = self.cursor..last.end;
Err(self.ranged_text(r))
}
}
}
/// Calls `f` with a <code>&mut [Scanner]</code> of this
/// <code>&[Scanner]</code>, i.e. a [`Scanner`] with the
/// same [`text()`], [`remaining_text()`], and [`cursor_pos()`].
///
/// [`text()`]: Self::text
/// [`remaining_text()`]: Self::remaining_text
/// [`cursor_pos()`]: Self::cursor_pos
pub fn peeking<T, F>(&self, f: F) -> T
where
F: FnOnce(&mut Self) -> T,
{
let mut scanner = self.clone();
f(&mut scanner)
}
}
// Currently not publicly exported, as using e.g. `accept_if()` with a
// closure would require specifying types more often than desired.
pub(crate) trait ScanOne<Args> {
fn scan_one(self, next: char) -> bool;
}
impl<F> ScanOne<char> for F
where
F: FnOnce(char) -> bool,
{
#[inline]
fn scan_one(self, next: char) -> bool {
self(next)
}
}
impl<F> ScanOne<&char> for F
where
F: FnOnce(&char) -> bool,
{
#[inline]
fn scan_one(self, next: char) -> bool {
self(&next)
}
}
// Currently not publicly exported, as using e.g. `skip_while()` with a
// closure would require specifying types more often than desired.
pub(crate) trait ScanMany<Args>: ScanOne<Args> {
fn scan_many(&mut self, next: char) -> bool;
}
impl<F> ScanMany<char> for F
where
F: FnMut(char) -> bool,
{
#[inline]
fn scan_many(&mut self, next: char) -> bool {
self(next)
}
}
impl<F> ScanMany<&char> for F
where
F: FnMut(&char) -> bool,
{
#[inline]
fn scan_many(&mut self, next: char) -> bool {
self(&next)
}
}
pub(crate) trait CharExt {
// `std::char::is_ascii_octdigit` is unstable
fn is_ascii_octdigit(self) -> bool;
fn is_ascii_bindigit(self) -> bool;
}
impl CharExt for char {
#[inline]
fn is_ascii_octdigit(self) -> bool {
matches!(self, '0'..='7')
}
#[inline]
fn is_ascii_bindigit(self) -> bool {
matches!(self, '0' | '1')
}
}
// If you are looking for tests, then the majority
// are implemented in the form of doc tests
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_accept_str_any_order() {
let mut scanner = Scanner::new("FooBarBaz");
#[rustfmt::skip]
assert_eq!(scanner.accept_str_any(&["Foo", "FooBar"]), Ok((0..3, "Foo")));
assert_eq!(scanner.remaining_text(), "BarBaz");
scanner.reset();
#[rustfmt::skip]
assert_eq!(scanner.accept_str_any(&["FooBar", "Foo"]), Ok((0..6, "FooBar")));
assert_eq!(scanner.remaining_text(), "Baz");
}
}