Debian Codegraph @

stubs/calibre_extensions/_patiencediff_c.pyi

raw
1 from collections.abc import Callable, Sequence
2
3 def unique_lcs_c(a: Sequence[str], b: Sequence[str]) -> list[tuple[int, int]]:
4 "Find the longest common subsequence of unique lines in a and b"
5 pass
6
7 def recurse_matches_c(
8 a: Sequence[str],
9 b: Sequence[str],
10 alo: int,
11 blo: int,
12 ahi: int,
13 bhi: int,
14 answer: list[tuple[int, int]],
15 maxrecursion: int,
16 ) -> None:
17 "Recursively find pairs of lines that match uniquely, appending (a, b) index pairs to answer"
18 pass
19
20 class PatienceSequenceMatcher_c:
21 def __init__(self, isjunk: Callable[[str], bool] | None, a: Sequence[str], b: Sequence[str]) -> None:
22 "C implementation of PatienceSequenceMatcher"
23 pass
24
25 def get_matching_blocks(self) -> list[tuple[int, int, int]]:
26 "Return list of triples describing matching subsequences."
27 pass
28
29 def get_opcodes(self) -> list[tuple[str, int, int, int, int]]:
30 "Return list of 5-tuples describing how to turn a into b."
31 pass
32
33 def get_grouped_opcodes(self, n: int = 3) -> list[list[tuple[str, int, int, int, int]]]:
34 "Isolate change clusters by eliminating ranges with no changes."
35 pass