*pjed %SrSSKJrJrJr SSKJrJr SSKJ r SSK J r SSK J r Jr SSKJr \"1Sk5r\\\S '\"1S k5r\\\S '\"1S k5r\\\S '\"1Sk5r\\\S'\"1Sk5r\\\S'\\\\S.r\\\\4\S'\"1Sk5r\\\S'\R;5VVs0sHupU\"U5_M snnr\\\4\S'\"\5r \\S'S\S\S\!4Sjr"S\S\#\ S\#\ 4Sjr$S\S\#\ S\#\ 4Sjr%Sr&S S S!S".r'\\\4\S#'S$r(S%r)S&r*S'r+S\S\4S(jr,S\S\S)S*S\!4S+jr-S\S\#\ S\#\ 4S,jr.S\#\ S-\S\#\ 4S.jr/S\S\#\ S\#\ 4S/jr0S0r1S1r2S\#\ S\#\ 4S2jr3S\S\#\ S\#\ 4S3jr4S\S\S\!4S4jr5S\S\#\ S5\!S\#\ 4S6jr6S7S8.S\S\#\ S5\!S\#\ 4S9jjr7g:s snnf);u\Stage 13: post-processing rank corrections. After statistical scoring produces a ranked list of candidates, a chain of rank corrections fixes up the ranking when bigrams alone are insufficient — see :func:`postprocess_results` for the order. The steps: dead-heat priors (superset preference, era prevalence), rare-language arbitration (ADR-0005), confusion-group resolution (delegated to :mod:`chardet.pipeline.confusion`), niche Latin demotion, KOI8-T promotion, classic-Mac line-ending promotion, and last of all the decode-safety flip, which hands a winner whose only multi-byte evidence is an undecodable trailing sequence to the best rival that can decode the caller's complete input. Note: ``from __future__ import annotations`` is intentionally omitted because this module is compiled with mypyc, which does not support PEP 563 string annotations. )dangling_tail_with_ascii_prefixdecodes_completelydecodes_without_error)RARE_LANGUAGES get_enc_index) _COMPAT_NAMES)DetectionResult)confusion_pair_winnerresolve_confusion_groups)REGISTRY>cp1252 iso8859-1 iso8859-15_COMMON_LATIN_ENCODINGS>._ISO_8859_10_DISTINGUISHING>rrrrrrrrrrrrr r!r"r$r%r&r'r(r)r*r+r3r<_ISO_8859_14_DISTINGUISHING>rBrCrDrE_WINDOWS_1254_DISTINGUISHING>r,r-r.r/r0r1r4rGrC_HP_ROMAN8_DISTINGUISHING)z iso8859-10z iso8859-14cp1254z hp-roman8_DEMOTION_CANDIDATES> rrrr"_KOI8_T_DISTINGUISHING_DEMOTION_DELETE_KOI8_T_DELETEencodingdatareturnc[RU5nUcg[URSU55[U5:H$)aXReturn True if encoding is a demotion candidate with no distinguishing bytes. Checks whether any byte in *data* falls in the set of byte values that decode differently under the given encoding vs iso-8859-1. If none do, the data is equally valid under both encodings and there is no byte-level evidence for preferring the candidate encoding. NF)rdgetlen translate)rfrgdeletes X/var/www/html/pdf-tiff/venv/lib/python3.13/site-packages/chardet/pipeline/postprocess.py_should_demoteros; ! !( +F ~ t~~dF+ ,D 99resultsc[U5S:aUSRb[USRU5(aUSRnUSRnUSSHnUR[;dM[ URX4R UR5nUVs/sHofRU:wdMXdLdMUPM nnUVs/sHofRU:XdMUPM nnU/UQUQs $ U$s snfs snf)aDemote niche Latin encodings when no distinguishing bytes are present. Some bigram models (e.g. iso-8859-10, iso-8859-14, windows-1254) can win on data that contains only bytes shared with common Western Latin encodings. When there is no byte-level evidence for the winning encoding, promote the first common Western Latin candidate to the top and push the demoted encoding to last. rN)rkrfro confidencerr language mime_type) rgrqdemoted_encodingtop_confrpromotedxothersdemoted_entriess rn_demote_niche_latinr~s G q AJ   + 71:.. 5 5"1:..1:((Azz44*JJ**akk '&!**8H*HAQZAw/6"XgGW9W1g"X <6C>C>D)DcU(aUSRS:waU$[S[U55S5nUcU$[UR S[ 55[U5:wajXnUSR n[URUURUR5n[U5VVs/sHupgXb:wdM UPM nnnU/UQ$U$s snnf)agPromote KOI8-T over KOI8-R when Tajik-specific bytes are present. KOI8-T and KOI8-R share the entire 0xC0-0xFF Cyrillic letter block, making statistical discrimination difficult. However, KOI8-T maps 12 bytes in 0x80-0xBF to Tajik-specific Cyrillic letters where KOI8-R has box-drawing characters. If any of these bytes appear, KOI8-T is the better match. rzkoi8-rc3N# UHupURS:XdMUv M g7f)zkoi8-tN)rf).0irys rn !_promote_koi8t..s!Q$6DA!**:Paa$6s% %N) rfnext enumeraterkrlrertr rurv) rgrq koi8t_idx koi8t_resultrxrzrryr|s rn_promote_koi8trs gaj))X5QIg$6QSWXI 4>>$ /0CI=) 1:(("  ! !   ! !  " "   !*' 2E 2an! 2E"6"" NFs 7 CCg-C6?cp932cp949) shift_jisshift_jis_2004euc_kr_DEAD_HEAT_SUPERSETSg{Gzt?i@cj[R"U5nUcg[UR5nX"*-$)zHReturn the lowest era bit for *encoding* (lower = more prevalent today).i@)r rjintera)rfinfors rn _era_rankrIs/ << !D | dhh-C :rpruz str | Nonecf[5RU5nU(dgUS[n[5nUSn[ S[ U55H,nXGnUS:dUS:aUR US-U-5 UnM. U(dgUH%upn UbX:waMUHn X(dM g M' g)uReturn True if *encoding*'s winning model weights a high-byte bigram present in *data*. A candidate whose model assigns zero weight to every non-ASCII bigram in the data earned its statistical score purely from ASCII bigrams — noise that cannot distinguish encodings. Only the variant that actually won (*language*) counts: another language's variant having weight for those bytes says nothing about why *this* result is on top. Only called on dead heats, so the Python-level scan of the (capped) data is off the hot path. FNrrsr[T)rrj_EVIDENCE_SCAN_MAX_BYTESsetrangerkadd) rgrfruvariantswindowseenprevrblangtable_keyidxs rn_has_high_byte_evidencerRs""8,H  ++ ,FUD !9D 1c&k " I 4<19 HHdai1_ % # %T  D$4 Czz& rpcU(aUSOSnUbURb[U5S:aU$[XRUR5(aU$Sn[ UR5n[ S[U55HYnXnURcMUR UR - [:a O$[ UR5nXt:dMUUnUnM[ US:XaU$Xn[URUR URUR5n [U5V Vs/sHupX:wdM UPM n n nU /U Q$s snn f)aKBreak statistical dead heats in favour of the more prevalent era. When several encodings score within :data:`_DEAD_HEAT_EPSILON` of the top result and the top result's models carry no weight for any high-byte bigram in the data, the ranking is an artifact of ASCII-bigram noise. Promote the candidate from the most prevalent era (modern web > legacy ISO > Mac > regional > DOS > mainframe) so evidence-free dead heats resolve to the likeliest real-world answer. A top result whose models do weight observed high-byte bigrams won on real evidence and is kept, however small its margin. rNrs) rfrkrrurrrt_DEAD_HEAT_EPSILONr rvr) rgrqtopbest_idx best_rankrryrankchosenrzjrests rn_prefer_prevalent_on_dead_heatrss- '!*TC {cll*c'lQ.>t\\3<<@@H#,,'I 1c'l # J ::   >>ALL (+= = $  IH$1}  F&:J:JH$G, >,$! A,D >  t  ?s 0 E ?E rcXn[URUSRURUR5n[ U5VVs/sHupEXA:wdM UPM nnnU/UQ$s snnf)zDMove ``results[i]`` to the top, carrying the current top confidence.r)r rfrtrurvr)rqrryrzrr{rs rn_promote_to_toprsh A GAJ))1::q{{H$G, 7,$!A,D 7  t  8s A)A)cU(aUSOSnUbURb[U5S:aU$[RUR5nUcU$[ S[U55HZnXnUR UR - [ :a U$URU:XdM=[X5(dMO[X5s $ U$)zAPromote a Windows superset over its base encoding on a dead heat.rNrrs) rfrkrrjrrtrrr)rgrqrsupersetrrys rn_promote_superset_on_dead_heatrs  '!*TC {cll*c'lQ.>#'' 5H 1c'l # J >>ALL (+= =  N :: !&;D&K&K"7. . $ Nrpg{Gz?g333333?cU(aUSOSnUbDURb7UR[;d#UR[:d[ U5S:aU$[ S[ U55HhnXnURUR- [:a U$URb URcMGUR[;dM][X5s $ U$)aDemote a rare-language winner that leads a prevalent rival by a coin flip. Fires only when the winner's language is in :data:`~chardet.models.RARE_LANGUAGES`, its absolute confidence is inside the evidence-free zone, and a prevalent-language candidate sits within :data:`_RARE_ARBITRATION_MARGIN`. Genuine rare-language text fails both gates: even short files score confidently, and their entire neighborhood is same-language variants. rNrrs) rfrurrt _RARE_ARBITRATION_MAX_CONFIDENCErkr_RARE_ARBITRATION_MARGINr)rqrrrys rn_arbitrate_rare_languagers '!*TC <<  <<~ - >>= = w>ALL (+C C  N :: !3  ::^ +"7. .$ NrpcU(aUSOSnUbURb[U5S:aU$[UR5[:XaU$URS:XaU$UR S5S:dUR S5[:aU$[S[U55HnXnURUR- [:a U$URcM:[UR5[:XdMY[SURUR455n[XRURU5UR:Xa U$[X5s $ U$) u.Promote a classic-Mac candidate when line endings are bare ``\r``. Classic Mac OS is the only platform that terminated lines with a lone carriage return, so data with several ``\r`` bytes and no ``\n`` is near-certainly Mac-era text. When a LEGACY_MAC candidate scores within :data:`_CR_MAC_BAND` of a non-Mac top result, promote it — unless the pair has a distinguishing-byte map and the byte-level evidence says the current top wins: a platform prior must not overturn direct evidence that confusion resolution may have just used to establish the top. rNrzxx  rsc3.# UH ocMUv M g7f)N)rrs rnr2_promote_mac_on_cr_line_endings..s!;!;s )rfrkr_LEGACY_MAC_ERArufindcount_CR_MAC_MIN_LINESrrt _CR_MAC_BAND frozensetr r)rgrqrrrylangss rn_promote_mac_on_cr_line_endingsrs< '!*TC {cll*c'lQ.>/1  ||u yy1 5 14E E 1c'l # J >>ALL (< 7 " N! :: !i &;&N"%,, !;E&dLL!**eL<<  N#7. .'$( Nrpc|[X5(dg[R"U5nUSL=(d [X5$)aLCheck that *data* decodes completely under *encoding* and its output name. The flip's promise is that the caller's ``data.decode(result)`` works, and the caller sees the *public* name: ``compat_names=True`` (the default) can remap to a strictly narrower codec (``euc_jis_2004`` is reported as ``EUC-JP``), so a rival must decode under both names to be promoted. ``prefer_superset=True`` can also narrow (cp125x leaves codepoints undefined that iso-8859-x maps), but that is an opt-in output transform applied to every detection, not only promoted ones, and is out of this step's hands. FN)rrrj)rgrfdisplays rn_decodes_under_public_namesr&s7 d - -)G d? ?0??rpinput_truncatedcU(aUSOSnU(dSUbPURbC[U5S:d4[SUSS55(a[XR5(dU$[ S[U55H;nXnURb[ XR5(dM0[ X5s $ U$)aPromote a strictly decoding rival over a winner with no real evidence. Byte-validity filtering runs incremental decoders with ``final=False``, tolerating an incomplete multi-byte sequence at the end because detection input is often a prefix of a larger whole. When chardet examined the caller's *entire* input, that tolerance can hand back an encoding the caller's very next ``data.decode()`` will reject --- a four-byte ``iso-8859-1`` word ending in ``0xE1`` detected as utf-8 (issue #380). Fires only when the input was not truncated by chardet itself (the orchestrator's ``max_bytes`` slice or ``UniversalDetector``'s buffer cap --- either way these bytes are not the whole story and the caller was told so by *input_truncated*), the tail can actually hold a dangling sequence (a high byte in the final four, multi-byte winner), and the winner's tolerant decode is **non-empty pure ASCII** --- its only multi-byte evidence is the dangling tail itself. An empty tolerant decode (the whole input is one clipped sequence) is zero evidence, not ASCII evidence, and disqualifies the flip. The best-ranked rival that decodes the input completely under both its internal and public names then takes the top slot, regardless of the confidence gap: an all-ASCII-evidence winner detected nothing the rival did not also detect, and any statistical lead it holds comes from ASCII bigrams the rival matched equally well. The scan sees the ranking as given, which under ``full_ranking=False`` is pruned; if no listed rival decodes, the winner stands (measured across a 648-case accent-final sweep, the pruned ranking always carried a decodable rival). The pure-ASCII condition is what makes the unconditional flip safe. A short mid-character CJK cut has a correct answer that cannot decode the input --- flipping it to whichever single-byte codec happens to decode the bytes trades a right answer for a wrong one, and a 5-40 byte sweep measured exactly that under a gap-based rule (34 correct CJK answers lost, Big5 becoming cp1125). Such a winner has decoded real multi-byte characters and keeps its ranking; with the pure-ASCII condition in place, the same sweep measures zero lost answers at any gap. rNrc3*# UH oS:v M g7f)r[Nr)rrs rnr+_prefer_decodable_on_tie..ps0i9isrs)rfrkanyrrrr)rgrqrrrrys rn_prefer_decodable_on_tier8sV '!*TC ; <<  wrs$ 9.,&+4+3/8/1/Ys^1n/8 "/Ys^"T09(0in-6-9S>B.-** 3d3 #./*3L* #/C.H.H.J&.J]SCx.J&$sEz"455 :S : :$ :  / " /@  / " /J(d38n  !%3,SWB' ' / "' /'TT/2stO?T  / " /J  $(  / " /@/ / / "/ //d@e@s@t@$A A / "A A  / AP" T T / "T T  / TW &sG