kvarn_search/lib.rs
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 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441
use std::collections::HashSet;
use elipdotter::index::{OccurenceProvider, Provider};
use kvarn::prelude::*;
use tokio::sync::RwLock;
pub use elipdotter;
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum IndexKind {
/// Stores only which documents words appear in.
/// Requires reading each of those documents when getting the occurrences.
Simple,
/// Stores all the occurrences of all the words.
/// Much faster than [`IndexKind::Simple`] byt requires more memory.
/// This is basically like loading the entire website into memory.
Lossless,
}
#[derive(Debug)]
pub struct Options {
/// The kind of index to use.
pub kind: IndexKind,
/// Forces documents which have been deleted to be removed from the index immediately.
///
/// This brings more consistent query times for a bit of performance if the FS is modified
/// often.
///
/// Default `true`
pub force_remove: bool,
/// The limit of word proximity to accept as "close enough".
///
/// Between [0..1], where 1 is the exact word, and 0 is basically everything.
///
/// Default: `0.85`
pub proximity_threshold: f32,
/// Which proximity algorithm to use.
///
/// Default: [`elipdotter::proximity::Algorithm::Hamming`]
pub proximity_algorithm: elipdotter::proximity::Algorithm,
/// The limit of different words where it will only search for proximate words which start with
/// the same [`char`].
///
/// Default: `2_500`
pub word_count_limit: usize,
/// Max number of hits to respond with.
///
/// Does not improve performance of the searching algorithm.
///
/// Default: `50`
pub response_hits_limit: usize,
/// Distance of two occurrences where they are considered "next to each other".
///
/// Default: `100`
pub distance_threshold: usize,
/// Interval of clearing of the internal cache.
///
/// This greatly improves performance, and stays out of your way, as it clears itself.
///
/// Default: `10 minutes`
pub clear_interval: Duration,
/// The max length of the input query.
///
/// If the length is too large, often many documents are searched, hurting performance.
///
/// Default: `100`
pub query_max_length: usize,
/// The highest number of [`elipdotter::Part::String`] a query can have.
///
/// Allowing too many of these slows down the query.
///
/// Default: `10`
pub query_max_terms: usize,
/// Additional documents to always index.
/// Only used if you call [`SearchEngineHandle::index_all`].
/// Will only be once, at start-up, if they aren't on the FS.
///
/// Only the [`Uri::path`] component will be used, so setting this to another domain won't work
/// :)
pub additional_paths: Vec<Uri>,
/// Always ignore queries which start with any of these [`Uri`]s.
///
/// Only the [`Uri::path`] component will be used.
pub ignore_paths: Vec<Uri>,
/// Ignore these file extensions.
/// This is useful for not indexing images and other media.
///
/// Defaults: `jpg avif ico png mkv mp4 mp3 m4a wav woff woff2 css js`
///
/// The strings MUST NOT include `.`
pub ignore_extensions: Vec<String>,
/// Index the WordPress-generated sitemap at `/sitemap.xml`?
///
/// Default: `false`
/// Requires features: `wordpress-sitemap`
pub index_wordpress_sitemap: bool,
}
impl Options {
pub fn new() -> Self {
Self {
kind: IndexKind::Simple,
force_remove: true,
proximity_threshold: 0.85,
proximity_algorithm: elipdotter::proximity::Algorithm::Hamming,
word_count_limit: 2_500,
response_hits_limit: 50,
distance_threshold: 100,
clear_interval: Duration::from_secs(10 * 60),
query_max_length: 100,
query_max_terms: 10,
additional_paths: Vec::new(),
ignore_paths: Vec::new(),
ignore_extensions: vec![
"jpg".into(),
"avif".into(),
"ico".into(),
"png".into(),
"mkv".into(),
"mp4".into(),
"mp3".into(),
"m4a".into(),
"wav".into(),
"woff".into(),
"woff2".into(),
"css".into(),
"js".into(),
],
index_wordpress_sitemap: false,
}
}
}
impl Default for Options {
fn default() -> Self {
Self::new()
}
}
#[derive(Debug)]
enum Index {
Simple(elipdotter::SimpleIndex),
Lossless(elipdotter::LosslessIndex),
}
impl Index {
fn word_count(&self) -> usize {
match self {
Index::Simple(i) => i.words().count(),
Index::Lossless(i) => i.words().count(),
}
}
fn size(&self) -> usize {
match self {
Index::Simple(i) => i.size(),
Index::Lossless(i) => i.size(),
}
}
}
#[derive(serde::Serialize)]
struct ResponseOccurrence {
start: usize,
ctx_byte_idx: usize,
ctx_char_idx: usize,
ctx: String,
}
#[derive(serde::Serialize)]
struct HitResponse {
path: String,
rating: f32,
occurrences: Vec<ResponseOccurrence>,
}
/// `accept` MUST be a valid [`HeaderValue`].
fn request(path: impl AsRef<str>, accept: impl AsRef<str>) -> Request<application::Body> {
// https://url.spec.whatwg.org/#c0-control-percent-encode-set
static CODE_SET: &percent_encoding::AsciiSet = &{
{
{
{ percent_encoding::CONTROLS }
.add(b' ')
.add(b'"')
.add(b'#')
.add(b'<')
.add(b'>')
}
.add(b'?')
.add(b'`')
.add(b'{')
.add(b'}')
}
.add(b':')
.add(b';')
.add(b'=')
.add(b'@')
.add(b'[')
.add(b'\\')
.add(b']')
.add(b'^')
.add(b'|')
}
.add(b'$')
.add(b'&');
let path = path.as_ref();
Request::builder()
.uri(percent_encoding::utf8_percent_encode(path, CODE_SET).to_string())
.method("GET")
.header("user-agent", "kvarn-search-engine-indexer")
.header("accept-encoding", "identity")
.header("accept", accept.as_ref())
.body(kvarn::application::Body::Bytes(Bytes::new().into()))
// We know this is OK.
.unwrap()
}
/// Quite slow, takes ~70ms (debug) to get
///
/// It's the HTML parsing which is the real problem.
fn text_from_response(response: &kvarn::CacheReply) -> Result<Cow<'_, str>, ()> {
let body = &response.identity_body;
let mime: Option<internals::Mime> = response
.response
.headers()
.get(header::CONTENT_TYPE)
.and_then(|header| header.to_str().ok())
.and_then(|content_type| content_type.parse().ok());
let text = match mime {
Some(mime)
if mime.type_() == internals::mime::TEXT && mime.subtype() == internals::mime::HTML =>
{
{
let body = String::from_utf8_lossy(body);
let html = scraper::Html::parse_document(&body);
let selected_body = html
.select(&scraper::Selector::parse("main").unwrap())
.next()
.or_else(|| {
html.select(&scraper::Selector::parse("body").unwrap())
.next()
});
if let Some(content) = selected_body {
let ignored = |s| {
matches!(s, |"code"| "a"
| "span"
| "i"
| "b"
| "em"
| "strong"
| "u"
| "s"
| "q"
| "ul"
| "ol"
| "table"
| "center"
| "kbd"
| "cite"
| "abbr"
| "mark"
| "dfn"
| "small"
| "sup"
| "sub"
| "link"
| "script"
| "style"
| "img"
| "video")
};
let doubled = |s: &str| {
s.strip_prefix('h').and_then(|v| {
if v.len() != 1 {
return None;
}
let char = v.chars().next().unwrap();
if char == 'r' || ('1'..='6').contains(&char) {
Some(char)
} else {
None
}
})
};
let nodes = content.descendants();
let mut document = String::with_capacity(body.len() / 2);
let mut ignore = 0;
for node in nodes {
if ignore > 0 {
ignore -= 1;
continue;
}
if let scraper::Node::Element(e) = node.value() {
if let Some(char) = doubled(e.name()) {
let hashes: Result<u32, _> = char.to_string().parse();
if let Ok(hashes) = hashes {
for _ in 0..hashes {
document.push('#')
}
document.push(' ')
}
}
if e.name() == "table" && e.attr("id") == Some("toc") {
ignore = node.descendants().count();
}
}
if let scraper::Node::Text(e) = node.value() {
let first = node.prev_sibling().is_none();
let last = node.next_sibling().is_none();
let trimmed = if e.chars().all(|c| c.is_whitespace()) {
continue;
} else if first && last {
e.trim()
} else if first {
e.trim_start()
} else if last {
e.trim_end()
} else {
e
};
document.push_str(trimmed);
// add newline?
if last {
let parent = node.parent();
let parent_tag = parent
.and_then(|p| p.value().as_element())
.map_or("", |parent| parent.name());
let ignore = ignored(parent_tag);
if ignore {
// if parent is last in grandparent, just use grandparent's
// newline capabilities.
if let Some(parent) = parent {
if parent.next_sibling().is_none() {
let grandparent = parent.parent();
if let Some(grandparent) = grandparent {
if let Some(tag) = grandparent
.value()
.as_element()
.map(|p| p.name())
{
if !ignored(tag) {
if doubled(tag).is_some() {
document.push_str("\n\n")
} else {
document.push('\n')
}
}
}
}
}
}
// else (if ignored), do nothing
} else if doubled(parent_tag).is_some() {
document.push_str("\n\n");
} else {
document.push('\n');
}
}
}
}
Cow::Owned(document)
} else {
info!("Kvarn gave HTML response without body.");
return Err(());
}
}
}
Some(mime)
if mime.type_() == internals::mime::TEXT && mime.subtype() != internals::mime::CSS =>
{
String::from_utf8_lossy(body)
}
_ => return Err(()),
};
Ok(text)
}
/// To not have to [`Arc`]s.
#[derive(Debug)]
struct SearchEngineHandleInner {
index: RwLock<Index>,
doc_map: RwLock<elipdotter::DocumentMap>,
options: Options,
watching: threading::atomic::AtomicBool,
document_cache: RwLock<HashMap<String, Arc<String>>>,
}
#[derive(Debug, PartialEq, Eq)]
pub enum WatchError {
/// Can occur if the host name isn't part of the [`HostCollection`] because the host doesn't
/// exist, or because it's inside another collection.
HostNotFound,
/// The [file system feature](host::Options::disable_fs) was disabled for this host.
FsDisabled,
}
#[derive(Debug, Clone)]
pub struct SearchEngineHandle {
inner: Arc<SearchEngineHandleInner>,
}
impl SearchEngineHandle {
/// This spawns a new [task](tokio::spawn) for every request it makes.
/// The requests are processed in parallell - this should return within the longest response
/// duration.
pub async fn index(&self, host: &Host, documents: impl Iterator<Item = String>) {
#[derive(Debug)]
enum UriOrString {
String(String),
#[cfg(feature = "wordpress-sitemap")]
Uri(Uri),
}
impl UriOrString {
fn s(&self) -> &str {
match self {
#[cfg(feature = "wordpress-sitemap")]
Self::Uri(uri) => uri.path(),
Self::String(s) => s,
}
}
fn into_string(self) -> String {
match self {
#[cfg(feature = "wordpress-sitemap")]
Self::Uri(uri) => uri.path().to_owned(),
Self::String(s) => s,
}
}
}
#[cfg(feature = "wordpress-sitemap")]
#[derive(Debug)]
enum EitherIter<I1, I2> {
One(I1),
Two(I1, I2),
}
#[cfg(feature = "wordpress-sitemap")]
impl<T, I1: Iterator<Item = T>, I2: Iterator<Item = T>> Iterator for EitherIter<I1, I2> {
type Item = T;
fn next(&mut self) -> Option<Self::Item> {
match self {
Self::One(i) => i.next(),
Self::Two(i1, i2) => {
if let Some(next) = i1.next() {
Some(next)
} else {
i2.next()
}
}
}
}
}
let start = Instant::now();
#[cfg(feature = "wordpress-sitemap")]
let bytes = if self.inner.options.index_wordpress_sitemap {
let mut request = request("/sitemap.xml", "text/xml");
let response = kvarn::handle_cache(
&mut request,
net::SocketAddrV4::new(net::Ipv4Addr::LOCALHOST, 0).into(),
host,
)
.await;
if !response.response.status().is_success() {
error!("Failed to get WordPress site map for a host where it was enabled");
return;
}
let bytes = response.identity_body;
Some(bytes)
} else {
None
};
#[cfg(feature = "wordpress-sitemap")]
let sitemap = if let Some(bytes) = &bytes {
let text = if let Ok(s) = str::from_utf8(bytes) {
s
} else {
error!("WordPress supplied a site map with invalid UTF-8");
return;
};
let sitemap = match sitemap_iter::Document::parse(text) {
Ok(doc) => doc,
Err(err) => {
error!("WordPress supplied an incorrectly formatted sitemap: {err:?}");
return;
}
};
Some(sitemap)
} else {
None
};
#[cfg(feature = "wordpress-sitemap")]
let urls = if let Some(sitemap) = &sitemap {
match sitemap.iterate() {
Ok(iter) => Some(iter.filter_map(|entry| {
if let Ok(uri) = entry.location.parse() {
Some(uri)
} else {
error!(
"WordPress sitemap contains invalid uri: {:?}",
entry.location
);
None
}
})),
Err(err) => {
error!("WordPress supplied an incorrectly formatted sitemap: {err:?}");
None
}
}
} else {
None
};
let size_hint = documents.size_hint();
let mut handles = Vec::with_capacity(size_hint.1.unwrap_or(size_hint.0));
let documents = documents.map(UriOrString::String);
#[cfg(feature = "wordpress-sitemap")]
let documents = if let Some(urls) = urls {
EitherIter::Two(documents, urls.map(UriOrString::Uri))
} else {
EitherIter::One(documents)
};
for document in documents.filter(|doc| {
!doc.s().starts_with("/./")
&& !self
.inner
.options
.ignore_paths
.iter()
.any(|ignored| doc.s().starts_with(ignored.path()))
}) {
// SAFETY: We use the pointer inside the future.
// When we await all handles at the end of this fn, the pointer is no longer used.
// Therefore, it doesn't escape this fn. host isn't used after it's lifetime.
// could be negated with tokio scoped tasks, but that's not available: https://github.com/tokio-rs/tokio/issues/3162
let host_ptr = UnsafePointer(host as *const Host);
let me = self.clone();
let handle = spawn(async move {
#[allow(clippy::redundant_locals)] // to satisfy borrow checker
let host_ptr = host_ptr;
let host = unsafe { &*host_ptr.0 };
debug!("Getting response from {:?}", document.s());
let response = me.get_response(host, document.s(), true).await;
response.map(|text| (document, text))
})
.await;
handles.push(handle);
}
let mut responses = Vec::new();
for handle in handles {
if let Some(response) = handle.await {
responses.push(response);
}
}
let me = self.clone();
let host_name = host.name.clone();
// move the processing to the background, so we return early!
let _task = spawn(async move {
for (document, text) in responses {
debug!("Indexing {:?}", document.s());
let id = {
let mut doc_map = me.inner.doc_map.write().await;
doc_map.reserve_id(document.into_string())
};
{
let me = me.clone();
tokio::task::spawn_blocking(move || {
let mut index =
tokio::runtime::Handle::current().block_on(me.inner.index.write());
match &mut *index {
Index::Simple(i) => i.digest_document(id, &text),
Index::Lossless(i) => i.digest_document(id, &text),
}
})
.await
.unwrap(); // `TODO`: Investigate if `.await` is a good idea here.
}
}
info!(
"Indexing done for {}. {} words. Took {}ms. Size in memory is {}KB",
host_name,
me.inner.index.read().await.word_count(),
start.elapsed().as_millis(),
me.inner.index.read().await.size() / 1024,
);
debug!("Doc map: {:#?}", me.inner.doc_map.read().await);
trace!("Index: {:#?}", me.inner.index.read().await);
})
.await;
}
/// Indexes all the pages in `host`.
///
/// Read [this section of an article](https://icelk.dev/articles/search-engine.html#kvarn-integration) about how it fetches this.
pub async fn index_all(&self, host: &Host) {
let documents = find_documents(
host,
&self.inner.options.additional_paths,
&self.inner.options.ignore_extensions,
)
.await;
self.index(host, documents.into_iter()).await;
}
async fn get_response(&self, host: &Host, document: &str, cache: bool) -> Option<Arc<String>> {
if cache {
let cache = self.inner.document_cache.read().await;
if let Some(text) = cache.get(document) {
return Some(Arc::clone(text));
}
}
let mut request = request(document, "text/html");
let response = kvarn::handle_cache(
&mut request,
net::SocketAddrV4::new(net::Ipv4Addr::LOCALHOST, 0).into(),
host,
)
.await;
if !response.response.status().is_success() {
debug!("Response from Kvarn isn't a 200. Page '{}'", document);
return None;
}
if !response
.response
.headers()
.get("content-type")
.and_then(|ct| ct.to_str().ok())
.map_or(false, |ct| ct.contains("text/html"))
{
return None;
}
let text = if let Ok(text) = text_from_response(&response) {
Arc::new(text.into_owned())
} else {
return None;
};
{
let mut cache = self.inner.document_cache.write().await;
cache.insert(document.to_owned(), Arc::clone(&text));
}
Some(text)
}
/// Watch for changes and rebuild index/cache, only for the resources that changed.
///
/// This must be called within a Tokio runtime.
///
/// The returned [`notify::RecommendedWatcher`] should not be dropped.
/// When it is dropped, the functionality of this function stops.
pub async fn watch(
&self,
host_name: impl Into<String>,
collection: Arc<HostCollection>,
) -> Result<notify::RecommendedWatcher, WatchError> {
use notify::{event::EventKind::*, event::*, RecursiveMode, Watcher};
use tokio::sync::mpsc::channel;
struct EventEffects {
delete: Option<PathBuf>,
index: Option<PathBuf>,
}
let host_name = host_name.into();
let host = collection
.get_host(&host_name)
.ok_or(WatchError::HostNotFound)?;
if host.options.disable_fs {
return Err(WatchError::FsDisabled);
}
let (tx, mut rx) = channel(1024);
let rt = tokio::runtime::Handle::current();
let mut watcher = notify::RecommendedWatcher::new(
move |res| match res {
Err(err) => {
error!("Failed to watch directory, but continuing: {:?}", err);
}
Ok(res) => rt
.block_on(async { tx.send(res).await.expect("failed to send notify message") }),
},
notify::Config::default(),
)
.expect("failed to start watching directory for changes");
let path = Path::new(&host.path).join(host.options.get_public_data_dir());
info!("Watching {}", path.display());
self.inner.watching.store(true, threading::Ordering::SeqCst);
let host_name = host.name.clone();
let handle = self.clone();
watcher.watch(&path, RecursiveMode::Recursive).unwrap();
let _task = spawn(async move {
let host = collection
.get_host(&host_name)
.expect("we just did this above");
loop {
let _handle = tokio::runtime::Handle::current();
let mut event = if let Some(m) = rx.recv().await {
m
} else {
info!("Watcher dropped - stop watching for file changes.");
break;
};
let mut iter = std::mem::take(&mut event.paths).into_iter();
let source = iter.next();
let destination = iter.next();
debug!(
"File {} changed on the FS. {}{}Event is of type {:?}.",
source
.as_deref()
.unwrap_or_else(|| Path::new("<unknown>"))
.display(),
destination
.as_deref()
.unwrap_or_else(|| Path::new(""))
.display(),
if destination.is_some() {
" is the destination. "
} else {
""
},
event.kind,
);
let effects: EventEffects = match event.kind {
Create(CreateKind::File) => EventEffects {
delete: None,
index: source,
},
Remove(RemoveKind::File) => EventEffects {
delete: source,
index: None,
},
Modify(ModifyKind::Data(_)) => EventEffects {
delete: None,
index: source,
},
Modify(ModifyKind::Name(RenameMode::To)) => EventEffects {
delete: None,
index: source,
},
Modify(ModifyKind::Name(RenameMode::From)) => EventEffects {
delete: source,
index: None,
},
Modify(ModifyKind::Name(RenameMode::Both)) => EventEffects {
delete: source,
index: destination,
},
_ => EventEffects {
delete: None,
index: None,
},
};
if let Some(delete) = effects.delete.as_ref().and_then(|path| path.to_str()) {
if handle.inner.options.force_remove {
let mut doc_map = handle.inner.doc_map.write().await;
let mut index = handle.inner.index.write().await;
let mut path = PrefixPath::new(host).await;
let document = if let Some(doc) = path
.process(
delete,
Path::new(&host.path).is_absolute()
|| Path::new(&host.options.get_public_data_dir()).is_absolute(),
)
.await
{
doc
} else {
continue;
};
let id = doc_map.get_id(&document);
if let Some(id) = id {
match &mut *index {
Index::Simple(i) => doc_map.force_remove(id, i),
Index::Lossless(i) => doc_map.force_remove(id, i),
}
}
} else {
// On remove, rely on the missing feature of occurrences to clean it up.
}
}
if let Some(index) = effects.index.as_ref().and_then(|path| path.to_str()) {
{
let mut cache = handle.inner.document_cache.write().await;
cache.remove(index);
}
let mut path = PrefixPath::new(host).await;
let document = if let Some(doc) = path
.process(
index,
Path::new(&host.path).is_absolute()
|| Path::new(&host.options.get_public_data_dir()).is_absolute(),
)
.await
{
doc
} else {
continue;
};
let text = if let Some(text) = handle.get_response(host, &document, false).await
{
text
} else {
continue;
};
let id = {
let mut doc_map = handle.inner.doc_map.write().await;
doc_map.reserve_id(&document)
};
let handle = handle.clone();
tokio::task::spawn_blocking(move || {
let mut index =
tokio::runtime::Handle::current().block_on(handle.inner.index.write());
match &mut *index {
Index::Simple(i) => i.digest_document(id, &text),
Index::Lossless(i) => i.digest_document(id, &text),
}
});
}
}
})
.await;
Ok(watcher)
}
}
async fn get_documents_in_query<'a>(
host: &Host,
handle: &SearchEngineHandle,
query: &'a elipdotter::Query,
) -> Result<
(
Vec<elipdotter::index::Id>,
elipdotter::proximity::ProximateMap<'a>,
),
FatResponse,
> {
let lock = handle.inner.index.read().await;
let (documents, proximate_map) = match &*lock {
Index::Simple(i) => {
let mut d = query.documents(i);
let i = d.iter().map(|i| i.collect::<Vec<_>>());
(i, d.take_proximate_map())
}
Index::Lossless(i) => {
let mut d = query.documents(i);
let i = d.iter().map(|i| i.collect::<Vec<_>>());
(i, d.take_proximate_map())
}
};
let docs = match documents {
Ok(docs) => docs,
Err(err) => match err {
elipdotter::query::IterError::StrayNot => {
return Err(default_error_response(
StatusCode::BAD_REQUEST,
host,
Some("NOT without AND, this is an illegal operation"),
)
.await)
}
},
};
Ok((docs, proximate_map))
}
async fn get_documents<'a, I: IntoIterator<Item = &'a elipdotter::index::Id>>(
host: &Host,
handle: &SearchEngineHandle,
documents: I,
) -> HashMap<elipdotter::index::Id, Arc<String>>
where
I::IntoIter: ExactSizeIterator,
{
let now = Instant::now();
let documents = documents.into_iter();
debug!("Get docs with query: {:?}", now.elapsed().as_micros());
let documents = {
let lock = handle.inner.doc_map.read().await;
let mut docs = Vec::with_capacity(documents.len());
for id in documents {
// ~~UNWRAP: We have just gotten this from the index, which is "associated" with
// this doc map.~~
// It could have been removed in the process.
if let Some(name) = lock.get_name(*id) {
docs.push((*id, name.to_owned()));
}
}
docs
};
debug!("Get docs names: {:?}", now.elapsed().as_micros());
let documents = {
let doc_len = documents.len();
let mut handles = Vec::with_capacity(doc_len);
for (id, doc) in documents {
let host_ptr = UnsafePointer(host as *const Host);
let se_handle = handle.clone();
let handle = spawn(async move {
#[allow(clippy::redundant_locals)] // to satisfy borrow checker
let host_ptr = host_ptr;
let host = unsafe { &*host_ptr.0 };
debug!("Requesting {}{}", host.name, doc);
let text = se_handle.get_response(host, &doc, true).await?;
Some((id, text))
})
.await;
handles.push(handle);
}
let mut docs = HashMap::with_capacity(doc_len);
for handle in handles {
if let Some((id, text)) = handle.await {
docs.insert(id, text);
}
}
docs
};
debug!("Get doc contents: {:?}", now.elapsed().as_micros());
documents
}
fn first_char_boundary(s: &str, start: usize, backwards: bool) -> usize {
let mut start = start;
loop {
if s.is_char_boundary(start) {
break;
}
if backwards {
start -= 1;
} else {
start += 1;
}
}
start
}
fn resolve_context(
documents: &HashMap<elipdotter::index::Id, Arc<String>>,
id: elipdotter::index::Id,
occ_start: usize,
) -> Option<ResponseOccurrence> {
let Some(doc) = &documents.get(&id) else {
let loaded = documents
.iter()
.map(|(k, v)| {
let mut s = v.chars().take(50).collect();
s += "…";
(*k, s)
})
.collect::<HashMap<_, String>>();
error!(
"Document {:?} wasn't loaded for the query. \
Documents loaded: {loaded:?}",
id,
);
return None;
};
let ctx_start = first_char_boundary(doc, occ_start.saturating_sub(50), false);
let ctx_end = first_char_boundary(doc, std::cmp::min(occ_start + 50, doc.len()), true);
let ctx = doc[ctx_start..ctx_end].to_owned();
let ctx_byte_idx = occ_start - ctx_start;
Some(ResponseOccurrence {
start: occ_start,
ctx_byte_idx,
ctx_char_idx: {
ctx.char_indices()
.position(|(pos, _char)| pos >= ctx_byte_idx)
.unwrap_or(ctx_byte_idx)
},
ctx,
})
}
/// `path`: the path to use for the search API.
/// Use something which starts with `/./` if you don't want it to be public.
pub async fn mount_search(
extensions: &mut Extensions,
path: impl AsRef<str>,
mut options: Options,
) -> SearchEngineHandle {
let path = path.as_ref();
if let Ok(uri) = path.parse() {
options.ignore_paths.push(uri);
} else {
warn!(
"Mounting path supplied is not an URI: {path:?}. Should be something like '/search'."
);
}
let index = match options.kind {
IndexKind::Simple => Index::Simple(elipdotter::SimpleIndex::new(
options.proximity_threshold,
options.proximity_algorithm,
options.word_count_limit,
)),
IndexKind::Lossless => Index::Lossless(elipdotter::LosslessIndex::new(
options.proximity_threshold,
options.proximity_algorithm,
options.word_count_limit,
)),
};
let doc_map = elipdotter::DocumentMap::new();
let handle = SearchEngineHandle {
inner: Arc::new(SearchEngineHandleInner {
index: RwLock::new(index),
doc_map: RwLock::new(doc_map),
options,
watching: false.into(),
document_cache: RwLock::new(HashMap::new()),
}),
};
let ext_handle = handle.clone();
extensions.add_prepare_single(
path,
prepare!(
req,
host,
_path,
_addr,
move |ext_handle: SearchEngineHandle| {
let now = Instant::now();
let handle = ext_handle;
let query = utils::parse::query(req.uri().query().unwrap_or(""));
let query = if let Some(query) = query.get("q") {
query
} else {
return default_error_response(
StatusCode::BAD_REQUEST,
host,
Some("specify the search query using URI query parameter `q`"),
)
.await;
};
if query.value().len() > handle.inner.options.query_max_length {
return default_error_response(
StatusCode::BAD_REQUEST,
host,
Some("query is too long"),
)
.await;
}
let query: elipdotter::Query = match query.value().parse() {
Ok(q) => q,
Err(err) => {
let message = format!("query malformed: {}", err);
return default_error_response(
StatusCode::BAD_REQUEST,
host,
Some(&message),
)
.await;
}
};
{
let mut string_parts = 0;
query.root().for_each_string(&mut |_s| string_parts += 1);
if string_parts > handle.inner.options.query_max_terms {
return default_error_response(
StatusCode::BAD_REQUEST,
host,
Some("too many parts in the query"),
)
.await;
}
}
let is_lossless;
let (mut hits, missing) = {
let index = handle.inner.index.read().await;
is_lossless = matches!(&*index, Index::Lossless(_));
let doc_map = handle.inner.doc_map.read().await;
fn collect_hits<'a>(
provider: &'a impl OccurenceProvider<'a>,
query: &'a elipdotter::Query,
distance_threshold: usize,
documents: &HashMap<elipdotter::index::Id, Arc<String>>,
doc_map: &elipdotter::DocumentMap,
) -> Vec<HitResponse> {
// UNWRAP: We handled this above, and have asserted there are not stray NOTs in the
// query.
let occurrence_iter =
query.occurrences(provider, distance_threshold).unwrap();
occurrence_iter
.map(|hit| {
let occurrences = hit.occurrences().filter_map(|occ| {
resolve_context(documents, hit.id(), occ.start())
});
HitResponse {
path: doc_map.get_name(hit.id()).unwrap_or("").to_owned(),
rating: hit.rating(),
occurrences: occurrences.collect(),
}
})
.filter(|hit| !hit.occurrences.is_empty())
.collect()
}
match &*index {
Index::Simple(index) => {
let (docs, proximate_map) =
match get_documents_in_query(host, handle, &query).await {
Ok(v) => v,
Err(v) => return v,
};
let documents = get_documents(host, handle, &docs).await;
let mut occurrences =
elipdotter::SimpleOccurrencesProvider::new(index, &proximate_map);
for (id, body) in &documents {
occurrences.add_document(*id, Arc::clone(body));
}
(
collect_hits(
&occurrences,
&query,
ext_handle.inner.options.distance_threshold,
&documents,
&doc_map,
),
Some(occurrences.missing()),
)
}
Index::Lossless(index) => {
let proximate_map = query.documents(index).take_proximate_map();
let provider =
elipdotter::LosslessOccurrencesProvider::new(index, &proximate_map);
let hits = {
let occurrence_iter = query
.occurrences(
&provider,
ext_handle.inner.options.distance_threshold,
)
.unwrap();
occurrence_iter
.map(|hit| {
let occurrences =