Lines Matching refs:int
62 def encode_binary(data: Union[bytes,Sequence[int]], ecl: QrCode.Ecc) -> QrCode:
73 def encode_segments(segs: Sequence[QrSegment], ecl: QrCode.Ecc, minversion: int = 1, maxversion: int = 40, mask: int = -1, boostecl: bool = True) -> QrCode:
89 datacapacitybits: int = QrCode._get_num_data_codewords(version, ecl) * 8 # Number of data bits available
90 datausedbits: Optional[int] = QrSegment.get_total_bits(segs, version)
139 _version: int
143 _size: int
151 _mask: int
163 def __init__(self, version: int, errcorlvl: QrCode.Ecc, datacodewords: Union[bytes,Sequence[int]], msk: int) -> None:
190 minpenalty: int = 1 << 32
209 def get_version(self) -> int:
213 def get_size(self) -> int:
221 def get_mask(self) -> int:
225 def get_module(self, x: int, y: int) -> bool:
247 alignpatpos: List[int] = self._get_alignment_pattern_positions()
248 numalign: int = len(alignpatpos)
249 skips: Sequence[Tuple[int,int]] = ((0, 0), (0, numalign - 1), (numalign - 1, 0))
260 def _draw_format_bits(self, mask: int) -> None:
264 data: int = self._errcorlvl.formatbits << 3 | mask # errCorrLvl is uint2, mask is uint3
265 rem: int = data
268 bits: int = (data << 10 | rem) ^ 0x5412 # uint15
295 rem: int = self._version # version is uint6, in the range [7, 40]
298 bits: int = self._version << 12 | rem # uint18
304 a: int = self._size - 11 + i % 3
305 b: int = i // 3
310 def _draw_finder_pattern(self, x: int, y: int) -> None:
321 def _draw_alignment_pattern(self, x: int, y: int) -> None:
329 def _set_function_module(self, x: int, y: int, isdark: bool) -> None:
342 version: int = self._version
346 numblocks: int = QrCode._NUM_ERROR_CORRECTION_BLOCKS[self._errcorlvl.ordinal][version]
347 blockecclen: int = QrCode._ECC_CODEWORDS_PER_BLOCK [self._errcorlvl.ordinal][version]
348 rawcodewords: int = QrCode._get_num_raw_data_modules(version) // 8
349 numshortblocks: int = numblocks - rawcodewords % numblocks
350 shortblocklen: int = rawcodewords // numblocks
355 k: int = 0
381 i: int = 0 # Bit index into the data
388 x: int = right - j # Actual x coordinate
390 y: int = (self._size - 1 - vert) if upward else vert # Actual y coordinate
399 def _apply_mask(self, mask: int) -> None:
407 masker: Callable[[int,int],int] = QrCode._MASK_PATTERNS[mask]
413 def _get_penalty_score(self) -> int:
416 result: int = 0
417 size: int = self._size
423 runx: int = 0
466 dark: int = sum((1 if cell else 0) for row in modules for cell in row)
467 total: int = size**2 # Note that size is odd, so dark/total != 1/2
469 k: int = (abs(dark * 20 - total * 10) + total - 1) // total - 1
478 def _get_alignment_pattern_positions(self) -> List[int]:
482 ver: int = self._version
486 numalign: int = ver // 7 + 2
487 step: int = 26 if (ver == 32) else \
489 result: List[int] = [(self._size - 7 - i * step) for i in range(numalign - 1)] + [6]
494 def _get_num_raw_data_modules(ver: int) -> int:
500 result: int = (16 * ver + 128) * ver + 64
502 numalign: int = ver // 7 + 2
511 def _get_num_data_codewords(ver: int, ecl: QrCode.Ecc) -> int:
521 def _reed_solomon_compute_divisor(degree: int) -> bytes:
533 root: int = 1
549 factor: int = b ^ result.pop(0)
557 def _reed_solomon_multiply(x: int, y: int) -> int:
563 z: int = 0
571 def _finder_penalty_count_patterns(self, runhistory: collections.deque) -> int:
574 n: int = runhistory[1]
581 def _finder_penalty_terminate_and_count(self, currentruncolor: bool, currentrunlength: int, runhistory: collections.deque) -> int:
591 def _finder_penalty_add_history(self, currentrunlength: int, runhistory: collections.deque) -> None:
599 MIN_VERSION: int = 1 # The minimum version number supported in the QR Code Model 2 standard
600 MAX_VERSION: int = 40 # The maximum version number supported in the QR Code Model 2 standard
603 _PENALTY_N1: int = 3
604 _PENALTY_N2: int = 3
605 _PENALTY_N3: int = 40
606 _PENALTY_N4: int = 10
608 _ECC_CODEWORDS_PER_BLOCK: Sequence[Sequence[int]] = (
616 _NUM_ERROR_CORRECTION_BLOCKS: Sequence[Sequence[int]] = (
624 _MASK_PATTERNS: Sequence[Callable[[int,int],int]] = (
639 ordinal: int # (Public) In the range 0 to 3 (unsigned 2-bit integer)
640 formatbits: int # (Package-private) In the range 0 to 3 (unsigned 2-bit integer)
644 def __init__(self, i: int, fb: int) -> None:
678 def make_bytes(data: Union[bytes,Sequence[int]]) -> QrSegment:
694 i: int = 0
696 n: int = min(len(digits) - i, 3)
697 bb.append_bits(int(digits[i : i + n]), n * 3 + 1)
711 temp: int = QrSegment._ALPHANUMERIC_ENCODING_TABLE[text[i]] * 45
736 def make_eci(assignval: int) -> QrSegment:
779 _numchars: int
782 _bitdata: List[int]
787 def __init__(self, mode: QrSegment.Mode, numch: int, bitdata: Sequence[int]) -> None:
804 def get_num_chars(self) -> int:
808 def get_data(self) -> List[int]:
815 def get_total_bits(segs: Sequence[QrSegment], version: int) -> Optional[int]:
821 ccbits: int = seg.get_mode().num_char_count_bits(version)
837 _ALPHANUMERIC_ENCODING_TABLE: Dict[str,int] = {ch: i for (i, ch) in enumerate("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:")}
845 _modebits: int # The mode indicator bits, which is a uint4 value (range 0 to 15)
846 _charcounts: Tuple[int,int,int] # Number of character count bits for three different version ranges
849 def __init__(self, modebits: int, charcounts: Tuple[int,int,int]):
854 def get_mode_bits(self) -> int:
859 def num_char_count_bits(self, ver: int) -> int:
885 def append_bits(self, val: int, n: int) -> None:
893 def _get_bit(x: int, i: int) -> bool: