=wg&ddlmZddlmZddlmZddlmZGddejZGddeZ Gd d eZ y ) )division)array)xrange)mcorec2eZdZddZdZdZdZdZdZy) CombinationMatcherc ||_||_yN) _submatchers_boost)self submatchersboosts L/var/www/horilla/myenv/lib/python3.12/site-packages/whoosh/matching/combo.py__init__zCombinationMatcher.__init__$s' c:td|jDS)Nc3<K|]}|jywr )supports_block_quality.0ms r z.)sI!1++-Iallr r s rrz)CombinationMatcher.supports_block_quality(sIt7H7HIIIrcTtd|jD|jzS)Nc3\K|]$}|jr|j&ywr ) is_active max_qualityrs rrz1CombinationMatcher.max_quality..,s&%qkkm==?%s*,)maxr r rs rr!zCombinationMatcher.max_quality+s-%D,=,=%%'+{{3 3rc@tfd|jDS)Nc3@K|]}|jywr )supports)rrastypes rrz.CombinationMatcher.supports..0sA!1::f%Asrr r&s `rr%zCombinationMatcher.supports/sAt/@/@AAArc,t|jSr )iterr rs rchildrenzCombinationMatcher.children2sD%%&&rcTtd|jD|jzS)Nc3<K|]}|jywr )scorers rrz+CombinationMatcher.score..6s817798r)sumr r rs rr-zCombinationMatcher.score5s"8d&7&7884;;FFrN)?) __name__ __module__ __qualname__rrr!r%r*r-rrrr#s#J3B'GrrcTeZdZdZddZdZdZdZdZdZ dZ d Z d Z d Z d Zy )PreloadedUnionMatcheraInstead of marching the sub-matchers along in parallel, this matcher pre-reads the scores for EVERY MATCHING DOCUMENT, trading memory for speed. This is faster than the implementation using a binary tree of :class:`~whoosh.matching.binary.UnionMatcher` objects (possibly just because of less overhead), but it doesn't allow getting information about the "current" document other than the score, because there isn't really a current document, just an array of scores. c tj|||||_td}|jDcgc]}|j s|}}|rt d|Dx}|_|D]} | j s|r| j|z} n|} | j} | |z } t|| kr0|jdt| t|z dzD|| xx| z cc<| j| j r||_||_||_yd|_d|_||_ycc}w)Nrdc3<K|]}|jywr idrs rrz1PreloadedUnionMatcher.__init__..Ms'?1'?rc3 K|]}dywrNr3r_s rrz1PreloadedUnionMatcher.__init__..Xs Gq G r)rr _doccountrr r min_docnumr-r;lenextendrnext_a_offset) r rdoccountrscoredasubmactiveoffsetrr-docnumplaces rrzPreloadedUnionMatcher.__init__Es.##D+U#C! #J#'#4#4I48H$II $''?'?$? ?FT\ kkm ! E 1 %TTVF"VOE1v GF53q6>A3E,F GGeH%HFFHkkm DG!DLDLDL+Js E E c`|j|jz t|jkSr )rDrIrErHrs rr zPreloadedUnionMatcher.is_activebs"||dll*S\99rc|jSr rDrs rr;zPreloadedUnionMatcher.ide ||rcN|j|j|jz Sr rHrDrIrs rr-zPreloadedUnionMatcher.scorehwwt||dll233rc|j}|j}|j|z }|dz }|t|kr$||dk(r|dz }|t|kr ||dk(r||z|_y)NrArrHrIrDrEr rLrOrQs rrGzPreloadedUnionMatcher.nextksk GG v%  c!fn5Q QJEc!fn5Qv~ rc`t|j|j|jz dSr )r"rHrDrIrs rr!z!PreloadedUnionMatcher.max_qualityus&4774<<$,,67899rc"|jSr r!rs r block_qualityz#PreloadedUnionMatcher.block_qualityxs!!rc||jkry||_||jz }|t|jkr$|j|dk(r|j yyy)Nr)rDrIrErHrG)r rPis rskip_tozPreloadedUnionMatcher.skip_to{sU DLL  T\\ ! s477|  a IIK!0 rc|j}|j}|j|z }d}|t|kr&|||kr|dz }d}|t|kr |||kr||z|_|SNrrArZ)r minqualityrLrOrQskippeds rskip_to_qualityz%PreloadedUnionMatcher.skip_to_qualitysu GG v%c!fn5Z!7 QJEGc!fn5Z!7v~ rcyNFr3r's rr%zPreloadedUnionMatcher.supportsrc#K|j}|j}|j|z }|t|kr$||dkDr||z|dz }|t|kr#yywrdrZr[s rall_idszPreloadedUnionMatcher.all_idss\ GG v%c!fnx!|fn$ QJEc!fns AAAN)r/T)r0r1r2__doc__rr r;r-rGr!r_rbrgr%rlr3rrr5r59s> ::4&:" rr5cpeZdZdZ ddZdZdZdZdZdZ dZ d Z d Z d Z d Zd ZdZdZdZy)ArrayUnionMatcheraInstead of marching the sub-matchers along in parallel, this matcher pre-reads the scores for a large block of documents at a time from each matcher, accumulating the scores in an array. This is faster than the implementation using a binary tree of :class:`~whoosh.matching.binary.UnionMatcher` objects (possibly just because of less overhead), but it doesn't allow getting information about the "current" document other than the score, because there isn't really a current document, just an array of scores. ctj|||||_||_|s|}||_t ddt |jD|_|j|_ |jy)Nr7r8c3 K|]}dywr=r3r>s rrz-ArrayUnionMatcher.__init__..s@Aa@r@) rr_scoredrB _partsizerrrH_min_idrD _read_part)r rrJrrKpartsizes rrzArrayUnionMatcher.__init__sh##D+U#C !H!@)?@A||~  rcd|jj|j|j|j|j fzS)Nz(%s(%r, boost=%f, scored=%r, partsize=%d)) __class__r0r r rrrsrs r__repr__zArrayUnionMatcher.__repr__s<:>>**D,=,=t{{<<11 2rc|jDcgc]}|js|}}|rtd|DS|jScc}w)Nc3<K|]}|jywr r:rrMs rrz,ArrayUnionMatcher._min_id..s4Ttwwy4r)r r rCrB)r rMrNs rrtzArrayUnionMatcher._min_idsH#'#4#4I48H$II 4V44 4>> ! Js A A c`|j}|j}t|j|jz|j }|j}|j }t|jD]}d||< |jD]}|js|j|ks(|j|z }|r||xx|j|zz cc<nd||<|j|js|j|krn||_ ||_yrd)rrr rCrDrsrBrHrr r r;r-rGrI_limit)r rKrlimitrOrLrars rruzArrayUnionMatcher._read_parts DLL4>>14>>B GG' AAaD "" A++-ADDFUNDDFVOaDAGGI--DAaD ++-ADDFUN   rc|j}|j}|j}|j}||kr|||z dkDrn |dz }||kr||k(r&|j |_|j y||_yrd)rHrDrIr~rtru)r rLrPrOrs r _find_nextzArrayUnionMatcher._find_nextsz GG un&!A% aKFun U?<<>DL OO !DLrcyrir3r's rr%zArrayUnionMatcher.supportsrjrc4|j|jkSr )rDrBrs rr zArrayUnionMatcher.is_actives||dnn,,rc:td|jDS)Nc3<K|]}|jywr r^rs rrz0ArrayUnionMatcher.max_quality..s>q1==?>r)r"r rs rr!zArrayUnionMatcher.max_qualitys>D,=,=>>>rc,t|jSr )r"rHrs rr_zArrayUnionMatcher.block_qualitys477|rcr||jkry||jkr||_|jy|j}d}|D]$}|j s|j |&td|Dr&|j|_|jy|j|_y)NFc3<K|]}|jywr )r r|s rrz,ArrayUnionMatcher.skip_to.. s8Dt~~8r) rIr~rDrr r rbanyrtrurB)r rPrrNrMs rrbzArrayUnionMatcher.skip_tos DLL  dkk !!DL OO  ''  %D~~ V$ % 8K8 8<<>DL OO >>DLrc$d}|jr]|j|krJ|dz }|j|_|j |jr|j|krJ|jr|j |Srd)r r_r~rDrur)r rerfs rrgz!ArrayUnionMatcher.skip_to_qualitysvnn4#5#5#7:#E qLG;;DL OO nn4#5#5#7:#E >>  OO rc|jSr rTrs rr;zArrayUnionMatcher.idrUrc#,K|j}|j}|j}|j}|j}||krO|||z dkDr||dz }||k(r/||_|j |j}|j}||krNyywrd)rBrDrIr~rHru)r rJrPrOrrLs rrlzArrayUnionMatcher.all_ids!s>>  GGx&!A% aKF% ! xs BBBcL|xjdz c_|jS)NrA)rDrrs rrGzArrayUnionMatcher.next3s    rcN|j|j|jz Sr rWrs rr-zArrayUnionMatcher.score7rXrN)r/Ti)r0r1r2rmrryrtrurr%r r!r_rbrgr;rlrGr-r3rrroros\ AE 2 "0""-?*0$$!4rroN) __future__rr whoosh.compatrwhoosh.matchingrMatcherrr5ror3rrrsD8  !GG,d.dNX4*X4r