mirror of
https://github.com/zulip/zulip.git
synced 2025-11-04 05:53:43 +00:00
62 lines
1.7 KiB
Python
62 lines
1.7 KiB
Python
from collections import defaultdict
|
|
from typing import Dict, List, Set
|
|
|
|
from .html_branches import html_branches, HtmlTreeBranch
|
|
|
|
def show_all_branches(fns):
|
|
# type: (List[str]) -> None
|
|
for fn in fns:
|
|
print(fn)
|
|
text = open(fn).read()
|
|
branches = html_branches(text, fn=fn)
|
|
for branch in branches:
|
|
print(branch.text())
|
|
print('---')
|
|
|
|
class Grepper:
|
|
'''
|
|
A Grepper object is optimized to do repeated
|
|
searches of words that can be found in our
|
|
HtmlTreeBranch objects.
|
|
'''
|
|
|
|
def __init__(self, fns):
|
|
# type: (List[str]) -> None
|
|
all_branches = [] # type: List[HtmlTreeBranch]
|
|
|
|
for fn in fns:
|
|
text = open(fn).read()
|
|
branches = html_branches(text, fn=fn)
|
|
all_branches += branches
|
|
|
|
self.word_dict = defaultdict(set) # type: Dict[str, Set[HtmlTreeBranch]]
|
|
for b in all_branches:
|
|
for word in b.words:
|
|
self.word_dict[word].add(b)
|
|
|
|
self.all_branches = set(all_branches)
|
|
|
|
def grep(self, word_set):
|
|
# type: (Set[str]) -> None
|
|
|
|
words = list(word_set) # type: List[str]
|
|
|
|
if len(words) == 0:
|
|
matches = self.all_branches
|
|
else:
|
|
matches = self.word_dict[words[0]]
|
|
for i in range(1, len(words)):
|
|
matches = matches & self.word_dict[words[i]]
|
|
|
|
branches = list(matches)
|
|
branches.sort(key=lambda branch: (branch.fn, branch.line))
|
|
for branch in branches:
|
|
print('%s %d' % (branch.fn, branch.line))
|
|
print(branch.staircase_text())
|
|
print('')
|
|
|
|
def grep(fns, words):
|
|
# type: (List[str], Set[str]) -> None
|
|
grepper = Grepper(fns)
|
|
grepper.grep(words)
|