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 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235
/*
STAM Library (Stand-off Text Annotation Model)
by Maarten van Gompel <proycon@anaproy.nl>
Digital Infrastucture, KNAW Humanities Cluster
Licensed under the GNU General Public License v3
https://github.com/annotation/stam-rust
*/
//! This module contains the high-level API for finding text. The `FindText` trait embodies this API and is implemented on
//! [`ResultItem<TextResource>`] and [`ResultTextSelection`]. It builds upon the lower-level [`Text`] trait.
use crate::annotationstore::AnnotationStore;
use crate::config::Configurable;
use crate::error::StamError;
use crate::resources::{TextResource, TextResourceHandle};
use crate::selector::Offset;
use crate::store::*;
use crate::text::Text;
use crate::textselection::ResultTextSelection;
use crate::textselection::TextSelection;
use crate::types::*;
use regex::{Regex, RegexSet};
use smallvec::{smallvec, SmallVec};
/// This trait provides text-searching methods that operate on structures that hold or represent text content. It builds upon the lower-level [`Text`] trait.
pub trait FindText<'store, 'slf>: Text<'store, 'slf>
where
'store: 'slf,
{
/// Searches the text using one or more regular expressions, returns an iterator over TextSelections along with the matching expression, this
/// is held by the [`FindRegexMatch`] struct.
///
/// Passing multiple regular expressions at once is more efficient than calling this function anew for each one.
/// If capture groups are used in the regular expression, only those parts will be returned (the rest is context). If none are used,
/// the entire expression is returned.
///
/// The `allow_overlap` parameter determines if the matching expressions are allowed to
/// overlap. It you are doing some form of tokenisation, you also likely want this set to
/// false. All of this only matters if you supply multiple regular expressions.
///
/// Results are returned in the exact order they are found in the text
fn find_text_regex<'regex>(
&'slf self,
expressions: &'regex [Regex],
precompiledset: Option<&RegexSet>,
allow_overlap: bool,
) -> Result<FindRegexIter<'store, 'regex>, StamError>;
/// Searches for the specified text fragment. Returns an iterator to iterate over all matches in the text.
/// The iterator returns encapsulated [`TextSelection`] items as [`ResultTextSelection`].
///
/// For more complex and powerful searching use [`FindText::find_text_regex()`] instead
///
/// If you want to search only a subpart of the text, extract a [`TextSelection`] first with
/// [`FindText::textselection()`] and then run [`FindText::find_text()`] on that instead.
fn find_text<'fragment>(
&'slf self,
fragment: &'fragment str,
) -> FindTextIter<'store, 'fragment>;
/// Searches for the specified text fragment. Returns an iterator to iterate over all matches in the text.
/// The iterator returns [`TextSelection`] items wrapped as [`ResultTextSelection`].
///
/// For more complex and powerful searching use [`FindText::find_text_regex()`] instead
///
/// If you want to search only a subpart of the text, extract a [`TextSelection`] first with
/// [`FindText::textselection()`] and then run [`FindText::find_text()`] on that instead.
fn find_text_nocase(&'slf self, fragment: &str) -> FindNoCaseTextIter<'store>;
/// Searches for the multiple text fragment in sequence. Returns a vector with
/// [`TextSelection`] instances wrapped as [`ResultTextSelection`].
///
/// Matches must appear in the exact order specified, but *may* have other intermittent text,
/// determined by the `allow_skip_char` closure. A recommended closure for natural language
/// text is: `|c| !c.is_alphabetic()`
///
/// The `case_sensitive` parameter determines if the search is case sensitive or not, case insensitive searches have a performance penalty.
fn find_text_sequence<'fragment, F>(
&'slf self,
fragments: &'fragment [&'fragment str],
allow_skip_char: F,
case_sensitive: bool,
) -> Option<Vec<ResultTextSelection<'store>>>
where
F: Fn(char) -> bool,
{
let mut results: Vec<ResultTextSelection<'store>> = Vec::with_capacity(fragments.len());
let mut begin: usize = 0;
let mut textselectionresult = self.textselection(&Offset::whole());
for fragment in fragments {
if let Ok(searchtext) = textselectionresult {
if let Some(m) = if case_sensitive {
searchtext.find_text(fragment).next()
} else {
searchtext.find_text_nocase(fragment).next()
} {
if m.begin() > begin {
//we skipped some text since last match, check the characters in between matches
let skipped_text = self
.textselection(&Offset::simple(begin, m.begin()))
.expect("textselection must succeed")
.text();
for c in skipped_text.chars() {
if !allow_skip_char(c) {
return None;
}
}
}
begin = m.end();
results.push(m);
} else {
return None;
}
//slice (shorten) new text for next test
textselectionresult = searchtext.textselection(&Offset::new(
Cursor::BeginAligned(begin - searchtext.begin()), //offset must be relative
Cursor::EndAligned(0),
));
} else {
return None;
}
}
Some(results)
}
/// Returns an iterator of [`TextSelection`] instances that represent partitions
/// of the text given the specified delimiter. No text is modified.
///
/// The iterator returns [`TextSelection`] items as a fat pointer [`ResultTextSelection`]).
fn split_text<'b>(&'slf self, delimiter: &'b str) -> SplitTextIter<'store, 'b>;
/// Trims all occurrences of any character in `chars` from both the beginning and end of the text,
/// returning a smaller [`TextSelection`] (as a fat pointer [`ResultTextSelection`]). No text is modified.
fn trim_text(&'slf self, chars: &[char]) -> Result<ResultTextSelection<'store>, StamError> {
let mut trimbegin = 0;
let mut trimend = 0;
for c in self.text().chars() {
if chars.contains(&c) {
trimbegin += 1;
} else {
break;
}
}
for c in self.text().chars().rev() {
if chars.contains(&c) {
trimend -= 1;
} else {
break;
}
}
self.textselection(&Offset::new(
Cursor::BeginAligned(trimbegin),
Cursor::EndAligned(trimend),
))
}
/// Trims all occurrences of any character `chars` that pass the supplied function, from both the beginning and end of the text,
/// returning a smaller [`TextSelection`] (as a fat pointer [`ResultTextSelection`]). No text is modified.
fn trim_text_with<F>(&'slf self, f: F) -> Result<ResultTextSelection<'store>, StamError>
where
F: Fn(char) -> bool,
{
let mut trimbegin = 0;
let mut trimend = 0;
for c in self.text().chars() {
if f(c) {
trimbegin += 1;
} else {
break;
}
}
for c in self.text().chars().rev() {
if f(c) {
trimend -= 1;
} else {
break;
}
}
self.textselection(&Offset::new(
Cursor::BeginAligned(trimbegin),
Cursor::EndAligned(trimend),
))
}
/// Returns a [`TextSelection`] that corresponds to the offset. If the TextSelection
/// exists, the existing one will be returned (as a copy, but it will have a [`TextSelection::handle()`].
/// If it doesn't exist yet, a new one will be returned, and it won't have a handle, nor will it be added to the store automatically.
/// The [`TextSelection`] is returned as in a fat pointer ([`ResultTextSelection`]) that also contains reference to the underlying store.
///
/// Use [`TextResource::known_textselection()`] instead if you want to limit to existing text selections on resources.
fn textselection(&'slf self, offset: &Offset)
-> Result<ResultTextSelection<'store>, StamError>;
}
/// this implementation mostly defers directly to the wrapped item, documentation is found on the trait and not repeated here
impl<'store, 'slf> Text<'store, 'slf> for ResultItem<'store, TextResource>
where
'store: 'slf,
{
fn textlen(&self) -> usize {
self.as_ref().textlen()
}
fn text(&'slf self) -> &'store str {
self.as_ref().text()
}
fn text_by_offset(&self, offset: &Offset) -> Result<&'store str, StamError> {
self.as_ref().text_by_offset(offset)
}
fn absolute_cursor(&self, cursor: usize) -> usize {
cursor
}
fn utf8byte(&self, abscursor: usize) -> Result<usize, StamError> {
self.as_ref().utf8byte(abscursor)
}
fn utf8byte_to_charpos(&self, bytecursor: usize) -> Result<usize, StamError> {
self.as_ref().utf8byte_to_charpos(bytecursor)
}
}
impl<'store, 'slf> FindText<'store, 'slf> for ResultItem<'store, TextResource>
where
'store: 'slf,
{
/// Returns a [`TextSelection`] that corresponds to the offset. If the TextSelection
/// exists, the existing one will be returned.
/// If it doesn't exist yet, a new one will be returned, and it won't have a handle, nor will it be added to the store automatically.
///
/// The [`TextSelection`] is returned in a fat pointer ([`ResultTextSelection`]) that also contains reference to the underlying store.
fn textselection(&self, offset: &Offset) -> Result<ResultTextSelection<'store>, StamError> {
match self.as_ref().known_textselection(offset) {
Ok(Some(handle)) => {
//existing textselection
let textselection: &TextSelection = self.as_ref().get(handle)?; //shouldn't fail here anymore
let wrapped = textselection.as_resultitem(self.as_ref(), self.rootstore());
Ok(ResultTextSelection::Bound(wrapped))
}
Ok(None) => {
let textselection: TextSelection =
self.as_ref().textselection_by_offset_unchecked(offset)?;
Ok(ResultTextSelection::Unbound(
self.rootstore(),
self.as_ref(),
textselection,
))
}
Err(err) => Err(err), //an error occured, propagate
}
}
/// Searches the text using one or more regular expressions, returns an iterator over TextSelections along with the matching expression, this
/// is held by the [`FindRegexMatch`] struct.
///
/// Passing multiple regular expressions at once is more efficient than calling this function anew for each one.
/// If capture groups are used in the regular expression, only those parts will be returned (the rest is context). If none are used,
/// the entire expression is returned.
///
/// The `allow_overlap` parameter determines if the matching expressions are allowed to
/// overlap. It you are doing some form of tokenisation, you also likely want this set to
/// false. All of this only matters if you supply multiple regular expressions.
///
/// Results are returned in the exact order they are found in the text
fn find_text_regex<'regex>(
&self,
expressions: &'regex [Regex],
precompiledset: Option<&RegexSet>,
allow_overlap: bool,
) -> Result<FindRegexIter<'store, 'regex>, StamError> {
debug(self.as_ref().config(), || {
format!("find_text_regex: expressions={:?}", expressions)
});
let selectexpressions =
find_text_regex_select_expressions(self.text(), expressions, precompiledset)?;
//Returns an iterator that does the remainder of the actual searching
Ok(FindRegexIter {
resource: self.clone(),
expressions,
selectexpressions,
matchiters: Vec::new(),
nextmatches: Vec::new(),
text: self.text(),
begincharpos: 0,
beginbytepos: 0,
allow_overlap,
})
}
/// Searches for the specified text fragment. Returns an iterator to iterate over all matches in the text.
/// The iterator returns [`TextSelection`] items.
///
/// This search is case sensitive, use [`FindText::find_text_nocase()`] to search case insensitive.
/// For more complex and powerful searching use [`FindText::find_text_regex()`] instead
///
/// If you want to search only a subpart of the text, extract a [`TextSelection`] first with
/// [`FindText::textselection()`] and then run [`FindText::find_text()`] on that instead.
fn find_text<'fragment>(&self, fragment: &'fragment str) -> FindTextIter<'store, 'fragment> {
FindTextIter {
store: self.rootstore(),
resources: smallvec!(self.handle()),
resourcecursor: 0,
fragment,
offset: Offset::whole(),
}
}
/// Searches for the specified text fragment. Returns an iterator to iterate over all matches in the text.
/// The iterator returns [`TextSelection`] items.
///
/// This search is case insensitive, use [`FindText::find_text()`] to search case sensitive. This variant is slightly less performant than the exact variant.
/// For more complex and powerful searching use [`FindText::find_text_regex()`] instead
///
/// If you want to search only a subpart of the text, extract a [`TextSelection`] first with
/// [`FindText::textselection()`] and then run [`FindText::find_text_nocase()`] on that instead.
fn find_text_nocase(&self, fragment: &str) -> FindNoCaseTextIter<'store> {
FindNoCaseTextIter {
store: self.rootstore(),
resources: smallvec!(self.handle()),
resourcecursor: 0,
fragment: fragment.to_lowercase(),
offset: Offset::whole(),
}
}
/// Splits the text of this resource given a delimiter, the resulting iterator yields [`TextSelection`] items (as [`ResultTextSelection`]).
fn split_text<'b>(&self, delimiter: &'b str) -> SplitTextIter<'store, 'b> {
SplitTextIter {
resource: self.clone(),
iter: self.text().split(delimiter),
byteoffset: 0,
}
}
}
impl<'store, 'slf> Text<'store, 'slf> for ResultItem<'store, TextSelection>
where
'store: 'slf,
{
fn text(&'slf self) -> &'store str {
let resource = self.store(); //courtesy of ResultItem
let beginbyte = resource
.utf8byte(self.begin())
.expect("utf8byte conversion should succeed");
let endbyte = resource
.utf8byte(self.end())
.expect("utf8byte conversion should succeed");
&resource.text()[beginbyte..endbyte]
}
fn textlen(&self) -> usize {
self.end() - self.begin()
}
/// Returns a string reference to a slice of text as specified by the offset
fn text_by_offset(&self, offset: &Offset) -> Result<&'store str, StamError> {
let beginbyte =
self.utf8byte(self.absolute_cursor(self.beginaligned_cursor(&offset.begin)?))?;
let endbyte =
self.utf8byte(self.absolute_cursor(self.beginaligned_cursor(&offset.end)?))?;
if endbyte < beginbyte {
Err(StamError::InvalidOffset(
Cursor::BeginAligned(beginbyte),
Cursor::BeginAligned(endbyte),
"End must be greater than or equal to begin. (Cursor should be interpreted as UTF-8 bytes in this error context only)",
))
} else {
Ok(&self.text()[beginbyte..endbyte])
}
}
/// This converts a unicode point to utf-8 byte, all in *relative* offsets to this textselection
fn utf8byte(&self, abscursor: usize) -> Result<usize, StamError> {
//Convert from and to absolute coordinates so we don't have to reimplemented all the logic
//and can just call this same method on [`TextResource`](crate::TextResource), which has the proper indices for this
let beginbyte = self
.store()
.subslice_utf8_offset(self.text())
.expect("subslice should succeed");
Ok(self.store().utf8byte(self.absolute_cursor(abscursor))? - beginbyte)
}
/// This converts utf-8 byte to charpos, all in *relative* offsets to this textselection
fn utf8byte_to_charpos(&self, bytecursor: usize) -> Result<usize, StamError> {
//Convert from and to absolute coordinates so we don't have to reimplemented all the logic
//and can just call this same method on [`TextResource`](crate::TextResource), which has the proper indices for this
let beginbyte = self
.store()
.subslice_utf8_offset(self.text())
.expect("subslice should succeed");
Ok(self
.store()
.utf8byte_to_charpos(self.absolute_cursor(beginbyte + bytecursor))?
- self.begin())
}
fn absolute_cursor(&self, cursor: usize) -> usize {
self.begin() + cursor
}
}
impl<'store, 'slf> FindText<'store, 'slf> for ResultItem<'store, TextSelection>
where
'store: 'slf,
{
/// Searches the text using one or more regular expressions, returns an iterator over TextSelections along with the matching expression, this
/// is held by the [`FindRegexMatch`] struct.
///
/// Passing multiple regular expressions at once is more efficient than calling this function anew for each one.
/// If capture groups are used in the regular expression, only those parts will be returned (the rest is context). If none are used,
/// the entire expression is returned.
///
/// An `offset` can be specified to work on a sub-part rather than the entire text (like an existing TextSelection).
///
/// The `allow_overlap` parameter determines if the matching expressions are allowed to
/// overlap. It you are doing some form of tokenisation, you also likely want this set to
/// false. All of this only matters if you supply multiple regular expressions.
///
/// Results are returned in the exact order they are found in the text
fn find_text_regex<'regex>(
&'slf self,
expressions: &'regex [Regex],
precompiledset: Option<&RegexSet>,
allow_overlap: bool,
) -> Result<FindRegexIter<'store, 'regex>, StamError> {
debug(self.store().config(), || {
format!(
"TextSelection::find_text_regex: expressions={:?}",
expressions
)
});
let text = self.text();
let selectexpressions =
find_text_regex_select_expressions(text, expressions, precompiledset)?;
//Returns an iterator that does the remainder of the actual searching
Ok(FindRegexIter {
resource: self.resource(),
expressions,
selectexpressions,
matchiters: Vec::new(),
nextmatches: Vec::new(),
text: self.text(),
begincharpos: self.begin(),
beginbytepos: self
.store()
.subslice_utf8_offset(text)
.expect("Subslice must be found"),
allow_overlap,
})
}
/// Searches for the specified text fragment. Returns an iterator to iterate over all matches in the text.
/// The iterator returns [`TextSelection`] items.
///
/// For more complex and powerful searching use [`FindText::find_text_regex()`] instead
///
/// If you want to search only a subpart of the text, extract a [`TextSelection`] first and then run [`FindText::find_text()`] on that instead.
fn find_text<'fragment>(
&'slf self,
fragment: &'fragment str,
) -> FindTextIter<'store, 'fragment> {
FindTextIter {
store: self.rootstore(),
resources: smallvec!(self.resource().handle()),
resourcecursor: 0,
fragment,
offset: Offset::from(self),
}
}
/// Searches for the specified text fragment. Returns an iterator to iterate over all matches in the text.
/// The iterator returns [`TextSelection`] items.
///
/// This search is case insensitive, use [`FindText::find_text()`] to search case sensitive. This variant is slightly less performant than the exact variant.
/// For more complex and powerful searching use [`FindText::find_text_regex()`] instead
///
/// If you want to search only a subpart of the text, extract a [`TextSelection`] first with
/// [`FindText::textselection()`] and then run [`FindText::find_text_nocase()`] on that instead.
fn find_text_nocase(&'slf self, fragment: &str) -> FindNoCaseTextIter<'store> {
FindNoCaseTextIter {
store: self.rootstore(),
resources: smallvec!(self.resource().handle()),
resourcecursor: 0,
fragment: fragment.to_lowercase(),
offset: Offset::from(self),
}
}
fn split_text<'b>(&'slf self, delimiter: &'b str) -> SplitTextIter<'store, 'b> {
SplitTextIter {
resource: self.resource(),
iter: self.store().text().split(delimiter),
byteoffset: self
.subslice_utf8_offset(self.text())
.expect("subslice must succeed for split_text"),
}
}
/// Returns a [`TextSelection`] that corresponds to the offset **WITHIN** the textselection.
/// This returns a [`TextSelection`] with absolute coordinates in the resource.
///
/// If the textselection is known (i.e. it has associated annotations), it will be returned as such with a handle (borrowed).
/// If it doesn't exist yet, a new one will be returned, and it won't have a handle, nor will it be added to the store automatically.
///
/// The [`TextSelection`] is returned as in a far pointer (`ResultItem`) that also contains reference to the underlying store (the [`TextResource`]).
fn textselection(
&'slf self,
offset: &Offset,
) -> Result<ResultTextSelection<'store>, StamError> {
let resource = self.resource(); //courtesy of ResultItem
let offset = self.absolute_offset(&offset)?; //turns the relative offset into an absolute one (i.e. offsets in TextResource)
resource.textselection(&offset)
}
}
impl<'store, 'slf> Text<'store, 'slf> for ResultTextSelection<'store>
where
'store: 'slf,
{
fn text(&'slf self) -> &'store str {
let resource = self.store();
let beginbyte = resource
.utf8byte(self.begin())
.expect("utf8byte conversion should succeed");
let endbyte = resource
.utf8byte(self.end())
.expect("utf8byte conversion should succeed");
&resource.text()[beginbyte..endbyte]
}
fn textlen(&self) -> usize {
self.end() - self.begin()
}
/// Returns a string reference to a slice of text as specified by the offset
fn text_by_offset(&'slf self, offset: &Offset) -> Result<&'store str, StamError> {
let beginbyte =
self.utf8byte(self.absolute_cursor(self.beginaligned_cursor(&offset.begin)?))?;
let endbyte =
self.utf8byte(self.absolute_cursor(self.beginaligned_cursor(&offset.end)?))?;
if endbyte < beginbyte {
Err(StamError::InvalidOffset(
Cursor::BeginAligned(beginbyte),
Cursor::BeginAligned(endbyte),
"End must be greater than or equal to begin. (Cursor should be interpreted as UTF-8 bytes in this error context only)",
))
} else {
Ok(&self.text()[beginbyte..endbyte])
}
}
/// Finds the utf-8 byte position where the specified text subslice begins
/// The returned offset is relative to the TextSelection
fn subslice_utf8_offset(&self, subslice: &str) -> Option<usize> {
let self_begin = self.text().as_ptr() as usize;
let sub_begin = subslice.as_ptr() as usize;
if sub_begin < self_begin || sub_begin > self_begin.wrapping_add(self.text().len()) {
None
} else {
Some(sub_begin.wrapping_sub(self_begin))
}
}
/// This converts a unicode point to utf-8 byte, all in *relative* offsets to this textselection
fn utf8byte(&self, abscursor: usize) -> Result<usize, StamError> {
//Convert from and to absolute coordinates so we don't have to reimplemented all the logic
//and can just call this same method on TextResource, which has the proper indices for this
let beginbyte = self
.store()
.subslice_utf8_offset(self.text())
.expect("subslice should succeed");
Ok(self.store().utf8byte(self.absolute_cursor(abscursor))? - beginbyte)
}
/// This converts utf-8 byte to charpos, all in *relative* offsets to this textselection
fn utf8byte_to_charpos(&self, bytecursor: usize) -> Result<usize, StamError> {
//Convert from and to absolute coordinates so we don't have to reimplemented all the logic
//and can just call this same method on TextResource, which has the proper indices for this
let beginbyte = self
.store()
.subslice_utf8_offset(self.text())
.expect("subslice should succeed");
Ok(self
.store()
.utf8byte_to_charpos(self.absolute_cursor(beginbyte + bytecursor))?
- self.begin())
}
fn absolute_cursor(&self, cursor: usize) -> usize {
self.begin() + cursor
}
}
impl<'store, 'slf> FindText<'store, 'slf> for ResultTextSelection<'store>
where
'store: 'slf,
{
/// Searches the text using one or more regular expressions, returns an iterator over TextSelections along with the matching expression, this
/// is held by the [`FindRegexMatch`] struct.
///
/// Passing multiple regular expressions at once is more efficient than calling this function anew for each one.
/// If capture groups are used in the regular expression, only those parts will be returned (the rest is context). If none are used,
/// the entire expression is returned.
///
/// An `offset` can be specified to work on a sub-part rather than the entire text (like an existing TextSelection).
///
/// The `allow_overlap` parameter determines if the matching expressions are allowed to
/// overlap. It you are doing some form of tokenisation, you also likely want this set to
/// false. All of this only matters if you supply multiple regular expressions.
///
/// Results are returned in the exact order they are found in the text
fn find_text_regex<'regex>(
&'slf self,
expressions: &'regex [Regex],
precompiledset: Option<&RegexSet>,
allow_overlap: bool,
) -> Result<FindRegexIter<'store, 'regex>, StamError> {
debug(self.store().config(), || {
format!(
"TextSelection::find_text_regex: expressions={:?}",
expressions
)
});
let text = self.text();
let selectexpressions =
find_text_regex_select_expressions(text, expressions, precompiledset)?;
//Returns an iterator that does the remainder of the actual searching
Ok(FindRegexIter {
resource: self.resource(),
expressions,
selectexpressions,
matchiters: Vec::new(),
nextmatches: Vec::new(),
text: self.text(),
begincharpos: self.begin(),
beginbytepos: self
.store()
.subslice_utf8_offset(text)
.expect("Subslice must be found"),
allow_overlap,
})
}
/// Searches for the specified text fragment. Returns an iterator to iterate over all matches in the text.
/// The iterator returns [`TextSelection`] items.
///
/// For more complex and powerful searching use [`FindText::find_text_regex()`] instead
///
/// If you want to search only a subpart of the text, extract a [`TextSelection`] first and then run [`self.find_text()`] on that instead.
fn find_text<'fragment>(
&'slf self,
fragment: &'fragment str,
) -> FindTextIter<'store, 'fragment> {
FindTextIter {
store: self.rootstore(),
resources: smallvec!(self.resource().handle()),
resourcecursor: 0,
fragment,
offset: Offset::from(self),
}
}
/// Searches for the specified text fragment. Returns an iterator to iterate over all matches in the text.
/// The iterator returns [`TextSelection`] items.
///
/// This search is case insensitive, use [`FindText::find_text()`] to search case sensitive. This variant is slightly less performant than the exact variant.
/// For more complex and powerful searching use [`FindText::find_text_regex()`] instead
///
/// If you want to search only a subpart of the text, extract a [`TextSelection`] first with
/// [`FindText::textselection()`] and then run [`FindText::find_text_nocase()`] on that instead.
fn find_text_nocase(&'slf self, fragment: &str) -> FindNoCaseTextIter<'store> {
FindNoCaseTextIter {
store: self.rootstore(),
resources: smallvec!(self.resource().handle()),
resourcecursor: 0,
fragment: fragment.to_lowercase(),
offset: Offset::from(self),
}
}
fn split_text<'b>(&'slf self, delimiter: &'b str) -> SplitTextIter<'store, 'b> {
SplitTextIter {
resource: self.resource(),
iter: self.store().text().split(delimiter),
byteoffset: self
.subslice_utf8_offset(self.text())
.expect("subslice must succeed for split_text"),
}
}
/// Returns a [`TextSelection`] that corresponds to the offset **WITHIN** the textselection.
/// This returns a [`TextSelection`] with absolute coordinates in the resource.
///
/// If the textselection is known (i.e. it has associated annotations), it will be returned as such with a handle (borrowed).
/// If it doesn't exist yet, a new one will be returned, and it won't have a handle, nor will it be added to the store automatically.
///
/// The [`TextSelection`] is returned as in a far pointer ([`ResultTextSelection`]) that also contains reference to the underlying store (the [`TextResource`]).
fn textselection(
&'slf self,
offset: &Offset,
) -> Result<ResultTextSelection<'store>, StamError> {
let offset = self.absolute_offset(&offset)?; //turns the relative offset into an absolute one (i.e. offsets in TextResource)
self.resource().textselection(&offset)
}
}
impl AnnotationStore {
/// Searches for text in all resources using one or more regular expressions, returns an iterator over TextSelections along with the matching expression, this
/// See [`FindText::find_text_regex()`].
/// Note that this method, unlike its counterpart [`FindText::find_text_regex()`], silently ignores any deeper errors that might occur.
pub fn find_text_regex<'store, 'r>(
&'store self,
expressions: &'r [Regex],
precompiledset: &'r Option<RegexSet>,
allow_overlap: bool,
) -> impl Iterator<Item = FindRegexMatch<'store, 'r>> {
self.resources()
.filter_map(move |resource: ResultItem<'store, TextResource>| {
// ^-- the move is only needed to move the bool in, otherwise we had to make it &'r bool and that'd be weird
resource
.find_text_regex(expressions, precompiledset.as_ref(), allow_overlap)
.ok() //ignore errors!
})
.flatten()
}
pub fn find_text<'store, 'fragment>(
&'store self,
fragment: &'fragment str,
) -> FindTextIter<'store, 'fragment> {
FindTextIter {
store: self,
resources: self
.resources
.iter()
.filter_map(|x| x.as_ref().map(|res| res.handle().unwrap()))
.collect(),
resourcecursor: 0,
fragment,
offset: Offset::whole(),
}
}
pub fn find_text_nocase<'store>(&'store self, fragment: &str) -> FindNoCaseTextIter<'store> {
FindNoCaseTextIter {
store: self,
resources: self
.resources
.iter()
.filter_map(|x| x.as_ref().map(|res| res.handle().unwrap()))
.collect(),
resourcecursor: 0,
fragment: fragment.to_lowercase(),
offset: Offset::whole(),
}
}
}
/// Auxiliary function used by find_text_regex(). This method does, if needed, a single initial pass
/// over the regular expression set, identifying which regular expressions match and are to be searched
/// for in subsequent passes to find WHERE they match.
pub(crate) fn find_text_regex_select_expressions<'a, 'b>(
text: &'a str,
expressions: &'b [Regex],
precompiledset: Option<&RegexSet>,
) -> Result<Vec<usize>, StamError> {
Ok(if expressions.len() > 2 {
//we have multiple expressions, first we do a pass to see WHICH of the regular expression matche (taking them all into account in a single pass!).
//then afterwards we find for each of the matching expressions WHERE they are found
let foundexpressions: Vec<_> = if let Some(regexset) = precompiledset {
regexset.matches(text).into_iter().collect()
} else {
RegexSet::new(expressions.iter().map(|x| x.as_str()))
.map_err(|e| {
StamError::RegexError(e, "Parsing regular expressions in search_text()")
})?
.matches(text)
.into_iter()
.collect()
};
foundexpressions
} else {
match expressions.len() {
1 => vec![0],
2 => vec![0, 1],
_ => unreachable!("Expected 1 or 2 expressions"),
}
})
}
/// Wrapper over iterator regex Matches or CaptureMatches
pub(crate) enum Matches<'r, 'store> {
NoCapture(regex::Matches<'r, 'store>),
WithCapture(regex::CaptureMatches<'r, 'store>),
}
/// Wrapper over regex Match or Captures (as returned by the iterator)
pub(crate) enum Match<'store> {
NoCapture(regex::Match<'store>),
WithCapture(regex::Captures<'store>),
}
impl<'t> Match<'t> {
/// Return the begin offset of the match (in utf-8 bytes)
fn begin(&self) -> usize {
match self {
Self::NoCapture(m) => m.start(),
Self::WithCapture(m) => {
let mut begin = None;
for group in m.iter() {
if let Some(group) = group {
if begin.is_none() || begin.unwrap() < group.start() {
begin = Some(group.start());
}
}
}
begin.expect("there must be at least one capture group that was found")
}
}
}
/// Return the end offset of the match (in utf-8 bytes)
fn end(&self) -> usize {
match self {
Self::NoCapture(m) => m.end(),
Self::WithCapture(m) => {
let mut end = None;
for group in m.iter() {
if let Some(group) = group {
if end.is_none() || end.unwrap() < group.start() {
end = Some(group.start());
}
}
}
end.expect("there must be at least one capture group that was found")
}
}
}
}
impl<'r, 't> Iterator for Matches<'r, 't> {
type Item = Match<'t>;
fn next(&mut self) -> Option<Self::Item> {
match self {
Self::NoCapture(iter) => {
if let Some(m) = iter.next() {
Some(Match::NoCapture(m))
} else {
None
}
}
Self::WithCapture(iter) => {
if let Some(m) = iter.next() {
Some(Match::WithCapture(m))
} else {
None
}
}
}
}
}
/// This match structure is returned by the [`FindRegexIter`] iterator, which is in turn produced
/// by [`FindText::find_text_regex()`] and searches a text based on regular expressions. This
/// structure represents a single regular-expression match of the iterator on the text.
pub struct FindRegexMatch<'store, 'r> {
expression: &'r Regex,
expression_index: usize,
textselections: SmallVec<[ResultTextSelection<'store>; 2]>,
//Records the numbers of the capture that match (1-indexed)
capturegroups: SmallVec<[usize; 2]>,
resource: ResultItem<'store, TextResource>,
}
impl<'store, 'r> FindRegexMatch<'store, 'r> {
/// Does this match return multiple text selections?
/// Multiple text selections are returned only when the expression contains multiple capture groups.
pub fn multi(&self) -> bool {
self.textselections.len() > 1
}
/// Returns the regular expression that matched
pub fn expression(&self) -> &'r Regex {
self.expression
}
/// Returns the index of regular expression that matched
pub fn expression_index(&self) -> usize {
self.expression_index
}
pub fn textselections(&self) -> &[ResultTextSelection<'store>] {
&self.textselections
}
pub fn resource(&self) -> &ResultItem<'store, TextResource> {
&self.resource
}
/// Records the number of the capture groups (1-indexed!) that match.
/// This array has the same length as textselections and identifies precisely
/// which textselection corresponds with which capture group.
pub fn capturegroups(&self) -> &[usize] {
&self.capturegroups
}
/// Return the text of the match, this only works
/// if the regular expression targets a single
/// consecutive text, i.e. by not using multiple capture groups.
pub fn as_str(&self) -> Option<&'store str> {
if self.multi() {
None
} else {
self.textselections
.first()
.map(|textselection| textselection.text())
}
}
/// This returns a vector of texts and is mainly useful in case multiple
/// patterns were captured.
/// Use [`Self::as_str()`] instead if you expect only a single text item.
pub fn text(&self) -> Vec<&str> {
self.textselections
.iter()
.map(|textselection| textselection.text())
.collect()
}
}
/// This iterator is produced by [`FindText::find_text_regex()`] and searches a text based on regular expressions.
pub struct FindRegexIter<'store, 'regex> {
pub(crate) resource: ResultItem<'store, TextResource>,
pub(crate) expressions: &'regex [Regex], // allows keeping all of the regular expressions external and borrow it, even if only a subset is found (subset is detected in prior pass by search_by_text())
pub(crate) selectexpressions: Vec<usize>, //points at an expression, not used directly but via selectionexpression() method
pub(crate) matchiters: Vec<Matches<'regex, 'store>>, //each expression (from selectexpressions) has its own interator (same length as above vec)
pub(crate) nextmatches: Vec<Option<Match<'store>>>, //this buffers the next match for each expression (from selectexpressions, same length as above vec)
pub(crate) text: &'store str,
pub(crate) begincharpos: usize,
pub(crate) beginbytepos: usize,
pub(crate) allow_overlap: bool,
}
impl<'store, 'regex> Iterator for FindRegexIter<'store, 'regex> {
type Item = FindRegexMatch<'store, 'regex>;
fn next(&mut self) -> Option<Self::Item> {
if self.matchiters.is_empty() {
//instantiate the iterators for the expressions and retrieve the first item for each
//this is only called once when the iterator first starts
for i in self.selectexpressions.iter() {
let re = &self.expressions[*i];
let mut iter = if re.captures_len() > 1 {
Matches::WithCapture(re.captures_iter(self.text))
} else {
Matches::NoCapture(re.find_iter(self.text))
};
self.nextmatches.push(iter.next());
self.matchiters.push(iter);
}
}
//find the best next match (the single one next in line amongst all the iterators)
let mut bestnextmatch: Option<&Match<'store>> = None;
let mut bestmatchindex = None;
for (i, m) in self.nextmatches.iter().enumerate() {
if let Some(m) = m {
if bestnextmatch.is_none() || m.begin() < bestnextmatch.unwrap().begin() {
bestnextmatch = Some(m);
bestmatchindex = Some(i);
}
}
}
if let Some(i) = bestmatchindex {
// this match will be the result, convert it to the proper structure
let m = self.nextmatches[i].take().unwrap();
// iterate any buffers than overlap with this result, discarding those matces in the process
if !self.allow_overlap {
for (j, m2) in self.nextmatches.iter_mut().enumerate() {
if j != i && m2.is_some() {
if m2.as_ref().unwrap().begin() >= m.begin()
&& m2.as_ref().unwrap().begin() < m.end()
{
//(note: no need to check whether m2.end in range m.begin-m.end)
*m2 = self.matchiters[j].next();
}
}
}
}
let result = self.match_to_result(m, i);
// iterate the iterator for this one and buffer the next match for next round
self.nextmatches[i] = self.matchiters[i].next();
Some(result)
} else {
//nothing found, we are all done
None
}
}
}
impl<'store, 'regex> FindRegexIter<'store, 'regex> {
/// Build the final match structure we return
fn match_to_result(
&self,
m: Match<'store>,
selectexpression_index: usize,
) -> FindRegexMatch<'store, 'regex> {
let expression_index = self.selectexpressions[selectexpression_index];
match m {
Match::NoCapture(m) => {
let textselection = self
.resource
.textselection(&Offset::simple(
self.begincharpos
+ self
.resource
.utf8byte_to_charpos(self.beginbytepos + m.start())
.expect("byte to pos conversion must succeed"),
self.begincharpos
+ self
.resource
.utf8byte_to_charpos(self.beginbytepos + m.end())
.expect("byte to pos conversion must succeed"),
))
.expect("textselection from offset must succeed");
FindRegexMatch {
expression: &self.expressions[expression_index],
expression_index,
resource: self.resource.clone(),
textselections: smallvec!(textselection),
capturegroups: smallvec!(),
}
}
Match::WithCapture(m) => {
let mut groupiter = m.iter();
groupiter.next(); //The first match always corresponds to the overall match of the regex, we can ignore it
let mut textselections: SmallVec<_> = SmallVec::new();
let mut capturegroups: SmallVec<[usize; 2]> = SmallVec::new();
for (i, group) in groupiter.enumerate() {
if let Some(group) = group {
capturegroups.push(i + 1); //1-indexed
textselections.push(
self.resource
.textselection(&Offset::simple(
self.begincharpos
+ self
.resource
.utf8byte_to_charpos(self.beginbytepos + group.start())
.expect("byte to pos conversion must succeed"),
self.begincharpos
+ self
.resource
.utf8byte_to_charpos(self.beginbytepos + group.end())
.expect("byte to pos conversion must succeed"),
))
.expect("textselection from offset must succeed"),
)
}
}
FindRegexMatch {
expression: &self.expressions[expression_index],
expression_index,
resource: self.resource.clone(),
textselections,
capturegroups,
}
}
}
}
}
/// This iterator is produced by [`FindText::find_text()`] and searches a text for a single fragment. The search is case sensitive. See [`FindNoCaseTextIter`] for a case-insensitive variant.
/// The iterator yields [`ResultTextSelection`] items (which encapsulates [`TextSelection`]).
pub struct FindTextIter<'a, 'b> {
pub(crate) store: &'a AnnotationStore,
pub(crate) resources: SmallVec<[TextResourceHandle; 1]>,
pub(crate) fragment: &'b str,
pub(crate) resourcecursor: usize,
pub(crate) offset: Offset,
}
impl<'a, 'b> Iterator for FindTextIter<'a, 'b> {
type Item = ResultTextSelection<'a>;
fn next(&mut self) -> Option<Self::Item> {
loop {
if let Some(resourcehandle) = self.resources.get(self.resourcecursor).copied() {
let resource = self
.store
.resource(resourcehandle)
.expect("resource must exist");
if let Some(text) = resource.text_by_offset(&self.offset).ok() {
let beginbytepos = resource
.subslice_utf8_offset(text)
.expect("bytepos must be valid");
if let Some(foundbytepos) = text.find(self.fragment) {
let endbytepos = foundbytepos + self.fragment.len();
let newbegin = resource
.utf8byte_to_charpos(beginbytepos + foundbytepos)
.expect("utf-8 byte must resolve to valid charpos");
let newend = resource
.utf8byte_to_charpos(beginbytepos + endbytepos)
.expect("utf-8 byte must resolve to valid charpos");
//set offset for next run
self.offset = Offset {
begin: Cursor::BeginAligned(newend),
end: self.offset.end,
};
match resource.textselection(&Offset::simple(newbegin, newend)) {
Ok(textselection) => return Some(textselection),
Err(e) => {
eprintln!("WARNING: FindTextIter ended prematurely: {}", e);
return None;
}
}
} else {
self.resourcecursor += 1;
self.offset = Offset::whole();
}
} else {
self.resourcecursor += 1;
self.offset = Offset::whole();
}
} else {
return None;
}
}
}
}
/// This iterator is produced by [`FindText::find_text_nocase()`] and searches a text for a single fragment, without regard for casing.
/// It has more overhead than the exact (case sensitive) variant [`FindTextIter`].
pub struct FindNoCaseTextIter<'a> {
pub(crate) store: &'a AnnotationStore,
pub(crate) resources: SmallVec<[TextResourceHandle; 1]>,
/// Fragment must be lowercase
pub(crate) fragment: String,
pub(crate) resourcecursor: usize,
pub(crate) offset: Offset,
}
impl<'a> Iterator for FindNoCaseTextIter<'a> {
type Item = ResultTextSelection<'a>;
fn next(&mut self) -> Option<Self::Item> {
loop {
if let Some(resourcehandle) = self.resources.get(self.resourcecursor).copied() {
let resource = self
.store
.resource(resourcehandle)
.expect("resource must exist");
if let Some(text) = resource.text_by_offset(&self.offset).ok() {
let beginbytepos = resource
.subslice_utf8_offset(text)
.expect("bytepos must be valid");
let text = text.to_lowercase();
if let Some(foundbytepos) = text.find(self.fragment.as_str()) {
let endbytepos = foundbytepos + self.fragment.len(); //MAYBE TODO: possible issue if uppercase and lowercase variants have different byte length!
let newbegin = resource
.utf8byte_to_charpos(beginbytepos + foundbytepos)
.expect("utf-8 byte must resolve to valid charpos");
let newend = resource
.utf8byte_to_charpos(beginbytepos + endbytepos)
.expect("utf-8 byte must resolve to valid charpos");
//set offset for next run
self.offset = Offset {
begin: Cursor::BeginAligned(newend),
end: self.offset.end,
};
match resource.textselection(&Offset::simple(newbegin, newend)) {
Ok(textselection) => return Some(textselection),
Err(e) => {
eprintln!("WARNING: FindTextIter ended prematurely: {}", e);
return None;
}
}
} else {
self.resourcecursor += 1;
self.offset = Offset::whole();
}
} else {
self.resourcecursor += 1;
self.offset = Offset::whole();
}
} else {
return None;
}
}
}
}
/// This iterator is produced by [`FindText::split_text()`] and splits a text based on a delimiter.
/// The iterator yields [`ResultTextSelection`] (which encapsulates [`TextSelection`]).
pub struct SplitTextIter<'store, 'b> {
pub(crate) resource: ResultItem<'store, TextResource>,
pub(crate) iter: std::str::Split<'store, &'b str>,
pub(crate) byteoffset: usize,
}
impl<'store, 'b> Iterator for SplitTextIter<'store, 'b> {
type Item = ResultTextSelection<'store>;
fn next(&mut self) -> Option<Self::Item> {
if let Some(matchstr) = self.iter.next() {
let beginbyte = self
.resource
.subslice_utf8_offset(matchstr)
.expect("match must be found")
- self.byteoffset;
let endbyte = (beginbyte + matchstr.len()) - self.byteoffset;
Some(
self.resource
.textselection(&Offset::simple(
self.resource
.utf8byte_to_charpos(beginbyte)
.expect("utf-8 byte must resolve to char pos"),
self.resource
.utf8byte_to_charpos(endbyte)
.expect("utf-8 byte must resolve to char pos"),
))
.expect("text selection must succeed"),
)
} else {
None
}
}
}