?iddlmZddlZddlZddlZddlmZddlmZm Z m Z m Z m Z m Z GddZGddZGd d eZdd ZGd d eZy)) annotationsN)Sequence)CallableDictListOptionalTupleUnionceZdZUdZedEdZedFdZedGdHdZded <ded <ded <ded <d ed<d ed<dIdZ dJdZ dJdZ dKdZ dJdZ dLdZdMdZdNdZdMdZdOdZdOdZdPdZdQdZdRdZdNdZdJdZdSd ZedTd!ZedUd"ZedVd#ZedWd$ZedXd%ZdYd&ZdZd'Z d[d(Z!dZ"ded)<dZ#ded*<d+Z$ded,<d+Z%ded-<dZ&ded.<d/Z'ded0<d1Z(d2ed3<d4Z)d2ed5<d6d7d8d9d:d;d<d=fZ*d>ed?<Gd@dAZ+e+dBde+_,e+ddBe+_-e+dCd+e+_.e+d+dCe+_/yD)\QrCodeaA QR Code symbol, which is a type of two-dimension barcode. Invented by Denso Wave and described in the ISO/IEC 18004 standard. Instances of this class represent an immutable square grid of dark and light cells. The class provides static factory functions to create a QR Code from text or binary data. The class covers the QR Code Model 2 specification, supporting all versions (sizes) from 1 to 40, all 4 error correction levels, and 4 character encoding modes. Ways to create a QR Code object: - High level: Take the payload data and call QrCode.encode_text() or QrCode.encode_binary(). - Mid level: Custom-make the list of segments and call QrCode.encode_segments(). - Low level: Custom-make the array of data codeword bytes (including segment headers and final padding, excluding error correction codewords), supply the appropriate version number, and call the QrCode() constructor. (Note that all ways require supplying the desired error correction level.) QrCode.EcccXtj|}tj||S)aReturns a QR Code representing the given Unicode text string at the given error correction level. As a conservative upper bound, this function is guaranteed to succeed for strings that have 738 or fewer Unicode code points (not UTF-16 code units) if the low error correction level is used. The smallest possible QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version.) QrSegment make_segmentsr encode_segments)texteclsegss P/var/www/html/myprovider/mon_projet_qr/lib/python3.12/site-packages/qrcodegen.py encode_textzQrCode.encode_text2s'$11$7$   c **cVtjtj|g|S)aReturns a QR Code representing the given binary data at the given error correction level. This function always encodes using the binary segment mode, not any text mode. The maximum number of bytes allowed is 2953. The smallest possible QR Code version is automatically chosen for the output. The ECC level of the result may be higher than the ecl argument if it can be done without increasing the version.)r rr make_bytes)datars r encode_binaryzQrCode.encode_binary=s%   !5!5d!; 2  g!99'3G!K!*!9!9$!H<l6F&F  !C L>)?@P?QQV WS 3     !! !""FJJ$7$7IfLF$B$B7F$SVW$WW C |" c>>#,,...0!4>>###%s||~'I'I''RS99S\\ RL  33GSAAE R$ $$ $..C+c"g567..SWHqL! R1  .g "g!! >>'1 QC3r7a<01-B-1hq#aCAQK001 mT 22r_version_size _errcorlvl_maskzList[List[bool]]_modules _isfunctionctj|cxkrtjkstdtdd|cxkrdkstdtd||_|dzdz|_||_t|j Dcgc]}dg|j zc}|_t|j Dcgc]}dg|j zc}|_ |j|jt|}|j||dk(r^d}td D]N}|j||j||j!} | |kr|}| }|j|Pd |cxkrdksJJ||_|j||j||` y cc}wcc}w) zCreates a new QR Code with the given version number, error correction level, data codeword bytes, and mask number. This is a low-level API that most users should not use directly. A mid-level API is the encode_segments() function.zVersion value out of ranger r!Mask value out of ranger#r%Flr"rN)r r'r(r)rOrPrQr*rSrT_draw_function_patterns_add_ecc_and_interleaver>_draw_codewords _apply_mask_draw_format_bits_get_penalty_scorerR) selfrD errcorlvlrLmsk_ allcodewords minpenaltyrMpenaltys r__init__zQrCode.__init__s    =6+=+= = 0 11 > 0 11 .q. - ..  - ..$-{R$*$/5:$**4EFqug *F$-49$**4EFqug *F$ 44Y}5MN,|$ BY: !HqQ1%%'G SZQ cQ$*3 1GFs G Gc|jS)z q 4::  PA$7TZZ$7 PT]]1=Ma=PPrcPt|jD]4}|jd||dzdk(|j|d|dzdk(6|jdd|j|jdz d|jd|jdz |j }t |}dd|dz f|dz dff}t|D]1}t|D]!}||f|vs |j ||||#3|jd|jy) zLReads this object's version field, and draws and marks all function modules.rr&r#)rrrN) r*rP_set_function_module_draw_finder_pattern _get_alignment_pattern_positionsr:_draw_alignment_patternr[ _draw_version)r]rM alignpatposnumalignskipsjs rrWzQrCode._draw_function_patternss4  /aQ1q5A:.Q1q5A:./ Aq!DJJNA.AtzzA~. @@B+k"(%+aA->Aq@Q$R% ?Ba (OBq 1vU !!+a.+a.ABB rc J|jjdz|z}|}tdD]}|dz|dz dzz }|dz|zdz }|dz dk(sJtdd D]}|jd |t ||!|jd d t |d |jd d t |d |jd d t |d tddD]"}|jd |z d t ||$tdd D]/}|j|j dz |z d t ||1td dD]/}|jd |j dz |zt ||1|jd |j d z d y)zDraws two copies of the format bits (with its own error correction code) based on the given mask and this object's error correction level field.r& r i7iTrrur"r!TN)rQ formatbitsr*rw_get_bitrP)r]rBrremr`bitsrMs rr[zQrCode._draw_format_bitssoo((A-4$ # 9+a (qE) *3+rzC6)$ q A;6aQ8D!#456Aq(4"34Aq(4"34Aq(4"34 B<;aR!VQq(9:; A;GaTZZ!^a/HT14EFG B<HaQ R! 3XdA5FGHAtzzA~t4rch|jdkry|j}tdD]}|dz|dz dzz }|jdz|z}|dz dk(sJtdD]N}t||}|jdz |d zz}|d z}|j ||||j |||Py) zDraws two copies of the version bits (with its own error correction code), based on this object's version field, iff 7 <= version <= 40.r!N r i%rr&)rOr*rrPrw)r]rr`rrMrNabs rr{zQrCode._draw_version s ]]Q ]]# 9-a (r V+ ,3-mmr!C'$ q 9(aa 3 JJOa!e #1 F1Q3'Q3' (rc "tddD]}tddD]o}||z||z}}d|cxkr|jks#n&d|cxkr|jks f  $--1$1arcz|j}t|tj||jk(sJtj |jj |}tj|jj |}tj|dz}|||zz }||z}g}tj|} d} t|D]e} || | |z|z | |krdndz} | t| z } tj| | } | |kr| jd|j| | zg| t|k(sJt}tt|dD]7} t|D]'\}}| ||z k7s||k\s|j|| )9t||k(sJ|S)zReturns a new byte string representing the given data with the appropriate error correction codewords appended to it, based on this object's version and error correction level.r"rr)rOr:r r+rQ_NUM_ERROR_CORRECTION_BLOCKSordinal_ECC_CODEWORDS_PER_BLOCK_get_num_raw_data_modules_reed_solomon_compute_divisorr*_reed_solomon_compute_remainderappendr>r?)r]rrD numblocks blockecclen rawcodewordsnumshortblocks shortblocklenblocksrsdivkrMdateccresultrblks rrXzQrCode._add_ecc_and_interleaveSs' Tf44WdooN NN N66t7N7NOPWX)44t7N7NOPWX+66w?1D,!L9$<<.#y0-&55kB% !  aQ..A ]]3q6 V $$ $ -rc $t|tj|jdzk(sJd}t |j dz ddD]}|dkr|dz}t |j D]}t dD]z}||z }|dzdzdk(}|r|j dz |z n|}|j ||r<|t|dzksNt||dz d|dzz |j||<|dz }||t|dzk(sJy ) zDraws the given sequence of 8-bit codewords (data and error correction) onto the entire data area of this QR Code. Function modules need to be marked off before this is called.r"rrrrurvr&r!N) r:r rrOr*rPrTrrS) r]rrMrightvertrrqupwardrrs rrYzQrCode._draw_codewordsxs( Tf66t}}EJ JJ J !TZZ!^Q+  e qj QJETZZ  t 1X aiQQY!Oq(V)/tzzA~$TQ   a  #!c$i!m*;$T!q&\1A;?dmmAq1fa      c$i!m  rc Hd|cxkrdkstdtdtj|}t|jD]U}t|jD];}|j ||xx|||dk(xr|j || zcc<=Wy)agXORs the codeword modules in this QR Code with the given mask pattern. The function modules must be marked and the codeword bits must be drawn before masking. Due to the arithmetic of XOR, calling _apply_mask() with the same mask value a second time will undo the mask. A final well-formed QR Code needs exactly one (not zero, two, etc.) mask applied.rr!rVN)r)r _MASK_PATTERNSr*rPrSrT)r]rBmaskerrrrqs rrZzQrCode._apply_masks t.q. - ..  - ..$*$9$9$$?&  Pa $** PqMM!QF1aLA-O8H8H8KA8N4NOPPrcld}|j}|j}t|D]}d}d}tjdgdzd}t|D]z}||||k(r*|dz }|dk(r|t j z },|dkDs2|dz }8|j|||s%||j|t jzz }|||}d}|||j|||t jzz }t|D]}d}d} tjdgdzd}t|D]z}||||k(r*| dz } | dk(r|t j z },| dkDs2|dz }8|j| ||s%||j|t jzz }|||}d} |||j|| |t jzz }t|dz D]a}t|dz D]N}||||||dzcxk(r!||dz|cxk(r||dz|dzk(s9n<|t jz }Pctd|D} |dz} t| dz| d zz | zdz | zdz } d| cxkrd ksJJ|| t jzz }d|cxkrd ksJJ|S) zCalculates and returns the penalty score based on state of this QR Code's current modules. This is used by the automatic mask choice algorithm to find the mask pattern that yields the lowest score.rFr!rrc36K|]}|D] }|rdnd yw)rrN).0rowcells r z,QrCode._get_penalty_score..s$HCHD1!#H#Hsrvrri2')rPrSr* collectionsdequer _PENALTY_N1_finder_penalty_add_history_finder_penalty_count_patterns _PENALTY_N3#_finder_penalty_terminate_and_count _PENALTY_N2sumr _PENALTY_N4) r]rsizemodulesrrruncolorrunx runhistoryrqrunydarktotalrs rr\zQrCode._get_penalty_scores!&jj$"mm' ;ga84!!1#'1-: $K qqz!}  QYT   """f ( kf %%dJ7  33J?&BTBTTTf 1 X T  T 5 5hj QTZTfTf ff6#g& ;ga8 4!!1#'1-: $K qqz!}  QYT   """f ( kf %%dJ7  33J?&BTBTTTf 1 X T  T 5 5hj QTZTfTf ff6#g( ?"a $(O"qqz!} 1q5)WWQU^A->W'!a%.QRUVQVBWW v!!!V"" HHH$Qw% r EBJ& '% /! 3 = A! a1A"" ""& f     -rc|j}|dk(rgS|dzdz}|dk(rdn|dz|dzzdz|dzdz zdz}t|dz Dcgc]}|jdz ||zz c}dgz}tt |Scc}w)zReturns an ascending list of positions of alignment patterns for this version number. Each position is in the range [0,177), and are used on both the x and y axes. This could be implemented as lookup table of 40 variable-length lists of integers.rr!rv r#ru)rOr*rPlistreversed)r]verr}steprMrs rryz'QrCode._get_alignment_pattern_positionss]]#AX 9!8a<8Rir1Wx!|aX\A%56:=B8a<=PQa!d(2QUVTWW6 x  Rs Bctj|cxkrtjkstdtdd|zdz|zdz}|dk\r#|dzdz}|d|zdz |zd z z}|dk\r|d z}d |cxkrd ksJJ|S) a*Returns the number of data bits that can be stored in a QR Code of the given version number, after all function modules are excluded. This includes remainder bits, so it might not be a multiple of 8. The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.zVersion number out of range@rvr!r7$is)r r'r(r))rrr}s rrz QrCode._get_num_raw_data_moduless    9v'9'9 9 1 22 : 1 22cC3&+&AX!8a<8 b8mb H ,r 116 Qh bLF  %    -rctj|dztj|j|tj|j|zz S)a Returns the number of 8-bit data (i.e. not error correction) codewords contained in any QR Code of the given version number and error correction level, with remainder bits discarded. This stateless pure function could be implemented as a (40*4)-cell lookup table.r")r rrrr)rrs rr+zQrCode._get_num_data_codewordssT  ) )# .! 3 $$5c: ((5c:; ;;rcVd|cxkrdkstdtdtdg|dz zdgz}d}t|D]`}t|D]:}tj |||||<|dz|ks(||xx||dzzcc<<tj |d}b|S)zReturns a Reed-Solomon ECC generator polynomial for the given degree. This could be implemented as a lookup table over all possible parameter values, instead of as an algorithm.rzDegree out of rangerrv)r)r>r*r _reed_solomon_multiply)degreerrootr`rs rrz$QrCode._reed_solomon_compute_divisors v   ) **  ) ** aSFQJ'1#- .& $ =4a &M q--fQi>F1I1uv~ AY&Q-Y   ' 'd 34 4 -rc tdgt|z}|D][}||jdz }|jdt |D]&\}}||xxt j ||zcc<(]|S)z^Returns the Reed-Solomon error correction codeword for the given data and divisor polynomials.r)r>r:poprr?r r)rdivisorrrfactorrMcoefs rrz&QrCode._reed_solomon_compute_remainder s aS3w<' (& =aVZZ]"6 ==g&=y4 1I..tV<AD))r rrrvr#r#r#rrur"r"rrrrrrrrrrrr rrrrr*rr r 69<?BFJMQrc||zdzSNrvrrqrrs rzQrCode.q!a%1rc |dzSrrrs rr zQrCode.r Qrc |dzSNr&rrs rr zQrCode.sr#rc||zdzSr%rrs rr zQrCode.tr!rc|dz|dzzdzS)Nr&rvrrs rr zQrCode.us!q&16/Q&rc$||zdz||zdzzSNrvr&rrs rr zQrCode.vsQQUQY&rc*||zdz||zdzzdzSr)rrs rr zQrCode.ws !a%!)a!eai'1,rc*||zdz||zdzzdzSr)rrs rr zQrCode.xs 1q5A+A )Q.rz#Sequence[Callable[[int, int], int]]rcTeZdZUded<ded< d dZded<ded<ded<ded<y ) r rrrc ||_||_yN)rr)r]rMfbs rrdzQrCode.Ecc.__init__s4<4?rLOWr/r0r1N)rMrr/rreturnNone)__name__ __module__ __qualname____annotations__rdrrrr.z QrCode.Ecc~s. ,/B    rr.rrvN)rstrrr r1r )rUnion[bytes, Sequence[int]]rr r1r )rrr T)rSequence[QrSegment]rr r@rrArrBrrCrr1r ) rDrr^r rLr8r_rr1r2r1r)r1r )rqrrrrr1r)r1r2)rBrr1r2)rqrrrrr1r2)rqrrrrrrr1r2)rr>r1bytes)rr;r1r2r1 List[int]rrr1r)rrrr r1r)rrr1r;)rr;rr;r1r;)rqrrrrr1r)rcollections.dequer1r)rrrrrr?r1r)rrrr?r1r2)0r3r4r5__doc__ staticmethodrrrr6rdrgrjrmrorsrWr[r{rxrzrwrXrYrZr\ryrr+rrrrrrr'r(rrrrrrrr.r0r/r0r1rrrr r s O"++CC;3;3D     )\Q458(,LJ "J. P<B !   ;;.    P9*cccccc6h2h:^6^&&,. 62 "Aq Aq Aq Aq rr c0eZdZUdZed)dZed*dZed+dZed,dZed-dZ ed.dZ ed.d Z d e d <de d <d e d<d/dZ d0dZd1dZd2dZed3dZej&dZde d<ej&dZde d<edDcic]\}}|| c}}}Zde d<GddZedde_ed d!e_ed"d#e_ed$d%e_ed&d'e_y(cc}}}w)4rayA segment of character/binary/control data in a QR Code symbol. Instances of this class are immutable. The mid-level way to create a segment is to take the payload data and call a static factory function such as QrSegment.make_numeric(). The low-level way to create a segment is to custom-make the bit buffer and call the QrSegment() constructor with appropriate values. This segment class imposes no length restrictions, but QR Codes have restrictions. Even in the most favorable conditions, a QR Code can only hold 7089 characters of data. Any segment longer than this is meaningless for the purpose of generating QR Codes.ct}|D]}|j|dttjjt ||S)zReturns a segment representing the given binary data encoded in byte mode. All input byte lists are acceptable. Any text string can be converted to UTF-8 bytes (s.encode("UTF-8")) and encoded as a byte mode segment.r")r2r3rModeBYTEr:)rrIrs rrzQrSegment.make_bytessE |" a>>!Q 9>>&&D 2 66rcxtj|s tdt}d}|t |krSt t ||z d}|j t||||z|dzdz||z }|t |krSttjjt ||S)zZReturns a segment representing the given string of decimal digits encoded in numeric mode.z&String contains non-numeric charactersrr&r) r is_numericr)r2r:r;r3rrDNUMERIC)digitsrIrMrs r make_numericzQrSegment.make_numerics   f % < ==|" ! CK F a #1>>#fQQ'(!a%!)461 CK 9>>))3v; ;;rctj|s tdt}t dt |dz dD]I}tj ||dz}|tj ||dzz }|j|dKt |dzdkDr&|jtj |ddttjjt ||S) zReturns a segment representing the given text string encoded in alphanumeric mode. The characters allowed are: 0 to 9, A to Z (uppercase only), space, dollar, percent, asterisk, plus, hyphen, period, slash, colon.z;String contains unencodable characters in alphanumeric moderrrvrrr ru) ris_alphanumericr)r2r*r:_ALPHANUMERIC_ENCODING_TABLEr3rD ALPHANUMERIC)rrIrMtemps rmake_alphanumericzQrSegment.make_alphanumerics  " "4 ( Q RR|" CIM1 %a55d1g>C49 1 1$q1u+ >>4>>$ Y]Q>>)88bBAF 9>>..D 2 >>rc|dk(rgStj|rtj|gStj|rtj |gStj |j dgS)zReturns a new mutable list of zero or more segments to represent the given Unicode text string. The result may use various segment modes and switch modes to optimize the length of the bit stream.zUTF-8)rrGrJrLrPrencoders rrzQrSegment.make_segmentssq  RZ 9D!  ! !$ ' ((  &  & &t , --    G 4 5 66rrcnt}|dkr td|dkr|j|dn_|dkr%|jdd|j|dn5|dkr%|jd d |j|d n tdttjj d|S) zuReturns a segment representing an Extended Channel Interpretation (ECI) designator with the given assignment value.rz!ECI assignment value out of rangerr"i@rvri@Brur&r)r2r)r3rrDECI) assignvalrIs rmake_ecizQrSegment.make_ecis|"] 7 88F>>)QG>>$>>)R 7>>%>>)R 7 88 9>>%%q" --rcDtjj|duSr.)r_NUMERIC_REGEX fullmatchrTs rrGzQrSegment.is_numerics  ! ! + +D 1 ==rcDtjj|duSr.)r_ALPHANUMERIC_REGEXr[rTs rrLzQrSegment.is_alphanumerics  & & 0 0 6d BBrQrSegment.Mode_mode _numcharsr=r9c^|dkr t||_||_t||_y)zCreates a new QR Code segment with the given attributes and data. The character count (numch) must agree with the mode and the bit buffer length, but the constraint isn't checked. The given bit buffer is cloned and stored.rN)r)r_r`rr9)r]modenumchbitdatas rrdzQrSegment.__init__s, QY $*$.w-$-rc|jS)z'Returns the mode field of this segment.)r_rfs rr4zQrSegment.get_mode rkrc|jS)z2Returns the character count field of this segment.)r`rfs rr6zQrSegment.get_num_chars$s rc,t|jS)z4Returns a new copy of the data bits of this segment.)rr9rfs rget_datazQrSegment.get_data(s dmm rcd}|D]W}|jj|}|jd|zk\ry|d|zt|jzz }Y|S)zCalculates the number of bits needed to encode the given segments at the given version. Returns a non-negative number if successful. Otherwise returns None if a segment has too many characters to fit its length field.rrNr#)r4r7r6r:r9)rrDrrJccbitss rr,zQrSegment.get_total_bits.si & ,c33G<6 a6k*  QZ#cll+ ++6 , -rz[0-9]*z re.PatternrZz[A-Z0-9 $%*+./:-]*r]z-0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ $%*+-./:zDict[str, int]rMcpeZdZUdZded<ded<ddZddZddZded <ded <ded <ded <ded <y)r^z?Describes how a segment's data bits are interpreted. Immutable.r _modebitsTuple[int, int, int] _charcountsc ||_||_yr.)rlrn)r]modebits charcountss rrdzQrSegment.Mode.__init__Qs4> 4rc|jS)zrReturns an unsigned 4-bit integer value (range 0 to 15) representing the mode indicator bits for this mode object.)rlrfs rr5zQrSegment.Mode.get_mode_bitsVs ..rc,|j|dzdzS)zReturns the bit width of the character count field for a segment in this mode in a QR Code at the given version number. The result is in the range [0, 16].r!r%)rn)r]rs rr7z"QrSegment.Mode.num_char_count_bits[s   C!G? ++rrHrNrEKANJIrVN)rprrqrmr:r>)r3r4r5r@r6rdr5r7rrrrDzQrSegment.ModeJs?G .!!!  , rrDr)rrrrv)rrrr#)r"rrr")r"rrr!)rrrN)rr8r1r)rIr7r1r)rr7r1r)rr7r1zList[QrSegment])rWrr1r)rr7r1r)rbr^rcrrdz Sequence[int]r1r2)r1r^r:r<)rr9rDrr1z Optional[int])r3r4r5r@rArrJrPrrXrGrLr6rdr4r6rhr,recompilerZr]r?rMrDrHrNrErtrV)rrMchs000rrrsX77 < < ? ?  7 7..*>>CC         )bjj33$.2::.C#DjDFOO~E0A0A'1bA0A}A <#|,#|,#|,#|,#|,O0As) DrceZdZdZddZy)r2zEAn appendable sequence of bits (0s and 1s). Mainly used by QrSegment.c|dks|z dk7r td|jfdtt|Dy)zsAppends the given number of low-order bits of the given value to this buffer. Requires n >= 0 and 0 <= val < 2^n.rzValue out of rangec3.K|] }|z dzyw)rNr)rrMvals rrz)_BitBuffer.append_bits..zs ;1qA~ ;sN)r)r8rr*)r]r{rs ` rr3z_BitBuffer.append_bitsus=!eQ ( ))++ ;q(: ;;rN)r{rrrr1r2)r3r4r5r@r3rrrr2r2rs LrsP0#!!$?? r r pT-T-t<< z r