Hoh70UddlZddlZddlmZmZej dk(Zeed<dee de dee fdZ d e dee dee fd Z ejd Zejd ejZdeje de fd Zde de fdZy)N)MatchOptionalGraalVMIS_GRAALmidxreturnc\d|cxkr|jjkr nn ||xsdSdS)Nr)regroups)rrs k/var/www/html/wine-match-dev/backend/winematch-backend/venv/lib/python3.12/site-packages/ua_parser/utils.pygetrs) 35!$$++5AcFNd?4?replcb|sytjdfd|jxsdS)aThe replacement rules are frustratingly subtle and innimical to standard python fallback semantics: - if there is a non-null replacement pattern, then it must be used with match groups as template parameters (at indices 1+) - the result is stripped - if it is an empty string, then it's replaced by a null - otherwise fallback to a (possibly optional) match group - or null (device brand has no fallback) Replacement rules only apply to OS and Device matchers, the UA matcher has bespoke replacement semantics for the family (just $1), and no replacement for the other fields, either there is a static replacement or it falls back to the corresponding (optional) match group. Nz\$(\d)c<tt|dxsdS)N)rint)nrs r zreplacer..!ss1c!A$i'8'>Br)r substrip)rrs `r replacerr s.$  66)> E K K M UQUUrz\{(0|1)\s*,\s*\d{3,}\}z! \[[^]]*\\(d|w)[^]]*\] | \\(d|w) cd|drdnd\}}|djd|jd|S)Nr)z0-9z A-Za-z0-9_)z[0-9]z [A-Za-z0-9_]rz\dz\w)replace)rdws r class_replacerr/s7$%aD .GDAq Q4<<q ! ) )% 33rpatterncdtjd|}tjt|S)auap-core makes significant use of large bounded repetitions, to mitigate catastrophic backtracking. However this explodes the number of states (and thus graph size) for finite automaton engines, which significantly increases their memory use, and for those which use JITs it can exceed the JIT threshold and force fallback to a slower engine (seems to be the case for graal's TRegex). c|ddk(rdSdS)Nr0*+)rs r rzfa_simplifier..>sadckssr)REPETITION_PATTERNr CLASS_PATTERNr)r s r fa_simplifierr)4s*!$$%JGTG   ^W 55r)platformr typingrrpython_implementationrbool__annotations__strrrrcompiler'VERBOSEr(rr)r&rr r2s "///1Y>$>@5:@C@HSM@V3V5:V(3-V0 RZZ 9:  JJ  4bhhsm44 63 63 6r