Improve MDHelper themes and packaging

This commit is contained in:
shenw
2026-05-25 22:00:37 +08:00
parent 2d896a618f
commit 0d2f62817b
41 changed files with 3729 additions and 86 deletions
+56 -14
View File
@@ -9,26 +9,29 @@ from .document_tree import DocumentEntry
class SearchMatch:
entry: DocumentEntry
snippet: str
match_count: int = 0
match_kind: str = "正文"
class SearchIndex:
def __init__(self, entries: list[DocumentEntry] | None = None) -> None:
self._records: list[tuple[DocumentEntry, str]] = []
self._records: list[tuple[DocumentEntry, str, str, str]] = []
if entries:
self.rebuild(entries)
def rebuild(self, entries: list[DocumentEntry]) -> None:
self._records = [(entry, self._haystack(entry)) for entry in entries]
self._records = [(entry, entry.title, entry.relative_path, _read_text(entry)) for entry in entries]
def matches_entry(self, entry: DocumentEntry, query: str) -> bool:
normalized = query.strip().casefold()
if not normalized:
return True
for indexed_entry, haystack in self._records:
for indexed_entry, title, relative_path, body in self._records:
if indexed_entry.path == entry.path:
haystack = self._haystack(title, relative_path, body)
return normalized in haystack.casefold()
return normalized in self._haystack(entry).casefold()
return normalized in self._haystack(entry.title, entry.relative_path, _read_text(entry)).casefold()
def search(self, query: str, limit: int = 80) -> list[SearchMatch]:
normalized = query.strip().casefold()
@@ -36,18 +39,26 @@ class SearchIndex:
return []
matches: list[SearchMatch] = []
for entry, haystack in self._records:
index = haystack.casefold().find(normalized)
if index < 0:
for entry, title, relative_path, body in self._records:
result = _match_details(title, relative_path, body, normalized)
if result is None:
continue
matches.append(SearchMatch(entry=entry, snippet=_snippet(haystack, index, len(normalized))))
snippet, match_count, match_kind = result
matches.append(
SearchMatch(
entry=entry,
snippet=snippet,
match_count=match_count,
match_kind=match_kind,
)
)
if len(matches) >= limit:
break
return matches
def _haystack(self, entry: DocumentEntry) -> str:
return f"{entry.title}\n{entry.relative_path}\n{_read_text(entry)}"
def _haystack(self, title: str, relative_path: str, body: str) -> str:
return f"{title}\n{relative_path}\n{body}"
def matches_entry(entry: DocumentEntry, query: str) -> bool:
@@ -66,12 +77,19 @@ def search_entries(entries: list[DocumentEntry], query: str, limit: int = 80) ->
matches: list[SearchMatch] = []
for entry in entries:
text = _read_text(entry)
haystack = f"{entry.title}\n{entry.relative_path}\n{text}"
index = haystack.casefold().find(normalized)
if index < 0:
result = _match_details(entry.title, entry.relative_path, text, normalized)
if result is None:
continue
matches.append(SearchMatch(entry=entry, snippet=_snippet(haystack, index, len(normalized))))
snippet, match_count, match_kind = result
matches.append(
SearchMatch(
entry=entry,
snippet=snippet,
match_count=match_count,
match_kind=match_kind,
)
)
if len(matches) >= limit:
break
return matches
@@ -94,3 +112,27 @@ def _snippet(text: str, index: int, length: int) -> str:
if end < len(text):
snippet += "..."
return snippet
def _match_details(title: str, relative_path: str, body: str, normalized_query: str) -> tuple[str, int, str] | None:
fields = (
("标题", title),
("路径", relative_path),
("正文", body),
)
total = sum(_count_matches(text, normalized_query) for _, text in fields)
if total <= 0:
return None
for kind, text in fields:
index = text.casefold().find(normalized_query)
if index >= 0:
return _snippet(text, index, len(normalized_query)), total, kind
return None
def _count_matches(text: str, normalized_query: str) -> int:
if not normalized_query:
return 0
return text.casefold().count(normalized_query)