forked from ilanschnell/bitarray
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
c5dd0e9
commit b0cda33
Showing
2 changed files
with
30 additions
and
32 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,43 +1,43 @@ | ||
from typing import Any, AnyStr, BinaryIO, Hashable, Optional, Union | ||
|
||
from bitarray import bitarray, Int1, Bool, Endian | ||
from bitarray import bitarray | ||
|
||
|
||
def zeros(length: int, endian: Optional[Endian] = ...) -> bitarray: ... | ||
def urandom(length: int, endian: Optional[Endian] = ...) -> bitarray: ... | ||
def zeros(length: int, endian: Optional[str] = ...) -> bitarray: ... | ||
def urandom(length: int, endian: Optional[str] = ...) -> bitarray: ... | ||
def pprint(a: Any, stream: BinaryIO = ..., | ||
group: int = ..., | ||
indent: int = ..., | ||
width: int = ...) -> None: ... | ||
|
||
def make_endian(a: bitarray, endian: Endian) -> bitarray: ... | ||
def rindex(a: bitarray, Value: Bool) -> int: ... | ||
def make_endian(a: bitarray, endian: str) -> bitarray: ... | ||
def rindex(a: bitarray, Value: int) -> int: ... | ||
def strip(a: bitarray, mode: str = ...) -> bitarray: ... | ||
|
||
def count_n(a: bitarray, n: int, /) -> int: ... | ||
def parity(a: bitarray, /) -> Int1: ... | ||
def parity(a: bitarray, /) -> int: ... | ||
def count_and(a: bitarray, b: bitarray, /) -> int: ... | ||
def count_or(a: bitarray, b: bitarray, /) -> int: ... | ||
def count_xor(a: bitarray, b: bitarray, /) -> int: ... | ||
def subset(a: bitarray, b: bitarray, /) -> bool: ... | ||
|
||
def ba2hex(a: bitarray, /) -> str: ... | ||
def hex2ba(s: AnyStr, /, | ||
endian: Optional[Endian] = ...) -> bitarray: ... | ||
endian: Optional[str] = ...) -> bitarray: ... | ||
|
||
def ba2base(n: int, a: bitarray, /) -> str: ... | ||
def base2ba(n: int, | ||
s: AnyStr, /, | ||
endian: Optional[Endian] = ...) -> bitarray: ... | ||
endian: Optional[str] = ...) -> bitarray: ... | ||
|
||
def ba2int(a: bitarray, signed: int = ...) -> int: ... | ||
def int2ba(i: int, /, | ||
length: int = ..., | ||
endian: Endian = ..., | ||
endian: str = ..., | ||
signed: int = ...) -> bitarray: ... | ||
|
||
def serialize(a: bitarray, /) -> bytes: ... | ||
def deserialize(b: bytes, /) -> bitarray: ... | ||
def huffman_code(freq_map: dict[Hashable, Union[int, float]], | ||
endian: Optional[Endian] = ... | ||
endian: Optional[str] = ... | ||
) -> dict[Hashable, bitarray]: ... |