Show More
@@ -0,0 +1,6 b'' | |||
|
1 | from typing import Optional | |
|
2 | ||
|
3 | version: int | |
|
4 | ||
|
5 | def b85encode(text: bytes, pad: Optional[int]) -> bytes: ... | |
|
6 | def b85decode(text: bytes) -> bytes: ... |
@@ -0,0 +1,12 b'' | |||
|
1 | from typing import ( | |
|
2 | List, | |
|
3 | Tuple, | |
|
4 | ) | |
|
5 | ||
|
6 | version: int | |
|
7 | ||
|
8 | def bdiff(a: bytes, b: bytes): bytes | |
|
9 | def blocks(a: bytes, b: bytes) -> List[Tuple[int, int, int, int]]: ... | |
|
10 | def fixws(s: bytes, allws: bool) -> bytes: ... | |
|
11 | def splitnewlines(text: bytes) -> List[bytes]: ... | |
|
12 | def xdiffblocks(a: bytes, b: bytes) -> List[Tuple[int, int, int, int]]: ... |
@@ -0,0 +1,10 b'' | |||
|
1 | from typing import ( | |
|
2 | List, | |
|
3 | ) | |
|
4 | ||
|
5 | version: int | |
|
6 | ||
|
7 | class mpatchError(Exception): ... | |
|
8 | ||
|
9 | def patches(text: bytes, bins: List[bytes]) -> bytes: ... | |
|
10 | def patchedsize(orig: int, data: bytes) -> int: ... |
@@ -0,0 +1,26 b'' | |||
|
1 | from typing import ( | |
|
2 | AnyStr, | |
|
3 | IO, | |
|
4 | List, | |
|
5 | Sequence, | |
|
6 | ) | |
|
7 | ||
|
8 | version: int | |
|
9 | ||
|
10 | class stat: | |
|
11 | st_dev: int | |
|
12 | st_mode: int | |
|
13 | st_nlink: int | |
|
14 | st_size: int | |
|
15 | st_mtime: int | |
|
16 | st_ctime: int | |
|
17 | ||
|
18 | def listdir(path: bytes, st: bool, skip: bool) -> List[stat]: ... | |
|
19 | def posixfile(name: AnyStr, mode: bytes, buffering: int) -> IO: ... | |
|
20 | def statfiles(names: Sequence[bytes]) -> List[stat]: ... | |
|
21 | def recvfds(sockfd: int) -> List[int]: ... | |
|
22 | def setprocname(name: bytes) -> None: ... | |
|
23 | def getfstype(path: bytes) -> bytes: ... | |
|
24 | def getfsmountpoint(path: bytes) -> bytes: ... | |
|
25 | def unblocksignal(sig: int) -> None: ... | |
|
26 | def isgui() -> bool: ... |
@@ -0,0 +1,78 b'' | |||
|
1 | from typing import ( | |
|
2 | Callable, | |
|
3 | Dict, | |
|
4 | Iterator, | |
|
5 | List, | |
|
6 | Optional, | |
|
7 | Set, | |
|
8 | Tuple, | |
|
9 | Union, | |
|
10 | ) | |
|
11 | ||
|
12 | version: int | |
|
13 | versionerrortext: str | |
|
14 | ||
|
15 | class dirstatetuple: | |
|
16 | __doc__: str | |
|
17 | ||
|
18 | def __len__(self) -> int: ... | |
|
19 | def __getitem__(self, key: int) -> Union[bytes, int]: ... | |
|
20 | ||
|
21 | # From dirs.c | |
|
22 | ||
|
23 | class dirs: | |
|
24 | __doc__: str | |
|
25 | def __init__(self, source, skipchar: bytes): ... | |
|
26 | def __iter__(self) -> Iterator[bytes]: ... | |
|
27 | def addpath(self, path: bytes) -> None: ... | |
|
28 | def delpath(self, path: bytes) -> None: ... | |
|
29 | ||
|
30 | # From manifest.c | |
|
31 | class lazymanifest: | |
|
32 | def __init__(self, data: bytes): ... | |
|
33 | def __iter__(self) -> Iterator[bytes]: ... | |
|
34 | ||
|
35 | def __len__(self) -> int: ... | |
|
36 | def __getitem__(self, item: bytes) -> Optional[Tuple[bytes, bytes]]: ... | |
|
37 | def __setitem__(self, key: bytes, value: Tuple[bytes, bytes]) -> None: ... | |
|
38 | def __delitem__(self, key: bytes) -> None: ... | |
|
39 | ||
|
40 | def iterkeys(self) -> Iterator[bytes]: ... | |
|
41 | def iterentries(self) -> Iterator[Tuple[bytes, bytes, bytes]]: ... | |
|
42 | def copy(self) -> lazymanifest: ... | |
|
43 | def filtercopy(self, matchfn: Callable[[bytes], bool]) -> lazymanifest: ... | |
|
44 | def diff(self, other: lazymanifest, clean: Optional[bool]) -> Dict[bytes, Tuple[bytes, Tuple]]: ... | |
|
45 | def text(self) -> bytes: ... | |
|
46 | ||
|
47 | # From revlog.c | |
|
48 | ||
|
49 | class index: | |
|
50 | __doc__: str | |
|
51 | ||
|
52 | nodemap: Dict[bytes, int] | |
|
53 | ||
|
54 | def ancestors(self, *args: int) -> Iterator[int]: ... | |
|
55 | def commonancestorsheads(self, *args: int) -> List[int]: ... | |
|
56 | def clearcaches(self) -> None: ... | |
|
57 | def get(self, value: bytes) -> Optional[int]: ... | |
|
58 | def get_rev(self, value: bytes) -> Optional[int]: ... | |
|
59 | def has_node(self, value: Union[int, bytes]) -> bool: ... | |
|
60 | def rev(self, node: bytes) -> int: ... | |
|
61 | def computephasesmapsets(self, root: Dict[int, Set[bytes]]) -> Tuple[int, Dict[int, Set[bytes]]]: ... | |
|
62 | def reachableroots2(self, minroot: int, heads: List[int], roots: List[int], includepath: bool) -> List[int]: ... | |
|
63 | def headrevs(self, filteredrevs: Optional[List[int]]) -> List[int]: ... | |
|
64 | def headrevsfiltered(self, filteredrevs: Optional[List[int]]) -> List[int]: ... | |
|
65 | def issnapshot(self, value: int) -> bool: ... | |
|
66 | def findsnapshots(self, cache: Dict[int, List[int]], start_rev: int) -> None: ... | |
|
67 | def deltachain(self, rev: int, stop: int, generaldelta: bool) -> Tuple[List[int], bool]: ... | |
|
68 | def slicechunktodensity(self, revs: List[int], targetdensity: float, mingapsize: int) -> List[List[int]]: ... | |
|
69 | def append(self, value: Tuple[int, int, int, int, int, int, int, bytes]) -> None: ... | |
|
70 | def partialmatch(self, node: bytes) -> bytes: ... | |
|
71 | def shortest(self, value: bytes) -> int: ... | |
|
72 | def stats(self) -> Dict[bytes, int]: ... | |
|
73 | ||
|
74 | class nodetree: | |
|
75 | __doc__: str | |
|
76 | ||
|
77 | def insert(self, rev: int) -> None: ... | |
|
78 | def shortest(self, node: bytes) -> int: ... |
General Comments 0
You need to be logged in to leave comments.
Login now