^j'$UdZddlmZddlZddlZddlmZdZded<dZ ded <d Z ded <d Z d ed<dZ ded<iZ ded<dddZ ddZddZddZddZddZddZ d ddZidddddd d!d"d#d$d%d&d'd(d)d*d+d,d-d.d/d0d1d2d3d4d5d6d7d8d9d:d;d<id=d>d?d@dAdBdCdDdEdFdGdHdIdJdKdLdMdNdOdPdQdRdSdTdUdVdWdXdYdZd[d\d]d^id_d`dadbdcdddedfdgdhdidjdkdldmdndodpdqdrdsdtdudvdwdxdydzd{d|d}d~Zded<y)z&Internal shared utilities for chardet.) annotationsN)Callablei@ intDEFAULT_MAX_BYTESiEVIDENCE_CAP_BYTESi_DECODE_CHUNK_SIZEg?floatMINIMUM_THRESHOLDi_DEFAULT_CHUNK_SIZEz3dict[str, Callable[..., codecs.IncrementalDecoder]]_INCREMENTAL_DECODERScP|tk7rtjdt|yy)zDEmit a deprecation warning if *chunk_size* differs from the default.zEchunk_size is not used in this version of chardet and will be ignored stacklevelN)r warningswarnDeprecationWarning) chunk_sizers P/var/www/html/metafoliadorv2/venv/lib/python3.12/site-packages/chardet/_utils.py_warn_deprecated_chunk_sizer.s%(( S ! )ctj|}| tj|}|t|<|S#t$rYywxYw)aaReturn a fresh incremental decoder for *encoding*, or ``None``. The class lookup is cached; ``None`` means the codec does not exist. Every decode below catches ``UnicodeError`` rather than ``UnicodeDecodeError`` because the utf-16/utf-32 incremental decoders raise a bare ``UnicodeError`` when the stream does not start with a BOM. N)r getcodecsgetincrementaldecoder LookupError)encoding decoder_classs r_incremental_decoderr8sX*--h7M "88BM+8h' ?  s> A  A c &t|tkr't|t|jd|z Sd}tdt|tD]8}|||tz}|t|t|jd|z z }:|S)aACount how many bytes of *data* a deletion *table* would remove. ``bytes.translate`` with a deletion table allocates an output buffer proportional to the input, so counting a whole large window through one call spikes memory by roughly the input size. Chunking keeps the transient bounded at one C call per chunk, and the count is identical: deletion is per-byte and carries no state across the split. :param data: The raw byte data to scan. :param table: Byte values to delete. :returns: The number of bytes of *data* present in *table*. Nr)lenr translaterange)datatablecountposchunks r count_deletedr(Ls 4y&&4y3t~~dE:;;; EQD #56@S3!334 Uc%//$">???@ Lrct|}|y t|tkr|j|dyt dt|tD]}|j|||tzd! y#t $rYywxYw)a8Return ``True`` if *data* decodes cleanly under *encoding*. Equivalent to ``data.decode(encoding, errors="strict")`` except that an incomplete multi-byte sequence at the *end* of *data* is accepted instead of raising. Detection input is nearly always a prefix of a larger whole. Callers pass the first N bytes of a file, and chardet slices further on its own. For a two-byte encoding any of those cuts lands mid-character roughly half the time. A one-shot strict decode cannot tell a truncated tail from corrupt data: it raises either way, so the candidate is discarded and every CJK encoding can disappear from the candidate set over a single dangling lead byte. An incremental decoder with ``final=False`` defers the partial tail instead, while still raising on genuine corruption anywhere before it. Large inputs are fed in chunks and the decoded text is discarded, so a whole-window check never allocates a matching ``str``. Chunking is transparent: the decoder carries its state across calls, so a sequence straddling a chunk edge decodes exactly as it would in one call. :param data: The raw byte data to test. :param encoding: Name of the codec to test *data* against. :returns: ``True`` if *data* decodes without error, ``False`` otherwise. FfinalrT)rr rdecoder" UnicodeError)r#rdecoderr&s rdecodes_without_errorr/bs6#8,G t9* * NN4uN -  QD +=> RtC#0B*BC5Q R  s%A4rsN," $!3 %C$ "C! 5"S!NPJO %(,&R.!HJK  15 CF    3#(3#,3# +3# ( 3#  ' 3#  ' 3# (3# (3# '3# )3# +3# )3# *3# '3# )3#  (!3#" '#3#$ (%3#& ('3#( *)3#* ++3#, ,-3#. +/3#0 )13#2 *33#4 (53#6 (73#8 ,93#: );3#< ,=3#> '?3#@ )A3#B 'C3#D +E3#F (G3#H ,I3#J *K3#L )M3#N (O3#P )Q3#R )S3#T )U3#V 'W3#X &Y3#Z )[3#\ +]3#^ >_3#` &a3#b ,c3#d )e3#3r