?i FdZddlmZddld d dZd d dZd d dZd d dZy) aHThe Luhn and Luhn mod N algorithms. The Luhn algorithm is used to detect most accidental errors in various identification numbers. >>> validate('7894') Traceback (most recent call last): ... InvalidChecksum: ... >>> checksum('7894') 6 >>> calc_check_digit('7894') '9' >>> validate('78949') '78949' An alternative alphabet can be provided to use the Luhn mod N algorithm. The default alphabet is '0123456789'. >>> validate('1234', alphabet='0123456789abcdef') Traceback (most recent call last): ... InvalidChecksum: ... >>> checksum('1234', alphabet='0123456789abcdef') 14 ) annotations)*cttfdtt|D}t |dddt fd|dddDzzS)zCalculate the Luhn checksum over the provided number. The checksum is returned as an int. Valid numbers should have a checksum of 0.c3@K|]}j|yw)N)index).0ialphabets R/var/www/html/myprovider/mon_projet_qr/lib/python3.12/site-packages/stdnum/luhn.py zchecksum..8s"3>>!$3sNc3NK|]}tt|dzyw)r N)sumdivmod)rr ns r r zchecksum..;s)'F1q5!$%'s"%)lentuplereversedstrr)numberr valuesrs ` @r checksumr4so H A 3$S[133F ss  '1' ' '*+ ,,ct|s t t||dk(}|s t |S#t$r twxYw)z6Check if the number provided passes the Luhn checksum.r)bool InvalidFormatr ExceptionInvalidChecksum)rr valids r validater!?sS <o*a/  M os 4AcL tt||S#t$rYywxYw)z-Check if the number passes the Luhn checksum.F)rr!ValidationError)rr s r is_validr$Ls+HVX.// s  ##cDtt||dz|}|| S)z^Calculate the extra digit that should be appended to the number to make it a valid number.r)rr)rr cks r calc_check_digitr'Ts) #f+ +X 6B RC=rN) 0123456789)rrr rreturnint)rrr rr)r)rrr rr)r)__doc__ __future__rstdnum.exceptionsrr!r$r'rr r/s&(6#, r