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
extern crate regex;
mod utils;
use std::str::FromStr;
use regex::*;
use utils::*;
/// Core regular expression match methods
pub trait PatternMatch {
/// Apply a regular expression match on the current string
/// If the regex doesn't compile it will return an error
fn pattern_match_result(&self, pattern: &str, case_insensitive: bool) -> Result<bool, Error>;
/// Apply a regular expression match on the current string with a boolean case_insensitive flag
/// NB: If the regex doesn't compile it will return false
fn pattern_match(&self, pattern: &str, case_insensitive: bool) -> bool;
/// Apply a regular expression match on the current string in case-insensitive mode
/// NB: If the regex doesn't compile it will return false
fn pattern_match_ci(&self, pattern: &str) -> bool;
/// Apply a regular expression match on the current string in case-sensitive mode
/// NB: If the regex doesn't compile it will return false
fn pattern_match_cs(&self, pattern: &str) -> bool;
}
/// Core regular expression replacement methods
pub trait PatternReplace {
/// Apply a regular expression match on the current string with a boolean case_insensitive flag
/// NB: If the regex doesn't compile it will return an Error, otherwise in Ok result.
fn pattern_replace(&self, pattern: &str, replacement: &str, case_insensitive: bool) -> Self where Self:Sized;
/// Replace all matches of the pattern within a longer text with a boolean case_insensitive flag
/// If the regex fails, nothing will be replaced
fn pattern_replace_result(&self, pattern: &str, replacement: &str,case_insensitive: bool) -> Result<Self, Error> where Self:Sized;
/// Replace all matches of the pattern within a longer text in case-insensitive mode
/// If the regex fails, nothing will be replaced
fn pattern_replace_ci(&self, pattern: &str, replacement: &str) -> Self where Self:Sized;
/// Replace all matches of the pattern within a longer text in case-sensitive mode
/// If the regex fails, nothing will be replaced
fn pattern_replace_cs(&self, pattern: &str, replacement: &str) -> Self where Self:Sized;
}
/// Set of methods to strip unwanted characters by type or extract vectors of numeric strings, integers or floats
pub trait StripCharacters {
/// Removes all characters that any are not letters or digits, such as punctuation or symobols
/// Letters include those used in most non-Latin alphabets
fn strip_non_alphanum(&self) -> Self where Self:Sized;
// Remove all characters except digits, including punctuation such as decmimal points
fn strip_non_digits(&self) -> Self where Self:Sized;
/// Extracts valid numeric string components from a longer string
fn to_numeric_strings(&self) -> Vec<String>;
/// Always interpret numeric strings with dots as thousand separators and commas as decimal separators
fn to_numeric_strings_euro(&self) -> Vec<String>;
fn to_numeric_strings_conditional(&self, enforce_comma_separator: bool) -> Vec<String>;
/// Extract numeric strings and cast to numbers with conditional logic over commas and dots,
/// The boolean flag enforces European logic where dots separate thousands and commas decimals
/// Otherwise the correct format is deduced. Numeric strings are problematic when they only contain
/// one comma or point. Otherwise the last separator is always considered the decimal separator if
/// it differs from the first separators.
fn to_numbers_conditional<T: FromStr>(&self, enforce_comma_separator: bool) -> Vec<T>;
/// Extracts valid integers or floats from a longer string
fn to_numbers<T: FromStr>(&self) -> Vec<T>;
fn to_numbers_euro<T: FromStr>(&self) -> Vec<T>;
/// Correct number
fn correct_numeric_string(&self, enforce_comma_separator: bool) -> Self;
/// Extracts the first valid integer or float from a longer string if present
fn to_first_number<T: FromStr + Copy>(&self) -> Option<T>;
/// Extracts the first valid integer or float from a longer string
/// if commas are used for decimals and dots for thousand separators
fn to_first_number_euro<T: FromStr + Copy>(&self) -> Option<T>;
/// Removes all characters no used in valid numeric sequences
fn strip_non_numeric(&self) -> Self where Self:Sized;
}
/// Methods to validate strings with character classes
pub trait CharGroupMatch {
/// Does the string contain any digits
fn has_digits(&self) -> bool;
/// Does the string contain any alphanumeric characters including those from non-Latin alphabets
fn has_alphanumeric(&self) -> bool;
/// Does the string contain any letters including those from non-Latin alphabets, but excluding digits
fn has_alphabetic(&self) -> bool;
}
/// Regex-free matcher methods for common use cases
pub trait SimpleMatch {
/// Starts with a case-insensitive alphanumeric sequence
fn starts_with_ci(&self, pattern: &str) -> bool;
/// Starts with a case-insensitive alphanumeric sequence
fn starts_with_ci_alphanum(&self, pattern: &str) -> bool;
/// Ends with a case-insensitive alphanumeric sequence
fn ends_with_ci(&self, pattern: &str) -> bool;
/// Ends with a case-insensitive alphanumeric sequence
fn ends_with_ci_alphanum(&self, pattern: &str) -> bool;
/// Contains a case-insensitive alphanumeric sequence
fn contains_ci(&self, pattern: &str) -> bool;
/// Contains a case-insensitive alphanumeric sequence
fn contains_ci_alphanum(&self, pattern: &str) -> bool;
}
/// Method to check if the string may be parsed to an integer or float
pub trait IsNumeric {
fn is_numeric(&self) -> bool;
}
impl IsNumeric for String {
/// Check if the string may be parsed to a number
fn is_numeric(&self) -> bool {
self.pattern_match(r#"^-?(\d+,)*\d+((\.)\d+)?"#, false)
}
}
/// Methods to split a longer strong on a separator and return a vector of strings,
/// a tuple of two strings or single optional string segment
/// Note some methods may return empty segments in the case of leading, trailing or repeated separators
/// See notes below
pub trait ToSegments {
/// Extract a vector of non-empty strings from a string-like object with a given separator
/// excluding leading, trailing or double separators
fn to_segments(&self, separator: &str) -> Vec<Self> where Self:Sized;
/// Extract a vector of strings from a string-like object with a given separator
fn to_parts(&self, separator: &str) -> Vec<Self> where Self:Sized;
/// Extract only the head before the first occurrence of a separator
fn to_head(&self, separator: &str) -> Self where Self:Sized;
/// Extract only the first segment before the first occurrence of a non-initial separator
fn to_first(&self, separator: &str) -> Self where Self:Sized;
/// Extract only the remainder after the first occurrence of a non-initial separator
fn to_remainder_end(&self, separator: &str) -> Self where Self:Sized;
/// Extract only the last segment after the last occurrence of a non-final separator
fn to_last(&self, separator: &str) -> Self where Self:Sized;
/// Extract only the beginning before the last segment following the last occurrence of a non-final separator
fn to_remainder_start(&self, separator: &str) -> Self where Self:Sized;
/// Extract only the last segment
fn to_end(&self, separator: &str) -> Self where Self:Sized;
/// Extract a string-like segment identified by its index from the components of a string with a given separator
/// e.g. String::from("10/11/2024") .to_segment(1) yields "11"
fn to_segment(&self, separator: &str, index: i32) -> Option<Self> where Self:Sized;
fn to_inner_segment(&self, groups: &[(&str, i32)]) -> Option<Self> where Self:Sized;
/// extract the remainder after the head
fn to_tail(&self, separator: &str) -> Self where Self:Sized;
/// extract the first and last parts after the first occurrence of the separator
fn to_head_tail(&self, separator: &str) -> (Self, Self) where Self:Sized;
/// extract the first and last parts after the last occurrence of the separator
fn to_start_end(&self, separator: &str) -> (Self, Self) where Self:Sized;
}
/// Converts arrays or vectors of strs to a vector of owned strings
pub trait ToStrings {
fn to_strings(&self) -> Vec<String>;
}
impl<T: ToString> ToStrings for Vec<T> {
/// Converts arrays or vectors of strs to a vector of owned strings
fn to_strings(&self) -> Vec<String> {
self.into_iter().map(|s| s.to_string()).collect()
}
}
impl<T: ToString> ToStrings for [T] {
/// Converts arrays or vectors of strs to a vector of owned strings
fn to_strings(&self) -> Vec<String> {
self.into_iter().map(|s| s.to_string()).collect::<Vec<String>>()
}
}
/// Return the indices of all ocurrences of a character
pub trait MatchOccurrences {
/// Return the indices only of all matches of a given string pattern (not a regular expression)
/// Builds on match_indices in the Rust standard library
fn find_matched_indices(&self, pat: &str) -> Vec<usize>;
}
impl MatchOccurrences for String {
/// Return the indices only of all matches of a given regular expression
fn find_matched_indices(&self, pat: &str) -> Vec<usize> {
self.match_indices(pat).into_iter().map(|pair| pair.0).collect::<Vec<usize>>()
}
}
/// Implement regular expression match and replace methods for str and owned String
impl PatternMatch for str {
///
/// Simple regex-compatible match method that will return an optional boolean
/// - Some(true) means the regex is valid and the string matches
/// - Some(false) means the regex is valid and the string does not match
/// - None means the regex is not valid and can this not be evaluated
///
fn pattern_match_result(&self, pattern: &str, case_insensitive: bool) -> Result<bool, Error> {
match build_regex(pattern, case_insensitive) {
Ok(re) => Ok(re.is_match(self)),
Err(error) => Err(error)
}
}
///
/// Simple regex-compatible match method that will return false
/// if the pattern does not match the source string or the regex fails
///
fn pattern_match(&self, pattern: &str, case_insensitive: bool) -> bool {
if let Ok(re) = build_regex(pattern, case_insensitive) {
re.is_match(self)
} else {
false
}
}
///
/// Simple case-insensitive regex-compatible match method that will return false
/// if the pattern does not match the source string or the regex fails
fn pattern_match_ci(&self, pattern: &str) -> bool {
self.pattern_match(pattern, true)
}
///
/// Simple case-sensitive regex-compatible match method that will return false
/// if the pattern does not match the source string or the regex fails
fn pattern_match_cs(&self, pattern: &str) -> bool {
self.pattern_match(pattern, false)
}
}
impl PatternReplace for String {
/// Regex-enabled replace method that will return an OK String result if successful and an error if the regex fails
fn pattern_replace_result(&self, pattern: &str, replacement: &str, case_insensitive: bool) -> Result<String, Error> {
match build_regex(pattern, case_insensitive) {
Ok(re) => Ok(re.replace_all(self, replacement).to_string()),
Err(error) => Err(error)
}
}
/// Simple regex-enabled replace method that will return the same string if the regex fails
fn pattern_replace(&self, pattern: &str, replacement: &str, case_insensitive: bool) -> String {
self.pattern_replace_result(pattern, replacement, case_insensitive).unwrap_or(self.to_owned())
}
/// Simple case-insensitive regex-enabled replace method that will return the same string if the regex fails
fn pattern_replace_ci(&self, pattern: &str, replacement: &str) -> String {
self.pattern_replace(pattern, replacement, true)
}
/// Simple case-sensitive regex-enabled replace method that will return the same string if the regex fails
fn pattern_replace_cs(&self, pattern: &str, replacement: &str) -> String {
self.pattern_replace(pattern, replacement, false)
}
}
impl StripCharacters for String {
/// Remove all characters that are not letters or numerals for later string comparison. Does not use a regular expression
fn strip_non_alphanum(&self) -> String {
self.chars().into_iter().filter(|c| c.is_alphanumeric()).collect::<String>()
}
/// Remove all characters that are not numerals for later string comparison. Does not use a regular expression
fn strip_non_digits(&self) -> String {
self.chars().into_iter().filter(|c| c.is_digit(10)).collect::<String>()
}
/// Correct numeric strings with commas as thousand separators or as decimal separators
/// to a regular format with punctuation only for decimal points before being parsed to an integer or float
fn correct_numeric_string(&self, enforce_comma_separator: bool) -> Self {
let commas = self.find_matched_indices(",");
let last_comma_index = commas.last().unwrap_or(&0).to_owned();
let points = self.find_matched_indices(".");
let last_point_index = points.last().unwrap_or(&0).to_owned();
let num_commas = commas.len();
if points.len() > 1 || (last_comma_index > last_point_index && num_commas <= 1) || (enforce_comma_separator && num_commas <= 1) {
if num_commas < 1 {
self.replace(".", "")
} else {
let (main, dec_part) = self.to_start_end(",");
[main.replace(".", ""), dec_part].join(".")
}
} else {
self.to_owned()
}
}
/// conditionally extract numeric strings from a longer string
fn to_numeric_strings_conditional(&self, enforce_comma_separator: bool) -> Vec<String> {
let mut prev_char = ' ';
let mut seq_num = 0;
let mut num_string = String::new();
let mut output: Vec<String> = Vec::new();
for component in self.chars() {
let mut is_end = false;
if component.is_digit(10) {
num_string.push(component);
seq_num += 1;
} else if prev_char.is_digit(10) {
match component {
'.' | '․' | ',' => {
if component == ',' {
num_string.push(',');
} else {
num_string.push('.');
}
seq_num = 0;
},
_ => {
is_end = true;
}
}
} else {
is_end = true;
}
if is_end {
if seq_num > 0 {
add_sanitized_numeric_string(&mut output, &num_string.correct_numeric_string(enforce_comma_separator));
num_string = String::new();
}
seq_num = 0;
}
prev_char = component;
}
if num_string.len() > 0 {
add_sanitized_numeric_string(&mut output, &num_string.correct_numeric_string(enforce_comma_separator));
}
output
}
fn to_numeric_strings(&self) -> Vec<String> {
self.to_numeric_strings_conditional(false)
}
fn to_numeric_strings_euro(&self) -> Vec<String> {
self.to_numeric_strings_conditional(true)
}
fn to_numbers_conditional<T: FromStr>(&self, enforce_comma_separator: bool) -> Vec<T> {
self.to_numeric_strings_conditional(enforce_comma_separator).into_iter()
.map(|s| s.parse::<T>())
.filter(|s| s.is_ok())
.map(|s| s.ok().unwrap())
.collect::<Vec<T>>()
}
fn to_numbers<T: FromStr>(&self) -> Vec<T> {
self.to_numbers_conditional(false)
}
fn to_numbers_euro<T: FromStr>(&self) -> Vec<T> {
self.to_numbers_conditional(true)
}
fn to_first_number<T: FromStr + Copy>(&self) -> Option<T> {
if let Some(number) = self.to_numbers::<T>().first() {
Some(*number)
} else {
None
}
}
fn to_first_number_euro<T: FromStr + Copy>(&self) -> Option<T> {
if let Some(number) = self.to_numbers_euro::<T>().first() {
Some(*number)
} else {
None
}
}
fn strip_non_numeric(&self) -> String {
self.to_numeric_strings().join(" ")
}
}
impl CharGroupMatch for str {
fn has_digits(&self) -> bool {
self.chars().any(|c| char::is_digit(c, 10))
}
fn has_alphanumeric(&self) -> bool {
self.chars().any(char::is_alphanumeric)
}
fn has_alphabetic(&self) -> bool {
self.chars().any(char::is_alphabetic)
}
}
impl SimpleMatch for str {
/// Starts with a case-insensitive sequence
fn starts_with_ci(&self, pattern: &str) -> bool {
self.to_lowercase().starts_with(&pattern.to_lowercase())
}
/// Starts with a case-insensitive alphanumeric sequence
fn starts_with_ci_alphanum(&self, pattern: &str) -> bool {
self.to_lowercase().strip_non_alphanum().starts_with(&pattern.to_lowercase())
}
/// Ends with a case-insensitive sequence
fn ends_with_ci(&self, pattern: &str) -> bool {
self.to_lowercase().ends_with(&pattern.to_lowercase())
}
/// Ends with a case-insensitive alphanumeric sequence
fn ends_with_ci_alphanum(&self, pattern: &str) -> bool {
self.to_lowercase().strip_non_alphanum().ends_with(&pattern.to_lowercase())
}
/// Contains a case-insensitive sequence
fn contains_ci(&self, pattern: &str) -> bool {
self.to_lowercase().contains(&pattern.to_lowercase())
}
/// Contains a case-insensitive alphanumeric sequence
fn contains_ci_alphanum(&self, pattern: &str) -> bool {
self.to_lowercase().strip_non_alphanum().contains(&pattern.to_lowercase())
}
}
/// Pattern methods for arrays or vectors only, return vectors of booleans matching each input string
pub trait PatternMatches {
/// Returns result with a vector of boolean matches for an array or vector of strings with case-insensitive flag
/// or an error if the regex does not compile
fn pattern_matches_result(&self, pattern: &str, case_insensitive: bool) -> Result<Vec<bool>, Error>;
/// Returns vector of boolean matches for an array or vector of strings with case-insensitive flag
fn pattern_matches(&self, pattern: &str, case_insensitive: bool) -> Vec<bool>;
/// Returns vector of boolean matches for an array or vector of strings in case-insensitive mode
fn pattern_matches_ci(&self, pattern: &str) -> Vec<bool>;
/// Returns vector of boolean matches for an array or vector of strings in case-sensitive mode
fn pattern_matches_cs(&self, pattern: &str) -> Vec<bool>;
}
impl PatternMatch for [String] {
fn pattern_match_result(&self, pattern: &str, case_insensitive: bool) -> Result<bool, Error> {
match build_regex(pattern, case_insensitive) {
Ok(re) => Ok(self.into_iter().any(|segment| re.is_match(segment))),
Err(error) => Err(error)
}
}
/// Simple regex-compatible match method that will return false
/// if the pattern does not match the source string or the regex fails
fn pattern_match(&self, pattern: &str, case_insensitive: bool) -> bool {
self.pattern_match_result(pattern, case_insensitive).unwrap_or(false)
}
/// Case-insensitive regex-compatible match method that will return false
/// if the pattern does not match the source string or the regex fails
fn pattern_match_ci(&self, pattern: &str) -> bool {
self.pattern_match(pattern, true)
}
/// Case-sensitive regex-compatible match method that will return false
/// if the pattern does not match the source string or the regex fails
fn pattern_match_cs(&self, pattern: &str) -> bool {
self.pattern_match(pattern, false)
}
}
impl PatternMatches for [String] {
/// Returns an Ok result with a vector of boolean matches for an array or vector of strings with a case-insensitive flag
/// and an error only if the regex fails to compile.
fn pattern_matches_result(&self, pattern: &str, case_insensitive: bool) -> Result<Vec<bool>, Error> {
match build_regex(pattern, case_insensitive) {
Ok(re) => Ok(self.into_iter().map(|segment| re.is_match(segment)).collect::<Vec<bool>>()),
Err(error) => Err(error)
}
}
/// Returns vector of boolean matches for an array or vector of strings with case-insensitive flag
fn pattern_matches(&self, pattern: &str, case_insensitive: bool) -> Vec<bool> {
match self.pattern_matches_result(pattern, case_insensitive) {
Ok(results) => results,
Err(_error) => self.into_iter().map(|_segment| false).collect::<Vec<bool>>()
}
}
/// Returns vector of boolean matches for an array or vector of strings in case-insensitive mode
fn pattern_matches_ci(&self, pattern: &str) -> Vec<bool> {
self.pattern_matches(pattern, true)
}
/// Returns vector of boolean matches for an array or vector of strings in case-sensitive mode
fn pattern_matches_cs(&self, pattern: &str) -> Vec<bool> {
self.pattern_matches(pattern, false)
}
}
impl PatternReplace for Vec<String> {
///
/// Optional regex-enabledd replace method that will return None if the regex fails
///
fn pattern_replace_result(&self, pattern: &str, replacement: &str, case_insensitive: bool) -> Result<Vec<String>, Error> {
match build_regex(pattern, case_insensitive) {
Ok(re) => {
let replacements = self.into_iter().map(|segment| re.replace_all(segment, replacement).to_string()).collect::<Vec<String>>();
Ok(replacements)
},
Err(error) => Err(error)
}
}
///
/// Simple regex-enabledd replace method that will return the same string if the regex fails
///
fn pattern_replace(&self, pattern: &str, replacement: &str, case_insensitive: bool) -> Vec<String> {
self.pattern_replace_result(pattern, replacement, case_insensitive).unwrap_or(self.to_owned())
}
/// Simple case-insensitive regex-enabled replace method that will return the same string if the regex fails
fn pattern_replace_ci(&self, pattern: &str, replacement: &str) -> Vec<String> {
self.pattern_replace(pattern, replacement, true)
}
/// Simple case-sensitive regex-enabled replace method that will return the same string if the regex fails
fn pattern_replace_cs(&self, pattern: &str, replacement: &str) -> Vec<String> {
self.pattern_replace(pattern, replacement, false)
}
}
/// Provides methods to match with multiple patterns
/// expressed as arrays of tuples or simple strs (for pattern_match_many_ci and pattern_match_many_cs)
pub trait PatternMatchMany {
/// Matches all of the patterns in case-sensitivity flag
/// with an array of tuples (patterns, case_insensitive)
fn pattern_match_many(&self, patterns: &[&str], case_insensitive: bool) -> bool;
/// Matches all of the patterns in case-insensitive mode
/// with an array of str patterns
fn pattern_match_many_ci(&self, patterns: &[&str]) -> bool;
/// Matches all of the patterns in case-sensitive mode
/// with an array of str patterns
fn pattern_match_many_cs(&self, patterns: &[&str]) -> bool;
/// Matches all of the patterns with case-insensitive flag
/// e.g. (r#"a[ck]"#, true) => matches "ac" or "ak" whether upper, lower or mixed case
/// with an array of tuples (pattern, replacement, case_insensitive)
fn pattern_match_many_mixed(&self, pattern_sets: &[(&str, bool)]) -> bool;
/// string matches all conditional patterns which may be positive / negative and case insensitive or not
fn pattern_match_many_conditional(&self, pattern_sets: &[(bool, &str, bool)]) -> bool;
/// Matches one or more of the patterns in case-sensitivity flag
/// with an array of tuples (patterns, case_insensitive)
fn pattern_match_any(&self, patterns: &[&str], case_insensitive: bool) -> bool;
/// Matches one or more of the patterns in case-insensitive mode
/// with an array of str patterns
fn pattern_match_any_ci(&self, patterns: &[&str]) -> bool;
/// Matches one or more of the patterns in case-sensitive mode
/// with an array of str patterns
fn pattern_match_any_cs(&self, patterns: &[&str]) -> bool;
/// Matches one or more of the patterns with case-insensitive boolean flag
fn pattern_match_any_mixed(&self, pattern_sets: &[(&str, bool)]) -> bool;
/// string matches one or more conditional patterns which may be positive / negative and case insensitive or not
fn pattern_match_any_conditional(&self, pattern_sets: &[(bool, &str, bool)]) -> bool;
}
/// Provides methods to replace with multiple patterns
/// expressed as arrays of tuples
pub trait PatternReplaceMany {
/// Replaces multiple sets of patterns with replacements in case-sensitive mode
/// with an array of tuples (pattern, replacement, case_insensitive)
fn pattern_replace_pairs(&self, replacement_sets: &[(&str, &str)]) -> Self where Self: Sized;
/// Replaces multiple sets of patterns with replacements in case-insensitive mode
/// with an array of tuples (pattern, replacement, case_insensitive)
fn pattern_replace_pairs_ci(&self, replacement_sets: &[(&str, &str)]) -> Self where Self: Sized;
/// Replaces multiple sets of patterns with replacements in case-sensitive mode
/// with an array of simple tuples (pattern, replacement)
fn pattern_replace_sets(&self, replacement_sets: &[(&str, &str, bool)]) -> Self where Self: Sized;
}
impl PatternMatchMany for str {
/// Matches all of the patterns in case-sensitivity flag
/// with an array of tuples (patterns, case_insensitive)
fn pattern_match_many(&self, patterns: &[&str], case_insensitive: bool) -> bool {
let mut num_matched = 0usize;
let num_patterns = patterns.len();
for pattern in patterns {
if self.pattern_match(pattern, case_insensitive) {
num_matched += 1;
}
}
num_matched == num_patterns
}
/// Matches all of the patterns in case-insensitive mode
/// with an array of str patterns
fn pattern_match_many_ci(&self, patterns: &[&str]) -> bool {
self.pattern_match_many(patterns, true)
}
/// Matches all of the patterns in case-sensitive mode
/// with an array of str patterns
fn pattern_match_many_cs(&self, patterns: &[&str]) -> bool {
self.pattern_match_many(patterns, false)
}
/// Matches all of the patterns with case-insensitive flag
/// e.g. (r#"a[ck]"#, true) => matches "ac" or "ak" whether upper, lower or mixed case
/// with an array of tuples (pattern, replacement, case_insensitive)
fn pattern_match_many_mixed(&self, pattern_sets: &[(&str, bool)]) -> bool {
let mut num_matched = 0usize;
let num_patterns = pattern_sets.len();
for pair in pattern_sets {
let (pattern, case_insensitive) = *pair;
if self.pattern_match(pattern, case_insensitive) {
num_matched += 1;
}
}
num_matched == num_patterns
}
/// Matches all of the patterns with positivity condition and case-insensitive flag
/// e.g. (false, "a[ck]", true) => does not contain "ac" or "ak" whether upper, lower or mixed case
/// with an array of tuples (positive, pattern, case_insensitive)
fn pattern_match_many_conditional(&self, pattern_sets: &[(bool, &str, bool)]) -> bool {
let mut num_matched = 0usize;
let num_patterns = pattern_sets.len();
for pattern_set in pattern_sets {
let (is_positive, pattern, case_insensitive) = *pattern_set;
let is_matched = self.pattern_match(pattern, case_insensitive);
if is_matched == is_positive {
num_matched += 1;
}
}
num_matched == num_patterns
}
/// Matches one or more of the patterns in case-sensitivity flag
/// with an array of tuples (patterns, case_insensitive)
fn pattern_match_any(&self, patterns: &[&str], case_insensitive: bool) -> bool {
for pattern in patterns {
if self.pattern_match(pattern, case_insensitive) {
return true;
}
}
false
}
/// Matches one or more of the patterns in case-insensitive mode
/// with an array of str patterns
fn pattern_match_any_ci(&self, patterns: &[&str]) -> bool {
self.pattern_match_any(patterns, true)
}
/// Matches one or more of the patterns in case-sensitive mode
/// with an array of str patterns
fn pattern_match_any_cs(&self, patterns: &[&str]) -> bool {
self.pattern_match_any(patterns, false)
}
/// Matches one or more of the patterns with case-insensitive flag
/// e.g. (r#"a[ck]"#, true) => matches "ac" or "ak" whether upper, lower or mixed case
/// with an array of tuples (pattern, replacement, case_insensitive)
fn pattern_match_any_mixed(&self, pattern_sets: &[(&str, bool)]) -> bool {
for pair in pattern_sets {
let (pattern, case_insensitive) = *pair;
if self.pattern_match(pattern, case_insensitive) {
return true;
}
}
false
}
/// Matches one or more of the patterns with positivity condition and case-insensitive flag
fn pattern_match_any_conditional(&self, pattern_sets: &[(bool, &str, bool)]) -> bool {
for pattern_set in pattern_sets {
let (is_positive, pattern, case_insensitive) = *pattern_set;
let is_matched = self.pattern_match(pattern, case_insensitive);
if is_matched == is_positive {
return true;
}
}
false
}
}
impl PatternReplaceMany for String {
/// Replaces multiple sets of patterns with replacements and boolean case sensitivity
/// with an array of tuples (pattern, replacement, case_insensitive)
fn pattern_replace_sets(&self, replacement_sets: &[(&str, &str, bool)]) -> String {
let mut return_string = self.clone();
for replacement_set in replacement_sets {
let (pattern, replacement, case_insensitive) = *replacement_set;
if let Ok(new_string) = return_string.pattern_replace_result(pattern, replacement, case_insensitive) {
return_string = new_string;
}
}
return_string
}
/// Replaces multiple sets of patterns with replacements in case-sensitive mode
/// with an array of simple tuples (pattern, replacement)
fn pattern_replace_pairs(&self, replacement_pairs: &[(&str, &str)]) -> String {
let mut return_string = self.clone();
for replacement_pair in replacement_pairs {
let (pattern, replacement) = *replacement_pair;
if let Ok(new_string) = return_string.pattern_replace_result(pattern, replacement, false) {
return_string = new_string;
}
}
return_string
}
/// Replaces multiple sets of patterns with replacements in case-insensitive mode
/// with an array of simple tuples (pattern, replacement)
fn pattern_replace_pairs_ci(&self, replacement_pairs: &[(&str, &str)]) -> String {
let mut return_string = self.clone();
for replacement_pair in replacement_pairs {
let (pattern, replacement) = *replacement_pair;
if let Ok(new_string) = return_string.pattern_replace_result(pattern, replacement, true) {
return_string = new_string;
}
}
return_string
}
}
/// Implement PatternMatchMany for vectors of strings.
impl PatternMatchMany for [String] {
/// Match all from an array of strs with a boolean case_insensitive parameter
fn pattern_match_many(&self, patterns: &[&str], case_insensitive: bool) -> bool {
let mut num_matched = 0usize;
let num_patterns = patterns.len();
for pattern in patterns {
if self.pattern_match(pattern, case_insensitive) {
num_matched += 1;
}
}
num_matched == num_patterns
}
/// Match all from an array of strs with a in case-insensitive mode
fn pattern_match_many_ci(&self, patterns: &[&str]) -> bool {
self.pattern_match_many(patterns, true)
}
/// Match all from an array of strs with a in case-sensitive mode
fn pattern_match_many_cs(&self, patterns: &[&str]) -> bool {
self.pattern_match_many(patterns, false)
}
/// Match all from an array of tuples of strs and boolean case_insensitive flags
fn pattern_match_many_mixed(&self, pattern_sets: &[(&str, bool)]) -> bool {
let mut num_matched = 0usize;
let num_patterns = pattern_sets.len();
for pair in pattern_sets {
let (pattern, case_insensitive) = *pair;
if self.pattern_match(pattern, case_insensitive) {
num_matched += 1;
}
}
num_matched == num_patterns
}
/// Match all from an array of tuples of boolean positive, strs and boolean case_insensitive flags
/// Will check of each pattern is or is not matched with mixed case-sensitity rules
fn pattern_match_many_conditional(&self, pattern_sets: &[(bool, &str, bool)]) -> bool {
let mut num_matched = 0usize;
let num_patterns = pattern_sets.len();
for pattern_set in pattern_sets {
let (is_positive, pattern, case_insensitive) = *pattern_set;
let is_matched = self.pattern_match(pattern, case_insensitive);
if is_matched == is_positive {
num_matched += 1;
}
}
num_matched == num_patterns
}
/// with an array of tuples (patterns, case_insensitive)
/// Matches one or more of the patterns in case-sensitivity flag
fn pattern_match_any(&self, patterns: &[&str], case_insensitive: bool) -> bool {
for pattern in patterns {
if self.pattern_match(pattern, case_insensitive) {
return true;
}
}
false
}
/// Matches one or more of the patterns in case-insensitive mode
/// with an array of str patterns
fn pattern_match_any_ci(&self, patterns: &[&str]) -> bool {
self.pattern_match_any(patterns, true)
}
/// Matches one or more of the patterns in case-sensitive mode
/// with an array of str patterns
fn pattern_match_any_cs(&self, patterns: &[&str]) -> bool {
self.pattern_match_any(patterns, false)
}
/// Matches one or more of the patterns with case-insensitive flag
/// e.g. (r#"a[ck]"#, true) => matches "ac" or "ak" whether upper, lower or mixed case
/// with an array of tuples (pattepattern_match_many_cirn, replacement, case_insensitive)
fn pattern_match_any_mixed(&self, pattern_sets: &[(&str, bool)]) -> bool {
for pair in pattern_sets {
let (pattern, case_insensitive) = *pair;
if self.pattern_match(pattern, case_insensitive) {
return true;
}
}
false
}
/// Matches one or more of the patterns with positivity condition and case-insensitive flag
fn pattern_match_any_conditional(&self, pattern_sets: &[(bool, &str, bool)]) -> bool {
for pattern_set in pattern_sets {
let (is_positive, pattern, case_insensitive) = *pattern_set;
let is_matched = self.pattern_match(pattern, case_insensitive);
if is_matched == is_positive {
return true;
}
}
false
}
}
/// ReplaceMany implementation for vectors of owned strings
impl PatternReplaceMany for Vec<String> {
/// Replace all matched patterns with mixed case-sensitivity flags, expressed as tuples of (pattern: &str, replacement: &str, case_insensitive: bool)
fn pattern_replace_sets(&self, replacement_sets: &[(&str, &str, bool)]) -> Vec<String> {
let mut return_strings = self.clone();
for replacement_set in replacement_sets {
let (pattern, replacement, case_insensitive) = *replacement_set;
if let Ok(new_strings) = return_strings.pattern_replace_result(pattern, replacement, case_insensitive) {
return_strings = new_strings;
}
}
return_strings
}
/// Replace all matched patterns in case-sensitive mode (unless defined in the pattern via (?i)),
/// expressed as tuples of (pattern: &str, replacement: &str)
fn pattern_replace_pairs(&self, replacement_pairs: &[(&str, &str)]) -> Vec<String> {
let mut return_strings = self.clone();
for replacement_pair in replacement_pairs {
let (pattern, replacement) = *replacement_pair;
if let Ok(new_string) = return_strings.pattern_replace_result(pattern, replacement, false) {
return_strings = new_string;
}
}
return_strings
}
/// Replace all matched patterns in case-insensitive,
/// expressed as tuples of (pattern: &str, replacement: &str)
fn pattern_replace_pairs_ci(&self, replacement_pairs: &[(&str, &str)]) -> Vec<String> {
let mut return_strings = self.clone();
for replacement_pair in replacement_pairs {
let (pattern, replacement) = *replacement_pair;
if let Ok(new_string) = return_strings.pattern_replace_result(pattern, replacement, true) {
return_strings = new_string;
}
}
return_strings
}
}
/// Implement string segment split and capture method for String
impl ToSegments for String {
/// Splits a string on the exact separator, whether initial, final or repeated.
/// May yield empty segments
fn to_parts(&self, separator: &str) -> Vec<String> {
let splitter = self.split(separator);
splitter.into_iter().map(|s| s.to_string()).collect::<Vec<String>>()
}
/// Splits a string on a separator, but only returns an array of non-empty strings
/// skipping leading, trailing or repeated separators that may otherwise yield empty strings
fn to_segments(&self, separator: &str) -> Vec<String> {
let splitter = self.split(separator);
splitter.into_iter().map(|s| s.to_string()).filter(|s| s.len() > 0).collect::<Vec<String>>()
}
fn to_head(&self, separator: &str) -> String {
if let Some((head, _tail)) = self.split_once(separator) {
head.to_string()
} else {
self.to_owned()
}
}
/// Extract only the last segment after the last occurrence of a non-final separator
fn to_last(&self, separator: &str) -> String {
let separator_len = separator.len();
if self.ends_with(separator) && self.len() > separator_len {
let end_index = self.len() - separator_len;
self[0..end_index].to_string().to_end(separator)
} else {
self.to_end(separator)
}
}
/// extract the last segment whether empty or not
fn to_end(&self, separator: &str) -> String {
let parts = self.to_parts(separator);
if parts.len() > 0 {
parts.last().unwrap_or(self).to_owned()
} else {
self.to_owned()
}
}
fn to_tail(&self, separator: &str) -> String {
let parts = self.to_parts(separator);
let num_parts = parts.len();
if num_parts > 0 {
parts[1..num_parts].join(separator)
} else {
self.to_owned()
}
}
/// Extract only the first segment before the first occurrence of a non-initial separator
fn to_first(&self, separator: &str) -> String {
let separator_len = separator.len();
if self.starts_with(separator) && self.len() > separator_len {
self[separator_len..self.len()].to_string().to_head(separator)
} else {
self.to_head(separator)
}
}
/// Extract only the remainder after the first occurrence of a non-initial separator
fn to_remainder_end(&self, separator: &str) -> String {
let separator_len = separator.len();
if self.starts_with(separator) && self.len() > separator_len {
self[separator_len..].to_string().to_tail(separator)
} else {
self.to_tail(separator)
}
}
/// Extract only the beginning before the last segment following the last occurrence of a non-final separator
fn to_remainder_start(&self, separator: &str) -> String {
let separator_len = separator.len();
if self.ends_with(separator) && self.len() > separator_len {
let end_index = self.len() - separator_len;
self[0..end_index].to_string().to_tail(separator)
} else {
self.to_tail(separator)
}
}
/// Extract an indexed segment yielded by splitting a string.
/// A negative index parameter will start from the end
fn to_segment(&self, separator: &str, index: i32) -> Option<String> {
let parts = self.to_segments(separator);
let num_parts = parts.len();
let target_index = if index >= 0 { index as usize } else { (num_parts as i32 + index) as usize };
if target_index < num_parts {
if let Some(segment) = parts.get(target_index) {
Some(segment.to_owned())
} else {
None
}
} else {
None
}
}
/// extract inner segment via a set of tuples with separators and indices.
fn to_inner_segment(&self, groups: &[(&str, i32)]) -> Option<String> {
if groups.len() > 0 {
let mut matched: Option<String> = None;
let mut current_string = self.clone();
for group in groups {
if current_string.len() > 0 {
let (separator, index) = group;
matched = current_string.to_segment(*separator, *index);
current_string = matched.clone().unwrap_or("".to_string());
}
}
matched
} else {
None
}
}
///
/// Extract a tuple of the head and remainder, like split_once but returns Strings
fn to_head_tail(&self, separator: &str) -> (String, String) {
if let Some((head, tail)) = self.split_once(separator) {
(head.to_string(), tail.to_string())
} else {
("".to_owned(), self.to_owned())
}
}
///
/// Extract a tuple of the tail and remainder, like split_once in reverse and returning strings
fn to_start_end(&self, separator: &str) -> (String, String) {
let parts = self.to_parts(separator);
let last_part = "".to_string();
let num_parts = parts.len();
if num_parts > 0 {
let end_index = num_parts - 1;
let start = parts[0..end_index].join(separator);
let end = self.to_end(separator);
(start, end)
} else {
(self.to_owned(), last_part)
}
}
}