Wja'dZddlZddlZddlZddlZddlmZddlmZddl m Z ddl m Z ddl Z ddlZddlmZddlmZmZmZmZmZdd lmZmZmZmZmZdd lmZmZmZm Z m!Z!dd lm"Z"ed d Z#edd Z$dddZ%GddZ&e&e#Z'e&e$Z(ej)Z*ej+Z,dej-zej.zej/zZ0dZ1dej2zej3zej4zej/zZ5e6ej7Z8dZ9dZ:dZ;dedZ?ddZ@GddeAZBgdZCgd ZDeBdZEd!ZFd!ZGd!ZHd"ZId!ZJd!ZKd#ZLd$ZMe d%d&d'd(ZNd)d*d+d,d-d.d.d/ZOdePfd0ZQGd1d2ZRGd3d4ZSGd5d6ZTd7ePdePfd8ZUejVeSjWjXYZZejVeTjXYZ[d7ePdeRfd9Z\d7ePde]fd:Z^eJfd;ePde]fd<Z_dd7ePdePfd=Z`d>ZadePfd?ZbdePfd@ZcdePfdAZd ddePfdBZeddePfdCZfdegfdDZhdePfdEZidFe]fdGZjdHe]dePfdIZkeFeFfdJZldKe]fdLZmeGfdMe]fdNZndOZodegfdPZpdegfdQZqdRZrdSZseIfdTetfdUZudVZveHfdTetfdWZwddegfdXZxdYZydZZzdePfd[Z{Gd\d]Z|Gd^d_e|Z}Gd`daZ~dbZeZGdcddZe GdedfZGdgdhZ ddiZdjZdkZddlZdmZdnZdoZdpZdddqdrZdsZdtZduZdvZdwZdxZdyZddzdzddeFddeGddd!eHeId!ddd!d!d!ddddd{dddfd|e]d}e]d~ePdePdeAdeAdeAdeAdeAdeAdeAdeAdeAdeAdeAdeAde Alternative licensing terms are available from the licensor. For commercial licensing, see or contact Artifex Software, Inc., 39 Mesa Street, Suite 108A, San Francisco, CA 94129, USA, for further information. --------------------------------------------------------------------- Portions of this code have been ported from pdfplumber, see https://pypi.org/project/pdfplumber/. The ported code is under the following MIT license: --------------------------------------------------------------------- The MIT License (MIT) Copyright (c) 2015, Jeremy Singer-Vine Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. --------------------------------------------------------------------- Also see here: https://github.com/jsvine/pdfplumber/blob/stable/LICENSE.txt --------------------------------------------------------------------- The porting mainly pertains to files "table.py" and relevant parts of "utils/text.py" within pdfplumber's repository on Github. With respect to "text.py", we have removed functions or features that are not used by table processing. Examples are: * the text search function * simple text extraction * text extraction by lines Original pdfplumber code does neither detect, nor identify table headers. This PyMuPDF port adds respective code to the 'Table' class as method '_get_header'. This is implemented as new class TableHeader with the properties: * bbox: A tuple for the header's bbox * cells: A tuple for each bbox of a column header * names: A list of strings with column header text * external: A bool indicating whether the header is outside the table cells. N)Sequence) ContextVar) dataclass) itemgetter)mupdf)refine_grid_structurerefine_grid_rows_refine_cells_to_grid_refine_grid_to_cells_refine_page_words) resolve_spansSpanCell_span_select_words_in_rect_span_word_line_tuple_span_words_to_line_text) HeaderRegionextend_header_leaf_labelsfind_header_regioncollapse_cell_wsrender_table_html) refine_gridpymupdf_table_edgesdefaultpymupdf_table_charsFnativect|dd}||}n1|s'|||d}|s|Sd|DS)aThe page's vector drawings, shared within one find_tables() call. One call reads them up to ``1 + 2T`` times -- once to build edges, and once per refined table for shaded rows and for border lines -- and each read walks the whole content stream. find_tables() therefore puts an empty cache on the page for the duration of the call and removes it again, so nothing outlives the call: a page whose content stream is rewritten between calls cannot be served a stale extraction. Calling the public refine helpers directly, with no find_tables() around them, extracts afresh exactly as before. ``native=True`` returns per-path copies of the mutated members: make_edges extends path rects, normalizes rectangle items and appends a closing line, so the other consumers must not see its edits. Point and Quad values stay shared because make_edges only reads them. _table_drawings_cacheNrc g|]<}t|tj|dd|dD=S)rectcg|]=}|ddkr-|dtj|dg|ddRn|>S)rreNpymupdfRect).0items /Users/tedpeters/Documents/Projects/Claude Projects/TPC Houses/house-viewer/.venv/lib/python3.11/site-packages/pymupdf/table.py z2_get_table_drawings...sc@DAw$a',tAw//;$qrr(;;;TXitems)r!r.)dictr'r()r)paths r+r,z'_get_table_drawings..sm     d6l++ M      r-)getattr get_drawingsappend)pagercachepathss r+_get_table_drawingsr7s D14 8 8E }!!## . LL**,, - - -a        r-cNeZdZdZdZdZdZdZdZdZ dZ d Z d Z d Z d S) _TableStateListz4List-like proxy for per-call table extraction state.c||_dSN)_var)selfvars r+__init__z_TableStateList.__init__s  r-ct|j}|g}|j||Sr;)r<getsetr=values r+_listz_TableStateList._lists4  =E IMM%  r-cP||Sr;)rEr3r=r*s r+r3z_TableStateList.appendszz||""4(((r-cN|Sr;)rEclearr=s r+rIz_TableStateList.clearszz||!!###r-cP||Sr;)rEextend)r=r.s r+rLz_TableStateList.extendszz||""5)))r-cDt|Sr;)boolrErJs r+__bool__z_TableStateList.__bool__DJJLL!!!r-c6||Sr;rErGs r+ __getitem__z_TableStateList.__getitem__szz||D!!r-cDt|Sr;)iterrErJs r+__iter__z_TableStateList.__iter__rPr-cDt|Sr;)lenrErJs r+__len__z_TableStateList.__len__s4::<<   r-c4|||<dSr;rR)r=keyrDs r+ __setitem__z_TableStateList.__setitem__s! Sr-N)__name__ __module__ __qualname____doc__r?rEr3rIrLrOrSrVrYr\r-r+r9r9s>>)))$$$***"""""""""!!!"""""r-r9cvtjr tjrttjzStSr;)r'_layout_available_layout_enabledFLAGSTEXT_ACCURATE_BBOXESrar-r+textpage_flagsrgs0 ""4w'>4w333 Lr-c |d|dko5|d|dko#|d|dko|d|dkS)zBCheck whether rectangle 'inner' is fully inside rectangle 'outer'.r$rr%ra)innerouters r+ rect_in_rectrls_ ! !Ha  ! !Ha  ! !Ha  ! !Ha r-c:tfd|DS)zCCheck whether any of the chars in CHAR are inside rectangle 'rect'.c3K|]M} d|dko5|ddko#d|dkod|dkVNdS) r$rx0x1r%y0riy1Nra)r)cr!s r+ z chars_in_rect..s    Gqw   dGtAw   Gqw   Gqw  r-any)CHARSr!s `r+ chars_in_rectrxs=     r-c tdt|d|dt|d|dz }tdt|d|dt|d|dz }||z}|sdS|d|dz |d|dz z}|d|dz |d|dz z}|||z|z z S)z2Compute intersection over union of two rectangles.rr%rir$maxmin)r1r2ixiy intersectionarea1area2s r+_iours QBqE2a5!!C1r!u$5$55 6 6B QBqE2a5!!C1r!u$5$55 6 6B7L q URU]r!ur!u} -E URU]r!ur!u} -E 55=<7 88r-returnc>tfd|DS)zUCheck whether any of the words in bbox are cut through by horizontal line y. c3lK|].}t||jcxko |jkncV/dSr;)rlrqrr)r)rbboxys r+rtz%intersects_words_h..sJLL1l1d6K6KLqta!$LLLLLLr-ru)rr word_rectss`` r+intersects_words_hr s, LLLLL LLL L LLr-c`i}tj|jj|||S)zAExtract MuPDF table structure information from a given rectangle.)r'extramake_table_dictthis m_internal)textpager! table_dicts r+get_table_dict_from_rectrs,J M!!(-":JMMM r-c g}t||}|dtjkr|St j|d}t |dd}t |dd}|d\}g} |D]J\} } | d kr t|| |r| r| | d z d kr| | d <5| | Ktd tt| d z d zfd|D} |j | d d zkr| |j tt| dz D]} t j|j| | |j | | dzt fd|Ddfd| D}tt|dz D]`}t j||| | ||dz| | dz}|js"|t!|a|S)z0Detect table structure within a given rectangle.typerxposc|dSNrraxs r+z&make_table_from_bbox..$ qtr-r[yposc|dSrra)rs r+rz&make_table_from_bbox..%rr- max_uncertainrrir%gffffff?c8g|]}|dk|dSr$rra)r)rymaxus r+r,z(make_table_from_bbox..>s& 1 1 1a1Q45==QqT===r-r$c4g|]}t||Srarl)r)rrow_boxs r+r,z(make_table_from_bbox..Gs( ? ? ?1l1g&>&> ?Q ? ? ?r-c|jSr;)rors r+rz&make_table_from_bbox..Gsqtr-cLg|]tfdD S)c3LK|]}|jcxko |jkncVdSr;rorp)r)rrs r+rtz2make_table_from_bbox...Js;0T0TQAD0T0T0T0T0T0Tr-ru)r)r row_wordss @r+r,z(make_table_from_bbox..Js<UUU1S0T0T0T0T)0T0T0T-T-TUQUUUr-)rrArFZ_STEXT_BLOCK_GRIDr'r(sortedrr3r{roundrXrprangerois_emptytuple)rrr!cellsblockrrrxmaxunyposryuncnxposi this_xposjcellrrrs @@@r+make_table_from_bboxrs E %Xt 4 4E yyE555 <f & &D %-^^ 4 4 4D %-^^ 4 4 4D)LE5 E4 !88  dAz 2 2    a%)ma''E"II LLOOOO 5#e**q.D011 2 2E 2 1 1 14 1 1 1E wrQ TW3u::> " " * *,twa$'5Q<HH ? ? ? ? ? ? ?^^   VUUUUUU s9~~)** * *A< ! eAh !a%8H%PQTUPU,WWD= * U4[[))) * Lr-c d}|dD]}|ddkr|d} |d|dks6|d|dks$|d|dks|d|dkrc|d D]Q}|d} |d|dks6|d|dks$|d|dks|d|dkrV|r ||rd nd z }|d d kp |d dk}|dD]} | d} | d|dks6| d|dks$| d|dks| d|dkrVd} | dD]^} | d} tj| d}t||zdt|zkr| | z } P| tvr| dz } _| s|s|| z }d}d}|r| dt zr |dz }d|z}| dt zr |dz }d|z}| dtjzr |dz }d|z}| dtjzr |dz }d|z}t| ddkr| } t|x}r(| |r|d| | z|z}| s|dz }||| z|zz }АS| S)aEExtract text from a rect-like 'cell' as plain or MD styled text. This function should ultimately be used to extract text from a table cell. Markdown output will only work correctly if extraction flag bit TEXT_COLLECT_STYLES is set. Args: textpage: A PyMuPDF TextPage object. Must have been created with TEXTFLAGS_TEXT | TEXT_COLLECT_STYLES. cell: A tuple (x0, y0, x1, y1) defining the cell's bbox. markdown: If True, return text formatted for Markdown. Returns: A string with the text extracted from the cell. blocksrrrr%r$rilines
 dir)rr$rspanscharsrsg? char_flagsz~~z**flags_`N) extractRAWDICTr'r(abs white_spacesTEXT_STRIKEOUT TEXT_BOLDTEXT_FONT_ITALICTEXT_FONT_MONOSPACEDrXrstripendswithstrip)rrmarkdowntextr block_bboxlinelbbox horizontalspansbbox span_textchar this_charrprefixsuffixlss r+ extract_cellsrSs D((**84R<R< =A   6]  !}tAw&&!}tAw&&!}tAw&&!}tAw&& 'NF <F . s<<chars. rNc||_dSr;)rrs r+r?zWordMap.__init__#s  r-FrTlayoutlayout_width_charslayout_height_chars use_text_flow presortedexpand_ligaturescg}t|jst|S| rtni}|rm|r|rt dnt t ||z }|r|rt dnt t ||z }dg|z}ng}d}| s| r|jnt|jd}|dd}|d|dz }tt|d | D]p\}}|r|ddd|| zz |z nd}tt |dkt ||z }t|D]=}t|r|d dd kr||z }| d >||z }d}| s| r|nt|d }|D]\}}|r|d|z |z nd}ttd|t ||z }|dg|zz }||z }|D]E}||d|d} | D]}!| |!|f|dz }F|r |dg||z zz }r|rP||dzz }"t|"D]"}|dkr||z }| d #|d d kr |dd }t|S)a Given a list of (word, chars) tuples (i.e., a WordMap), return a list of (char-text, char) tuples (i.e., a TextMap) that can be used to mimic the structural layout of the text on the page(s), using the following approach: - Sort the words by (doctop, x0) if not already sorted. - Calculate the initial doctop for the starting page. - Cluster the words by doctop (taking `y_tolerance` into account), and iterate through them. - For each cluster, calculate the distance between that doctop and the initial doctop, in points, minus `y_shift`. Divide that distance by `y_density` to calculate the minimum number of newlines that should come before this cluster. Append that number of newlines *minus* the number of newlines already appended, with a minimum of one. - Then for each cluster, iterate through each word in it. Divide each word's x0, minus `x_shift`, by `x_density` to calculate the minimum number of characters that should come before this cluster. Append that number of spaces *minus* the number of characters and spaces already appended, with a minimum of one. Then append the word's text. - At the termination of each line, add more spaces if necessary to mimic `layout_width`. - Finally, add newlines to the end if necessary to mimic to `layout_height`. Note: This approach currently works best for horizontal, left-to-right text, but will display all words regardless of orientation. There is room for improvement in better supporting right-to-left text, as well as vertical text. z;`layout_width` and `layout_width_chars` cannot both be set.z=`layout_height` and `layout_height_chars` cannot both be set.)rNrc8t|ddSNrdoctopfloatrs r+rz$WordMap.to_textmap..zs51h3H3Hr-rr0rc8t|ddSr/r1rs r+rz$WordMap.to_textmap..suQqT(^/D/Dr-rr)rNc8t|ddS)Nrror1rs r+rz$WordMap.to_textmap..seAaDJ.?.?r-ror$rN)rXrr  LIGATURES ValueErrorr#rr enumeratecluster_objectsr{rr3r|rA)#r=r' layout_width layout_heightr(r) x_density y_densityx_shifty_shift y_tolerancer*r+r,_textmap expansions blank_line num_newlineswords_sorted_doctop first_word doctop_startrwsy_distnum_newlines_prependline_lenline_words_sorted_x0wordrx_distnum_spaces_prependrslettersletternum_newlines_appends# r+ to_textmapzWordMap.to_textmap&sf4; %8$$ $"2:YY  ! J$U &)|i/G)H)H%I%I"" L $W '*% 0I*J*J&K&K#%);;JJJ  J) JDKK )H)HIII  )+A. !(+j.??  #%D%Dk    . L. LEArAq(#|g'=>)KK  $'AE f , $$ /00 . .8}}+ Q4(?(? *H ---- 0 0LHA -AB$?$?@@@ ! 4 & & e?EL$t*w.);;1%(Q)9)95==8;S%T%T"[M,>>>..&&A(nnQvY& BBG")&&  444 A && L[M-?(-JKK  )"59I"J .// . .q55 *H ----||++#CRC=x   r-r") r]r^r_r`r?DEFAULT_X_DENSITYDEFAULT_Y_DENSITYDEFAULT_Y_TOLERANCErNr#r rRrar-r+r%r%s "##$##'#!%V!V!V!  V! ! V!V!V!V! V!V!V!V!V!V!r-r%c teZdZeedddddddf defdZdefdZdefd Z d Z d Z d Z de fd ZdedefdZdS) WordExtractorFTNkeep_blank_charsc ||_||_||_||_||_||_|gn||_|dur tjn|pd|_ | rtni|_ dS)NTr) x_tolerancer?rXr*horizontal_ltr vertical_ttb extra_attrsstring punctuationsplit_at_punctuationr5rA) r=rZr?rXr*r[r\r]r`r,s r+r?zWordExtractor.__init__s'& 0*,(!,!422+ $t++   &," ! (8?))Rr- ordered_charsc t|\}}}}|dd|ddz }|dd}|rjr njrdnd}|dd} d} |s| ddkrt|}d} | ddkr| d dkrd } n| ddkrd } d fd |D|||||z|||| d } jD]} |d| | | <| S)Nrr0ruprightr$rmatrixriZrc3fK|]+}j|d|dV,dSrN)rArA)r)rsr=s r+rtz,WordExtractor.merge_chars..sN>?##AfIqy99r-) rrorprr0rrc directionrotation)rr[r\reversedrr]) r=rarorrpr doctop_adjrcrjrdrkrLr[s ` r+ merge_charszWordExtractor.merge_charssf-m<<CV"1%h/-2B52II "9-18X$-XXd>OXAAVX q!(+ 6!9q==$]33MH !9q==VAY]]HH AY]]HGGCPJ&"    # . .C%a(-DII r-rc|drZ|j}|j}|d}|d}|jr|d}|d}|d} nu|d }|d }|d } nY|j}|j}|d}|d}|jr|d}|d}|d} n|d }|d }|d } t | |kp| ||zkp|||zkS)aThis method takes several factors into account to determine if `curr_char` represents the beginning of a new word: - Whether the text is "upright" (i.e., non-rotated) - Whether the user has specified that horizontal text runs left-to-right (default) or right-to-left, as represented by self.horizontal_ltr - Whether the user has specified that vertical text the text runs top-to-bottom (default) or bottom-to-top, as represented by self.vertical_ttb - The x0, top, x1, and bottom attributes of prev_char and curr_char - The self.x_tolerance and self.y_tolerance settings. Note: In this case, x/y refer to those directions for non-rotated text. For vertical text, they are flipped. A more accurate terminology might be "*intra*line character distance tolerance" and "*inter*line character distance tolerance" An important note: The *intra*line distance is measured from the *end* of the previous character to the *beginning* of the current character, while the *inter*line distance is measured from the *top* of the previous character to the *top* of the next character. The reasons for this are partly repository-historical, and partly logical, as successive text lines' bounding boxes often overlap slightly (and we don't want that overlap to be interpreted as the two lines being the same line). The upright-ness of the character determines the attributes to compare, while horizontal_ltr/vertical_ttb determine the direction of the comparison. rcrrorpr)rZr?r[r\rN) r= prev_char curr_charrraycyaxbxcxs r+char_begins_new_wordz"WordExtractor.char_begins_new_words5N Y  * A A5!B5!B" &t_t_t_o%o%o% A A4B4B  *u%x(u%))&&)) "W R!V  R!V    r-c#Kgdfd }|D]}|d}|js&|r|dEd{V7||jvr#||Ed{V|dEd{Vcr.|d|r||Ed{V|rVdSdS)Nc3&KrV|gn|gdSr;ra)new_char current_words r+start_next_wordz:WordExtractor.iter_chars_to_words..start_next_wordPs1 #""""!)!122zLLLr-rrr;)rXisspacer`rwr3)r=rar|rrr{s @r+iter_chars_to_wordsz!WordExtractor.iter_chars_to_wordsMsf  B B B B B B" * *D.upright_keyms) %%% %r-rrcr0ror) r#r8rrr?rr[r\rl) r=rrupright_clusterrc cluster_key subclustersscsort_keyto_yields r+iter_sort_charszWordExtractor.iter_sort_charsls- &c & & & & /tE{{KKK ( (O%a(3G&-7((4K*K!8!8$:JK" ( (#*844!"*X*>*>???07(+((D??? !)-FF #0 A A GZ"66zBB A A '' 33Z@@@@@ A A Ar-c`tt||Sr;)r%rr)r=rs r+extract_wordmapzWordExtractor.extract_wordmaps&tD44U;;<<===r-rc^td||D}|S)Nc3 K|] \}}|V dSr;ra)r)rLrs r+rtz.WordExtractor.extract_words..s'RR.dJTRRRRRRr-)rr)r=rwordss r+ extract_wordszWordExtractor.extract_wordss1RR$2J2J52Q2QRRRRR r-)r]r^r_DEFAULT_X_TOLERANCErUrNr?rrnrwr~rrr%rrrar-r+rWrWs('!&"@@ @@@@:#####JI   I I I I V>(((0AAA>>>>>4Dr-rWrc @tdi||S)Nra)rWr)rkwargss r+rrs$  " "6 " " 0 0 7 77r-c dditdifdtD}||}|jdifdt D}|S)Nr+Tc*i|]}|v||Srarar)krs r+ z$chars_to_textmap..s$ F F FA!v++1fQi+++r-c*i|]}|v||Srarars r+rz$chars_to_textmap..s$ ? ? ?A1;;1fQi;;;r-ra)updaterWWORD_EXTRACTOR_KWARGSrrRTEXTMAP_KWARGS)rr extractorwordmaptextmaps ` r+chars_to_textmaprs MM;%&&& F F F F!6 F F FI''..G g  ? ? ? ? ? ? ?G Nr-c 0t|}t|dkrdSdrt|fijSdt }t difdtD}||}|r|dd}nd}|dkr7| d d d |D}n|d kr7| d d d|D}not|td|}d d|D}|dkr,d dt|D}|S)Nrrr'r?c*i|]}|v||Srarars r+rz extract_text..s$JJJa6kkq&)kkkr-rkrgc$|d|d fSNrprraws r+rzextract_text..sag%y%9r-rrcg|] }|d Srrar)rs r+r,z extract_text..777Aai777r-rec$|d |dfSrrars r+rzextract_text..sqwh%%9r-cg|] }|d Srrars r+r,z extract_text..rr-r0rc3TK|]#}dd|DV$dS)rc3&K|] }|dV dSrira)r)rLs r+rtz)extract_text...s&&E&EtF|&E&E&E&E&E&Er-N)r)r)rs r+rtzextract_text..s=XX$chh&E&E&E&E&EEEXXXXXXr-rfc"g|] }|dkr|nd S)rrrar)rss r+r,z extract_text..s$ T T TqqDyy!!c T T Tr-ra)r rXrArrrUrWrrsortrr8rrl)rrr?rrrkrs ` r+ extract_textrs ENNE 5zzQr zz(0000::jj0CDD !  JJJJ%:JJJ  ''..  Qx +HHH r>> JJ99J : : :HH7777788EE __ JJ99J : : :HH7777788EE#E:h+?+?MMEIIXXRWXXXXXE3 T THUOO T T TUU r- line_charscd}d}t|tdD]+}||d||zkr|dz }|d}||dz },|S)Nrrorrrpr)rr)r tolerancecolllast_x1rs r+ collate_linersr DGzz$'7'7888  d4jGi4G&H&H CKDt* V  Kr-ctddddtdddtffd }||}t||j S) u Removes duplicate chars — those sharing the same text, fontname, size, and positioning (within `tolerance`) as other characters in the set. fontnamesizercrr0rorc36Kt|}tj|D]m\}}tt |t dD]<}t|t dD]}t|dV=ndS)Nrr0ror)rrrr8rr) r sorted_charsgrp grp_chars y_cluster x_clusterr[pos_keyrs r+yield_unique_charsz(dedupe_chars..yield_unique_charsse--- '/ #FFF < .s===qT ===r- rect_edgerrrrr) object_typeheightrqrrrqrr0)rrrrrr0rror)rwidthrprrp)rrror)rr)r!rrleftrights` r+ rect_to_edgesrs)====E!HH===CuJJ&t*5k    MM&t*;h/8ntH~5       KK&t*    LL&t*    u %%r-chtdddd}fd|DS)Nptsr$cg|]\}}dt|d|dt|d|dt|d|dt|d|dddz zt|d|dt|d|dz t|d|dz |d|dkrdn|d|dkrdndd S) curve_edgerr$r0rrrN) rrorprr0rrrr)r|r{r)r)p0p1curves r+r,z"curve_to_edges.."s    B(beRU##beRU##r!ube$$"Q%A''5?U5\+IJ"Q%A''AA''"Q%"Q%-(("$Q%2a5..33ber!unnssRV    r-)zip)r point_pairss` r+curve_to_edgesr sPeElE%L$455K    "    r-c|d}d|vr|gS|dkrt|gSttd||S)Nr_edger)r!r)rrr)objts r+ obj_to_edgesr2sQ MA!||u fS!!""%??B3GGGr-cdvrtddtffd }tt||S)N)rrNOrientation must be 'v' or 'h'rc|ddkrdnd} |dknd}dup |dk}t|o |o ||kS)NrrrrrTrN)edim et_correctorient_correct edge_type min_lengthrs r+testzfilter_edges..testEsoM*c11hhw6?6KQ}%22QU $,O-0@K0OJL>Lqv7KMMMr-)r6rNrfilter)edgesrrrrs ``` r+ filter_edgesr<st ***9:::N4NNNNNNNN tU## $ $$r-c|dkrdt|DSt|dkrdt|DSg}tt|}|dg}|d}|ddD];}|||zkr||n|||g}|}<|||S)Nrcg|]}|gSrarar)rs r+r,z cluster_list..P((((((r-r%cg|]}|gSrarars r+r,z cluster_list..Rrr-r$)rrXrr3)xsrr current_grouplastrs r+ cluster_listrNsA~~((VBZZ(((( 2ww{{((VBZZ(((( F fRjj  BUGM a5D V  ! " "   # # # # MM- ( ( (CM MM-   Mr-cttt||}dt|D}t t j|S)Nc2g|]\}fd|DS)cg|]}|fSrara)r)valrs r+r,z0make_cluster_dict...fs+++c#q+++r-ra)r) value_clusterrs @r+r,z%make_cluster_dict..es?0@=++++]+++r-)rrrBr7r/rchain)valuesrclusters nested_tupless r+make_cluster_dictrbs\DV--y99HDMhDWDWM  / 0 00r-cFtstt|}t||tdtdc}t fd|D|}t j||}fd|DS)Nrr$c3XK|]$}||fV%dSr;rA)r)r cluster_dictkey_fns r+rtz"cluster_objects..us>JJ!a!1!1&&))!.ys- 4 4 4DAqDUA   4 4 4r-)callablerrrrrr) rrrr get_1cluster_tuplesgroupedrrs ` @@r+r8r8ls F  $F## __F$VY77La==*Q--LE5JJJJJrJJJPUVVVNE:::G 4 4 4 4G 4 4 44r-axisc|dvsJ|dkrd|d|zfd|d|zfg}|dkrPd|d|zfd|d|zfg}d|vr|d|d|zfgz }d |vr|d |d |z fd |d |z fgz }|t|t|zS) N)rrrrorprrrr0rqrr) __class__rr.)rrrD new_itemss r+ move_objectr|s  :     s{{ 3t9u$ % 3t9u$ %  s{{ CJ& ' s8}u, -  s?? 8S]U%:;< .>> ? ??r-attrcdddddt|}t|t|}fd|D}fdt||D}tt j|S)Nrrrorprrc g|]<}ttt|t|z =Sra)sumrrrX)r)clusterr s r+r,z snap_objects..s> W W W7CJt$$g.. / /#g,, > W W Wr-c8g|]\}fd|DS)c Dg|]}t||z Sra)r)r)rr avgrs r+r,z+snap_objects...s-DDDSS$c$i 0 0DDDr-ra)r)r%r(r rs @r+r,z snap_objects..sI GS EDDDDDGDDDr-)rr8rrrr )objsr r list_objsr avgssnapped_clustersrs ` @r+ snap_objectsr-sS < .>> ? ??r-rc|dkrd\}}n|dkrd\}}ntdtt|t|}|dg}|dd D]a}|d }|||||zkr-||||krt |||||d <L||b|S) z Given a list of edges along the same infinite line, join those that are within `tolerance` pixels of one another. rrr)rrrrrr$Nr)r6rrrr7r3) rrrmin_propmax_prop sorted_edgesjoinedrrs r+join_edge_groupr=s c'((   ,((9:::u*X*>*>???@@L1o F !"" bz X;4>I5 6 6{T(^++*41X;GGr  MM!     Mr-cd}|dks|dkrt|||}t||}tj||}fd|D}t tj|}|S)z| Using the `snap_edges` and `join_edge_group` methods above, merge a list of edges into a more "seamless" list. cB|ddkr d|dfSd|dfS)Nrrrrrora)rs r+ get_groupzmerge_edges..get_groups0  # % %e% %d$ $r-rrc3hK|],\}}t||d|ddkrnV-dS)rrN)r=)r)rr.rrs r+rtzmerge_edges..se Au  1Q4adckk**?O  r-)r3rrrrr ) rrrrrr@_sorted edge_groupsedge_gens `` r+ merge_edgesrEs%%% !/!335"24DEEU ***G#G;;;K$ H (+ , ,E Lr-c@|d|d|d|ddS)zd Return the rectangle (i.e a dict with keys "x0", "top", "x1", "bottom") for an object. rr$r%ri)rorrprrars r+ bbox_to_rectrHs& q'$q'aDG L LLr-c:tt|S)z Given an iterable of objects, return the smallest rectangle (i.e. a dict with "x0", "top", "x1", and "bottom" keys) that contains them all. )rHrobjectss r+objects_to_rectrLs 00 1 11r-ct|\}}}}t|t|t|t|fS)zk Given an iterable of bounding boxes, return the smallest bounding box that contains them all. )rr|r{)bboxesrorrprs r+ merge_bboxesrOs= v,BR GGSXXs2wwF 44r-cFttt|S)zd Given an iterable of objects, return the smallest bounding box that contains them all. )rOr bbox_getterrJs r+rr!s K11 2 22r-word_thresholdc t|tdd}tfd|}tt t |}t |dkrgStt td|}tt td|}g}|D]5}||||d|d||z dd|||d |d ||z ddgz }6|S) zi Find (imaginary) horizontal lines that connect the tops of at least `word_threshold` words. rr$c*t|kSr;rXrrRs r+rz"words_to_edges_h../c!ff&>r-rrorpr)rorprrrrr) r8rrrrrLrXr|r{) rrRby_toplarge_clustersrectsmin_x0max_x1rrs ` r+words_to_edges_hr])s  UJu$5$5q 9 9F>>>>GGN _n55 6 6E 5zzQ Z%%u-- . .F Z%%u-- . .F E    xE(&"   {H+&"     . Lr-c|\}}}}|\}}}} t||} t||} t|| } t||} | | z }| | z }|dkr|dkr||zdkr| | | | fSdSrrz)aba_lefta_topa_righta_bottomb_leftb_topb_rightb_bottomo_lefto_righto_bottomo_topo_widtho_heights r+get_bbox_overlaproRs'($FE7H'($FE7H  F'7##G8X&&H u  EG%H1}}A(W*.get_centerjs"T$Z$t*,--11r-c"t| Sr;rUrs r+rz"words_to_edges_v..qsc!ffWr-rc*t|kSr;rUrVs r+rz"words_to_edges_v..rrWr-c38K|]}t|VdSr;)ror)rsrs r+rtz#words_to_edges_v..zs.JJA&tQ//JJJJJJr-rrc @g|]}|d|dz ddS)rorrorprrrrra)r)r` max_bottommin_tops r+r,z$words_to_edges_v..sQ    D'D'  7*      r-rrx) r8rrrrrrrvr3rHr{r|)rrRby_x0by_x1rr by_centerr sorted_clustersrYrNcondensed_bboxesoverlapcondensed_rects sorted_rectsr\rryrzs ` @@@r+words_to_edges_vras E:d#3#3Q 7 7E E:d#3#3Q 7 7E222 z155Iu}y(HX+<+<===O>>>>PPN#o~66 7 7F**JJJJ9IJJJJJ *  # #D ) ) )  ,(899OJt4D4DEEEFFL Z%%|44 5 5F#j''6677GSH--|<<==J          7*     r-ci}fddD\}}t|tddD]}t|tddD]}|d|d|zkr|d|d|z kr|d|d|z krs|d|d|zkr^|d|df}||vrggd||<||d|||d ||S) zi Given a list of edges, return the points at which they intersect within `tolerance` pixels. cRg|]"ttfd#S)c|dkS)Nrra)ros r+rz3edges_to_intersections...sa .!3r-)rr)r)rrs @r+r,z*edges_to_intersections..sCABV3333U ; ;<<r-r/rorrrrprr)rrr3) rrZr? intersectionsv_edgesh_edgesrrvertexs ` r+edges_to_intersectionsrs^ MFPGWGD%!8!8 9 9 9 5 5Zt%<%<=== 5 5A5ah455x[QuX %;<<tW4;!677tW4;!677D'1U8,..242,>,>M&)f%c*11!444f%c*11!444 5 r-c t|S)z0 Return the bounding box for an object. )rQ)rs r+ obj_to_bboxrs s  r-cJdtffd ttt dt ffd fdt t D}ttd|S)a8 Given a list of points (`intersections`), return all rectangular "cells" that those points describe. `intersections` should be a dictionary with (x0, top) tuples as keys, and a list of edge objects as values. The edge objects should correspond to the edges that touch the intersection. rcd}|d|dkrP||d||d}t|rdS|d|dkrP||d||d}t|rdSdS)NcFttt|Sr;)rBrr)rs r+ edges_to_setzCintersections_to_cells..edge_connects..edges_to_setss;..// /r-rrTr$rF)rrX)rp2rcommonrs r+ edge_connectsz-intersections_to_cells..edge_connectss 0 0 0 a5BqE>>!\-"3C"899FF ]2.s344F6{{ t a5BqE>>!\-"3C"899FF ]2.s344F6{{ tur-rcf| dz krdS||||dzd}fd|D}fd|D}|D]o} |s|D]]} |s|d|df}| vr: ||r. ||r"dd|d|dfccS^pdS)Nr$c8g|]}|ddk|Srrar)rpts r+r,zFintersections_to_cells..find_smallest_cell..&222qAaDBqEMMMMMr-c8g|]}|ddk|Sr$rars r+r,zFintersections_to_cells..find_smallest_cell..rr-rra) pointsrrestbelowrbelow_ptright_pt bottom_rightrrrn_pointss @r+find_smallest_cellz2intersections_to_cells..find_smallest_cells6 1  4 AYa!egg2222D2222222D222 L LH =X.. ! L L$}R22 ( Xa[9 "]22% lH==3% lH==3qE2a5,q/<?KKKKKK Ltr-c30K|]}|VdSr;ra)r)rrrs r+rtz)intersections_to_cells..s1JJ!""61--JJJJJJr-N)rNrrkeysrXr#rr)rcell_genrrrrs` @@@@r+intersections_to_cellsrs&&++--.. / /F6{{Hc4KJJJJuS[[7I7IJJJH tX&& ' ''r-c<dtfd}t|}tg}g}t|rFt|}t|D]}||}t|dkr=t|z||||]t fd|D} | dkr<t|z||||t||krJ|t||t|Ft|r"|t|dfd} tt|dz ddD]} tj } t} t}|| D]=}| |z} | |d | |d>t| d kst|d ks | | s|| =t|d }|S) z Given a list of bounding boxes (`cells`), return a list of tables that hold those cells most simply (and contiguously). rc,|\}}}}||f||f||f||ffSr;ra)rrorrprs r+bbox_to_cornersz(cells_to_tables..bbox_to_cornerss/"CVS B<"cRLAAr-rc3 K|]}|vV dSr;ra)r)rscurrent_cornerss r+rtz"cells_to_tables..s("N"NA1#7"N"N"N"N"N"Nr-Nc dtD |\}}}} D]"\}}}}||kr||kr||kr ||krdS#dS)Nchg|]/}|dtv|d|d|d|df0Sr)rrs r+r,z5cells_to_tables..has_text..>sJV9L004!E(AdGQx[9000r-TF)rw) rrx0rtoprx1rbottomrorrpr text_bboxess r+has_textz!cells_to_tables..has_text;s}  K #$T3#.   BRCxxBHHw6D==ttur-r$rr%c4td|DS)Nc36K|]}|d|dfVdS)r$rNrars r+rtz4cells_to_tables....Zs..G.G!ad|.G.G.G.G.G.Gr-)r|)rs r+rz!cells_to_tables..Zs3.G.GQ.G.G.G+G+Gr-r) rrrBrXr3remover$rIrr' EMPTY_RECTaddr)r4rrremaining_cells current_cellstablesinitial_cell_countr cell_corners corner_countrrrx1_valsx0_valsrsrBrrs @@r+cells_to_tablesrs BBBBB5kkO eeOM F o  " //)) 1 1D*?400L=!!Q&&3|#4#44$$T***&&t,,,, #"N"N"N"N"N"N"NNN  !###s<'8'88O!((...#**4000 }  !3 3 3 MM$}-- . . .  ! ! # # #    ! ! !5 o  "> =+ d=))***K     3v;;?B + +     %%%%  A FA KK!    KK!     LL1  7||a8A;; q V!G!GHHHG Nr-ceZdZdZdS) CellGroupc ||_tttdt d|tttdt d|t ttdt d|t ttdt d|f|_dSNrr$r%ri)rr|rrrr{r)r=rs r+r?zCellGroup.__init___s JqMM6$#6#677 8 8 JqMM6$#6#677 8 8 JqMM6$#6#677 8 8 JqMM6$#6#677 8 8   r-N)r]r^r_r?rar-r+rr^s#     r-rceZdZdS)TableRowNrrar-r+rrirr-rceZdZdZdZdS) TableHeaderz9PyMuPDF extension containing the identified table header.c>||_||_||_||_dSr;)rrnamesexternal)r=rrraboves r+r?zTableHeader.__init__ps"    r-N)r]r^r_r`r?rar-r+rrms)CCr-rc t|tdd}tttt td|}g}t j|tdD]A\}}d|Dtfd|D}||B|S)aCanonical row order and None gap slots for a flat cell list. Each row holds one slot per distinct cell x0 on the table, so a gap and a span both appear as None. Shared by Table.rows and the union stage, which needs the same grid before a Table exists.r$rrc i|] }|d| Srrar)rs r+rz"_cells_to_rows..s5554a$555r-c:g|]}|Srar)r)rxdicts r+r,z"_cells_to_rows..s#111 ! 111r-) rrrrBrrrrr3)rrBrrowsr row_cellsrowrs @r+_cells_to_rowsrws U 1a 0 0111G fSZ]]E223344 5 5B D!)':a==AA 95595551111b11122 C Kr-ceZdZddZedZedZejdZedefdZ ede fdZ ede fd Z defd Z dd ZdZdZddZdS)TableNcD||_d|_d|_||_||_t |_ttj ttj f|_ d|_ d|_d|_dS)Nrra)r4r_charsr_bbox_NO_HEADER_YET_headerrNr'TOOLSset_small_glyph_heightsunset_quad_corrections _header_flags placements header_rows section_rows)r=r4rrs r+r?zTable.__init__s     % 6688 9 9 5577 8 8 r-c |jt|jS|j}tt t d|tt t d|t t t d|t t t d|fSr)rrrr|rrr{)r=rss r+rz Table.bboxs : !$$ $ J JqMM1%% & & JqMM1%% & & JqMM1%% & & JqMM1%% & &   r-c|jtur:|j\}}ttj}ttj}tj|tj| ||_tj|tj|nC#tj|tj|wxYw|jS)aThe identified table header, computed on first access. Identifying it renders the top row twice, so tables whose header is never read -- every table serialized through placements, and every candidate a later stage discards -- must not pay for it at construction time. The header rules re-read the page, so the two global text-extraction toggles of the detecting call are restored for the duration (see __init__): the result is then the one an eager computation would have produced.) rrrrNr'rrr _get_header)r=smallquads old_small old_quadss r+headerz Table.headers <> ) )-LE5W]BBDDEEIW]AACCDDI M 1 1% 8 8 8 M 0 0 7 7 7 @#//11  55i@@@ 44Y???? 55i@@@ 44Y????|s /DAEc||_dSr;)rrCs r+rz Table.headers  r-rc*t|jSr;)rrrJs r+rz Table.rowssdj)))r-c*t|jSr;)rXrrJs r+ row_countzTable.row_counts49~~r-c>td|jDS)Nc6g|]}t|jSra)rXrr)rs r+r,z#Table.col_count..s 444QCLL444r-)r{rrJs r+ col_countzTable.col_counts!44$)444555r-c  |j|jnt}g}dtfd |jD] g} fd|D} jD]d}np fd|D}t |rPd|d<d|d<d |vr(d dz |d <d dz |d <t |fi|}nd}|||||S)Nrc|d|dzdz }|d|dzdz }|\}}}}t||ko||ko ||ko||kS)Nrrr%rorpr)rrv_midh_midrorrprs r+ char_in_bboxz#Table.extract..char_in_bboxsr%[4>1Q6E$Z$t*,1E"& BR"V52:VESLVuv~ r-c6g|]}|j|SrarG)r)rrrs r+r,z!Table.extract..s,PPP$<<ch3O3OPPPPr-c,g|]}||Srara)r)rrrs r+r,z!Table.extract..s:"""!%ll46N6N""""r-rr=r$r>r'r%r9rir:r)rrwrNrrrXrr3) r=rr table_arrarr row_chars cell_text cell_charsrrrs @@@r+extractz Table.extractsh#{6 E      9 " "CCPPPPP%PPPI  & &< $II""""")2"""J:',0Gy),0Gy)#v--59!WtAw5FF>26:1gQ6GF?3$0$F$Fv$F$F $&  9%%%%   S ! ! ! !r-FTc d}|j}|j d|jD} fdt|D}t |D]H\}}t |D]3\} } | ,t |j||| d||| <4I|rt|D]B} t dz D]-}|| |dz|| ||| |dz<.Ct D]B}t|dz D]-} || dz||| ||| dz|<.Ct |jjD]W\}} | sd|dz} | d d } |r(tj | d d } || dzz }X|d z }|dd d t|jDzdzz }|jj rdnd} || dD]Y}d} t |D];\}} | d} |r(tj | d d } | | dzz } <| d z } || z }Z|d zS)a7Output table content as a string in Github-markdown format. If "clean" then markdown syntax is removed from cell content. If "fill_empty" then cell content None is replaced by the values above (columns) or left (rows) in an effort to approximate row and columns spans. |c0g|]}d|jDS)cg|]}|Srarars r+r,z0Table.to_markdown... s***Qq***r-)rrs r+r,z%Table.to_markdown.. s)>>>q**!'***>>>r-cBg|]}dtDS)cg|]}dSr;rar)rs r+r,z0Table.to_markdown... s,,,1$,,,r-)r)r)rcolss r+r,z%Table.to_markdown.. s.BBB,,d ,,,BBBr-NT)rr$Colrr-z-c3K|]}dVdS)z---Nrar s r+rtz$Table.to_markdown...s" F F1 F F F F F Fr-z| rr)rrrrr7rrrrreplacehtmlescaperr)r=clean fill_emptyoutputr cell_boxesrrrrrnamerr s @r+ to_markdownzTable.to_markdowns~~?>DI>>> CBBBeDkkBBB ++  FAs$S>>  4#"/ z!}Q'7$###E!HQK   64[[ 6 6tax66AQxA.*/(1+aQ6 4[[ 6 6tax66AQU|A.*/(1+a!e Q6 !!233 ! !GAt #"QqS{{<<f--D ?{4<<W#=#=>> dSj FF$# F Fdn0E0E F F FFFFNN% ,AA19  CD$S>> # #4<DC;t||C'A'ABBDs " DLD dNFF}r-c|jt|j|jSd|D}t|S)aHOutput the table as an HTML ```` string. With span placements (from ``find_tables(refine=True)``) each placement's colspan/rowspan and th/td tag are honoured and a section-label row collapses to one spanning ``
``. Otherwise a flat td-only table is built from :meth:`extract`. Nc&g|]}d|DS)c8g|]}td|pdddS)Nrr$rrcolspanrowspan)rrs r+r,z,Table.to_html...Ns=   d$*"q!LLL   r-rar)rs r+r,z!Table.to_html..MsA            r-)rrrr)r=rs r+to_htmlz Table.to_htmlBsY ? &$T_d6GHH H  ||~~    !&&&r-c  ddl}n##t$rtjdwxYwi}|}|j}|jj}t|}t|D]}||} | sd|||<|tt|kr-t|D]}||} | d|kr |d| ||<|j s |dd}t|D]Q}||} g} tt|D]#} | || |$| || <R| |S)z/Return a pandas DataFrame version of the table.rNz!Package 'pandas' is not installedr rr$) pandasModuleNotFoundErrorr'messagerrrrXrrBrr3 DataFrame) r=rpdpd_dictrhdrrhdr_lenrrr[rDrs r+ to_pandaszTable.to_pandasVs      "    O? @ @ @  ,,..k !e**w % %A8D %$99a c#e**oo % %7^^ - -Qx999$$"#}}d}}E!H| "abbkGw ! !A(CE3w<<(( , , WQZ]++++ GCLL||G$$$s 'ric  !"j|}fd}fd} jd}|j}tj|j}n#t $rYdSwxYwt||dd}tjdkr|St|dkr|Sjd} td| jDr|S||} | r|| js|S|r|Sd |dd D} | } d| _ |j | _  d | tj d } td| Ddd}g g}g}t!t|D]c}||}|dd}||ddz }|dtjz}|dkr@ ||||| d }|d }|d }||z |ks%t'||z |ddz |krE|dd||z |dd|f|d<|||<t)|||d <|r||d <|r|snO||z d|zkrnA |||||e gkr|S dd |j dz |dkr|S| r |ds|S|gkr|Stj} fd|DD] }||dz}|js|} |j | _ d d| D"tt/t1d"Dd}g |D]-!!"fd| D}|gkr !- gkr|S|  d _ fd|D}jd_jd_fd|D}tt7||dS) ajIdentify the table header. *** PyMuPDF extension. *** Starting from the first line above the table upwards, check if it qualifies to be part of the table header. Criteria include: * A one-line table never has an extra header. * Column borders must not intersect any word. If this happens, all text of this line and above of it is ignored. * No excess inter-line distance: If a line further up has a distance of more than 1.5 times of its font size, it will be ignored and all lines above of it. * Must have same text properties. * Starting with the top table line, a bold text property cannot change back to non-bold. If not all criteria are met (or there is no text above the table), the first table row is assumed to be the header. cBtj|jdj}|d|j d|j fz}|d}|d}||krdSdS)z Compare top row background color with color of same-sized bbox above. If different, return True indicating that the original table top row is already the header. rclipr$TF)r'r(rrr get_pixmapcolor_topusage)r=bbox0bboxt top_color0 top_colortr4s r+top_row_bg_colorz+Table._get_header..top_row_bg_colors L1!233EQ q5<-@@Ee44CCEEaHJe44CCEEaHJZ''t5r-cfjjnt}tfd|DS)atCheck if a row contains some bold text. If e.g. true for the top row, then it will be used as (internal) column header row if any of the following is true: * the previous (above) text line has no bold span * the second table row text has no bold span Returns True if any spans are bold else False. Nc3K|]8}t|d|d|d|df.|dV9dS)rorqrprrboldNrrvs r+rtz:Table._get_header..row_has_bold..sd4!D'1T7AdG DdKK& r-)rrwrv)rrr=s` r+ row_has_boldz'Table._get_header..row_has_boldsP$(;#:DKKE r-rNFr%r$c3K|]}|duV dSr;rars r+rtz$Table._get_header..s&--QqDy------r-c&g|]}||dndS)Nr%rars r+r,z%Table._get_header..s$EEEQ1DEEEr-rr/r.rrcg|]O}|dD]D}|dD]9}t|d"|dtjz7|:EPS)rrrr)r issupersetr'TEXT_FONT_SUPERSCRIPT)r)r`lss r+r,z%Table._get_header..s   7  7   ++AfI66 zG$AA      r-c|ddS)NrrirarAs r+rz#Table._get_header..s!F)A,r-T)r[reverserrirg?cDg|]}|dddk|S)rrirra)r)rAselects r+r,z%Table._get_header..-s/AAAailfRj&@&@!&@&@&@r-cFg|]}tj|ddSNrr&rs r+r,z%Table._get_header..5s*UUUagl1RaR5))UUUr-rr-cg|] }|d Srrars r+r,z%Table._get_header..6s$>$>$>aQqT$>$>$>r-)rDcng|]1}|-D]*}|dk|d|k|d|k&||f+2S)Nr$rr%ra)r)rrrrs r+r,z%Table._get_header..<s`=#!=Q43;;1Q4!88!q A19r-cPg|]"}||dj|djfnd#S)Nrr%)rqrr)r)rshdr_bboxs r+r,z%Table._get_header..MsG   78mQqT8;!hk 2 2   r-cg|]U}|O|ddddndVS)Nrrz r) get_textboxrr)r)rsr4s r+r,z%Table._get_header..Wsr   =  ##++D#66>>tSIIOOQQQ    r-)r4rrr'r(r IndexErrorrrrXallrqrrget_textTEXTFLAGS_TEXTrrTEXT_FONT_BOLDr3rr|rrrrBrorpr)#r=r?y_deltar5r9rrrheader_top_rowrow2 top_row_boldcol_xr.rr line_heights line_boldsrrArrrr8rqh0bold0nclip word_tops intersecting hdr_cells hdr_namesrMr4rGrrs#` @@@@@r+rzTable._get_headerzs,y          & )A,CIE<))DD   44 %T5$,,..2CUKK ty>>A  ! ! u::>>! !y| --$*--- - - "! !$|D))   " TY 7 7 "! !  D ! ! "" !FE%*EEEu'vD8NOO       '&      s5zz"" $ $AaA61BQvYq\!AW: 66DAvv b!!!##A&&&!!$'''Bb!BrNEBw'!!S"r'QvYq\)A%B%Bg%M%MvYq\27AfIaL"E& a#&r1:: R *%)JrN T Bwr!! MM"       " " "   d # # # # R<<! ! 7VAY ,q/ 1 1! !  " 1  "! ! B;;! !"$$AAAAUAAA  A QvY EE~ D'VU4==t=3T3TUUU 4$>$>:$>$>$> ? ?@@$OOO   CLr!! c"""" R<<! !5Rj        il il         5??Iy$GGGs-A AAr;)FT)ri)r]r^r_r?propertyrrsetterrrr#rrrrr r*rrar-r+rrsd0   X  X, ]]*d***X*3X63666X6$4$$$$LDDDDL'''("%"%"%HeHeHeHeHeHeHr-rceZdZUdZeed<dZeed<dZeed<dZ eed<e Z e ed<e Ze ed<e Ze ed <eZe ed <e Ze ed <e Ze ed <d Ze ed<eZe ed<eZe ed<d Ze ed<e Ze ed<e Ze ed<dZeed<ddZeddZ dS) TableSettingsrvertical_strategyhorizontal_strategyNexplicit_vertical_linesexplicit_horizontal_linesrrrrrrrirrrrrr text_settingsrc $tD]+}t||pddkrtd|d,dD]K}t||dz}|tvr-t|ddtdL|ji|_d D].}||jvr#|jd d |j|</d |jvr|jd =d D];\}}t||turt||t||<|S)aClean up user-provided table settings. Validates that the table settings provided consists of acceptable values and returns a cleaned up version. The cleaned up version fills out the missing values with the default values in the provided settings. TODO: Can be further used to validate that the values are of the correct type. For example, raising a value error when a non-boolean input is provided for the key ``keep_blank_chars``. :param table_settings: User-provided table settings. :returns: A cleaned up version of the user-provided table settings. :raises ValueError: When an unrecognised key is provided. rzTable setting 'z' cannot be negative)rvertical _strategyz_strategy must be one of{,}N)rZr?rri))rr)rr)rr)rr)rr)rr) NON_NEGATIVE_SETTINGSr1r6TABLE_STRATEGIESrrkrAUNSETsetattr)r=settingrstrategyr fallbacks r+ __post_init__zTableSettings.__post_init__vs~ - R RGg&&+!q00 !P7!P!P!PQQQ16  Kt[;%>??H/// "88"2338880   %!#D 3 R RD4---+/+=+A+A+q+Q+Q"4( $, , ,";/ = =ND(tT""e++dGD($;$;<<< r-c$| |St||r|St|trLi}i}|D]&\}}|dddkr|||dd<!|||<'||d<|di|Std|)NrEtext_rkzCannot resolve settings: ra)rr/r.r6)clssettings core_settingsrkrrs r+resolvezTableSettings.resolves  355L # & & EO $ ' ' EMM (( ) )1RaR5G##+,M!ABB%(('(M!$$-:M/ *3'''' 'CCCDD Dr-)rrfr;)!r]r^r_rgstr__annotations__rhrirrjDEFAULT_SNAP_TOLERANCErr2rsrrDEFAULT_JOIN_TOLERANCErrrrDEFAULT_MIN_WORDS_VERTICALrDEFAULT_MIN_WORDS_HORIZONTALrrrrrkr/rx classmethodr~rar-r+rfrfbsn$s$$$&&&&$(T(((&*t***2NE222#e####e###2NE222#e####e###OU ::::">%>>>$%E%%%&+e+++&+e+++M43333jEEE[EEEr-rfc2eZdZdZddddZdefdZdZdS) TableFindera0 Given a PDF page, find plausible table structures. Largely borrowed from Anssi Nurminen's master's thesis: http://dspace.cc.tut.fi/dpub/bitstream/handle/123456789/21520/Nurminen.pdf?sequence=3 ... and inspired by Tabula: https://github.com/tabulapdf/tabula-extractor/issues/16 N)cell_group_filterctj|_d_t|__tjjj jj _ tj _tjj}||j|}fd|D_dS)Nc:g|]}tj|Sra)rr4)r)rr=s r+r,z(TableFinder.__init__..s%CCC5uTY..CCCr-)weakrefproxyr4rrfr~r| get_edgesrrrrrrrrr)r=r4r|rrs` r+r?zTableFinder.__init__sM$''  %--h77 ^^%% 3 J M 2 M 2   ,D,>??  DJ77  ('&ty&99FCCCCFCCC r-rc d|j}dD]Z}t||dz}|dkr?t|d|zdz}t|dkrtd|d|d [|j}|j}|d ks|d krt tfi|jpi}ng}g}|j pgD]} t| tr4t| D]#} | d d kr| | $K| | | |jjd |jjd|jjd|jjd z d d|dkrt!t"d } nF|dkrt!t"d d} n(|d krt%||j} n |dkrg} ng} | |z} g} |jpgD]} t| tr4t| D]#} | d dkr| | $K| |jjd|jjd|jjd|jjdz | | dd|dkrt!t"d}nF|dkrt!t"dd}n(|d krt+||j}n |dkrg}ng}|| z}t/| t/|z}t1||j|j|j|j}t!||jS)N)rmrrnr explicit__linesr%zIf z"_strategy == 'explicit', explicit_zD_lines must be specified as a list/tuple of two or more floats/ints.rrrr$rirxrrr)r)rRrr)rorprrrr)rrrr)r)r|r1rXr6rgrhrrwrkrirr/rr3r4r!rEDGESrrrjr]rrrErrrrr)r=r|rrvrv_strath_stratr v_explicitdescrv_baser h_explicith_baserrs r+rzTableFinder.get_edgess=5  Kx{)BCCH:%%+ *Ch*NOOu::>>$(k(($/(((,. f  6 1 1!%JJH,B,HbJJEEE 4:  D$%% %d++--A'3.."))!,,,-!!""#y~a0"&)."3"&)."3dinQ6G"G'*      g  !%--FF  & &!%???FF   %eH.o sAfIaLr-rfontrrrcolorrc|ddSrra)rss r+rzmake_chars..v s& ! r-roriginrsadvrr0rrrdncs DeviceRGBnon_stroking_colornon_stroking_patternNrr page_numberstroking_colorstroking_patternr8rr)rcrrorprqrr)rwrEnumberr!rtransformation_matrix get_textpagergrRrr'MatrixrrNrT sRGB_to_pdfr(Pointrrrfrprorrrqrr3)r4r.rr page_heightctmTEXTPAGEr doctop_baserrldirrdrcrrfontsize span_boldrrrbbox_ctmrr char_dicts r+ make_charsr] sl KKMME+/K)"K  $C  d.2B2B CCH ]]9x] 8 8 BF +K0,0,'N/ ,/ ,D;D$q'1%%uT!Wa'8'89D^DGd1gXtAwQANNFAw!||tG}2H2HIII' ,' ,<< MG$::Td<>PST>T  +DM::"4=6L6LMMM , ,D"<V 55D#czH$]4>::S@F%xFH%xFH9D!GRtw0047AR! $'!!$'K"7!#H ! !$'DG"3 ! !%-- !{!-e!/!&v!&{!G J479J!)%!+D! ! !!"tw#!$$+!%47!2"g"g&k&k/!!!I2LL++++A ,' ,/ ,` Or-cn|j|kr|j|jkp|j|ko|j|jkS)z:Whether a rectangle is thin enough to be a simulated line.)rrr!rs r+ _is_line_liker s< J* $ Adk)A  z!>dkDJ&>r-c^t||ot|j|j|kS)a;Whether a rectangle inside a large fill path is a simulated line. A path's aggregate bbox is no evidence about its individual items, so a thin rectangle batched into a large fill can still be a grid rule. A thin *and short* one cannot: dot screens and vector-drawn glyph fragments consist of rectangles that are small in both directions, and a few hundred of them snap and join into one long spurious edge. A rule reaches at least the minimum edge length along its length, which is the same bound filter_edges() applies to the finished edges.)rr{rrrs r+_is_batched_ruler s, z * * Xs4:t{/K/Kj/XXr-c !"#$%&t}|j%|j&|j"|jdkp |jdk!jj#j #zj dz$j}j dvr!|j \}} tj dd| |}|tj |}n|}%&fdd!"%&fd } | |\} }%&fd  #$fd } |D]} | d }| d rT|ddd krB|d dd kr0|d |d d|ddf|D]C}|ddvr|dd kr@|dd\}}| | |||}|r"|t|Z|ddkr|d}t#|"r|j|jkrTt'|j|jzdz }tj||j}tj||j}nSt'|j|jzdz }tj|j|}tj|j|}| | |||}|r"|t||| | |j|j|}|r"|t|| | |j|j |}|r"|t|| | |j |j|}|r"|t|| | |j|j|}|r"|t|n|d\}}}}| | |||}|r"|t|| | |||}|r"|t|| | |||}|r"|t|| | |||}|r"|t|Edddd}| D]}| ||j|j|}|r"|t|| ||j|j |}|r"|t|| ||j|j|}|r"|t|| ||j|j |}|r"|t||t9|t:t<fsJng}|D]_\}}tj|}tj|}| ||||}|r"|t|`|t9|t:t<fsJng}|D]}tj |}| ||j|j|}|r"|t|| ||j|j |}|r"|t|| ||j |j|}|r"|t|| ||j|j|}|r"|t| dS)Nrr$rgrercX|jz |jcxkr|jzks'n|jz |jcxkr|jzkrNnnK|jz |jcxkr|jzks'n|jz |jcxkr|jzkrnndS|jz |jcxkr|jzks'n|jz |jcxkr|jzkrNnnK|jz |jcxkr|jzks'n|jz |jcxkr|jzkrnndSdS)aMDetect whether r1, r2 are neighbors. Defined as: The minimum distance between points of r1 and points of r2 is not larger than some delta. This check supports empty rect-likes and thus also lines. Note: This type of check is MUCH faster than native Rect containment checks. TF)rorprqrr)r}r~snap_xsnap_ys r+ are_neighborsz!make_edges..are_neighbors s EFNbe 5 5 5 5ruv~ 5 5 5 5uv~8888"%&.88888 EFNbe 5 5 5 5ruv~ 5 5 5 5uv~8888"%&.888884 EFNbe 5 5 5 5ruv~ 5 5 5 5uv~8888"%&.88888 EFNbe 5 5 5 5ruv~ 5 5 5 5uv~8888"%&.888884ur-c&|td}n |dd}g}g}|D]} rs|ddkrg|djkrV|djkrEfd|dD}|r.|}||d<||w||||t t d |Dd }g}|r|d } d} | r_d } tt|dz d dD]9}  | || r%| || j z} | || j z} || =d} :| _tt| r|| |d =|||fS)z:Detect and join rectangles of "connected" vector graphics.NTrrrr!c|g|]8}|ddkt|d6|9S)rr#r$)r normalize)r)r*rs r+r,z6make_edges..clean_graphics.. sNAw$+;DG.clean_graphics.. s;;;1QvY;;;r-c|j|jfSr;)rrrors r+rz4make_edges..clean_graphics.. sQTSTSWLr-rrFr$r) r7rrcopyr3rrBrrXtlbrrxrw)npathsallpathsr6 bbox_pathsr line_items line_pathprects new_rectsprect0repeatrrrrr4rrs r+clean_graphicsz"make_edges..clean_graphics s >*4===HHaaayH  ! !A fI$$fIOf,,fI$v-- !'  , !I)3Ig&LL+++ LLOOO   a ;; ;;;<.is_parallel+ sB rtbd{  v % %RTBD[)9)9V)C)C4ur-c ||siSt|j|j}t|j|j}t|j|j}t|j|j}||jks!||jks||jks ||jkriS||jkr|j}||jkr|j}||jkr|j}||jkr|j}||z }||z } || cxkrdkrnniSid|d |z d|d |z d|d| d||f||fgd |dd d d d dd d|dr|dn|d ddddddddd||| zd} | S)z;Given 2 points, make a line dictionary for table detection.rrorqrprrrrr linewidthstrokeTfillFevenoddrrrNrrrrr)rrr0)r|rr{rrprorrrq)rrrr.rorprqrrrr line_dict doctop_basisrrrs r+ make_linezmake_edges..make_line1 s7{2r"" I rt__ rt__ rt__ rt__ <<2<<2<<2<<I <<B <<B <<B <<BRb F    a     I " +"  "  +"  U  f   RHr2h'  7  d  E  u  AgJEajjAfI  !$  6  ; ! " #D# $<')   ,r-r. closePathr@rr%)r@r#qur#)rrr)rrrr;)rrErrrrgrhr!rrrkrr'r(r3rrrrrrprorrqrrrbltrrrr)'r4r.tsetr6 add_lines add_boxesrprectrrrrNrrr.rrrrr!rrulurlllrr0rboxrrrrrrrrrrs'` @@@@@@@@@r+ make_edgesr s) KKMME  "F  "F%J .0 6  #~ 5)"K;,L+/K IE } !!x1 Q1a(( |D!!@? ? ? ? ? ? ? ? ? ? ? B#N%000MFE 44444444lF:F:'  [> ;eAhqkS00U2Yq\S5H5H LL#uRy|U1Xa[9 : : :? :? :At,,,ts{{122B%IaR66 :LLi!8!89991t~~'' z22 zDK//$' 122Q6$]1dg66$]1dg66$' 122Q6$]47A66$]47A66 ) !RT : :I > \)%<%<===%Ia$'4@@ :LLi!8!8999%Ia$'4@@ :LLi!8!8999%Ia$'4@@ :LLi!8!8999%Ia$'4@@ :LLi!8!8999"#1BB%IaR66 :LLi!8!8999%IaR66 :LLi!8!8999%IaR66 :LLi!8!8999%IaR66 :LLi!8!8999? :Bq 9 9D22IdDGTWd;;  2 LLi00 1 1 1IdDGTWd;;  2 LLi00 1 1 1IdDGTWd;;  2 LLi00 1 1 1IdDGTWd;;  2 LLi00 1 1 1)eT]333333 22B ]2   ]2  IdBD11  2 LLi00 1 1 1)eT]333333  2 2 L  IdAD!$55  2 LLi00 1 1 1IdAD!$55  2 LLi00 1 1 1IdAD!$55  2 LLi00 1 1 1IdAD!$55  2 LLi00 1 1 1 2 2r-c |j}|j}|j}|dkr7tjdddd|j|jz |jz |jz d}nf|dkr7tjddddd|j|jz |jz |jz }n)tjddddd|jzd|jz}||jz}dt|z}tj ||d}|dvr8|\}} } } | |_||_| |_| |_| || d|j} |j} | | }||||fS)zNullify page rotation. To correctly detect tables, page rotation must be zero. This function performs the necessary adjustments and returns information for reverting this changes. rgr$rres%g %g %g %g %g %g cm r)mediaboxrkr'rrrrprorqderotation_matrixrr_insert_contents set_mediabox set_rotationparentr)r4rrotmbmat0matcmdxrefrorqrprrdocpnos r+page_rotation_set0r sp}H -C B byy~aAq"%"%-"%*?"%*GKK ~aAq!RURU]RU-BRU-JKK~aAq"ru*b25jAA ' 'C "U3ZZ /C = ) )$Q 7 7D iBB "a +C +C s8D sH $$r-c|j}||d|||||j}||}|S)zPReset page rotation to original values. To be used before we return tables. )r update_streamrrr)r4rrrrrs r+page_rotation_resetr s^ +CdD!!!hc +C s8D Kr-c Jt}d}t|D]\}}d}|D]x}||f|vr |dz }||f|v t|jD]6}t|jD]}|||z||zf 7||jz }t ||}y|S)zBColumn extent of a placement grid after resolving colspan/rowspan.rr$)rBr7rrrrr{) roccupiedmax_colrow_idxrcol_idx placementdrdcs r+_refine_placement_grid_widthr! suuHG!*-- , ,  , ,IG$001 G$00I-.. ? ? 122??BLL'B," !=>>>>? y( (G'7++GG , Nr-c 8t|}g}|D]}g}|D]}|'|tdddd+tj|}dt |||D} |tt |t| ddt||kr9|tddddt||k9|||S)a#Flat fallback grid: one 1x1 SpanCell per slot, padded to ``col_count``. Selects words per cell by center-point and synthesizes each cell's line text ("" for a gap), using the same word source and line builder as resolve_spans. Used when span resolution changes the column count.Nrr$rc2g|]\}}t|Sra)r)r)rrLs r+r,z/_refine_flat_placement_grid..A s44*$//r-)r4) r r3rr'r(rrrrX) r4rr page_wordsgridroutrr! line_wordss r+_refine_flat_placement_gridr2 sM $D))J D  D| 8B1MMMNNNN|D))#=j$UY#Z#Z#Z  "4[[5jAA ! ! #hh"" JJxTAqIII J J J#hh"" C Kr-strict_colspanheader_row_countctd|Dd}t||||}t||kr|St|||S)zThe reconstructed cell grid: resolved SpanCell placements, or the flat 1x1 fallback when span resolution changes the column count (grid width != col count). ``strict_colspan``/``header_row_count`` pass straight to resolve_spans.c34K|]}t|VdSr;rUrs r+rtz1_refine_placement_or_flat_grid..W s(//#SXX//////r-rr)rr)r{r rr)r4rrrrrs r+_refine_placement_or_flat_gridrS sp/////;;;I e&6~J$J//9<< &tUI > >>r-cd|DS)zORow-major whitespace-collapsed cell text -- the ``[[text]]`` header rules read.c&g|]}d|DS)c6g|]}t|jSra)rrrs r+r,z;_refine_placements_text_grid...b s# 9 9 9T di ( ( 9 9 9r-rars r+r,z0_refine_placements_text_grid..b s' J J Jc 9 9S 9 9 9 J J Jr-ra)rs r+_refine_placements_text_gridr!` s J JT J J JJr-cXt|D]\}}|D]}||krdnd|_|S)zxSet each placement's HTML tag in place: cells in the top header rows become ``th``; every other cell becomes ``td``.thtd)r7tag)rtop_header_rowsr rrs r+_refine_tag_gridr'e sR"$CC  C CD&88ttdDHH C Kr-c   t||}tt|}n#t$rYdSwxYwt |j}|||r+t dt|t|ndfS)a The merge-preserved model grid plus the header counts derived from it. Returns ``(grid, header_rows, body_start)``. ``grid`` is None when span resolution or the header rules fail. ``header_rows`` is the header finder's own count, where 0 means it found no header row at all; ``body_start`` is that count clamped to [1, rows], which is what the row splitter needs. One resolve_spans pass serves both the header/body boundary and the repeated- header split check, so the split costs no extra pass. )Nrr$r$r) rrr! Exceptionr#r&r{r|rX)r4rrregionrs r+_refine_model_gridr+n s-dE::#$@$F$FGG zzf,--K uSs1c+s5zz&B&BCCCRS TTs ,/ ==c6t||\}}}|dn|S)zHeader/body boundary: resolve the merge-preserved placement grid once and ask the header finder how many leading rows are header, clamped to [1, rows].Nr$)r+)r4rr _header_rows body_starts r+_refine_body_start_rowr/ s(&8e%D%D"D,  11*,r-c  d|DsdStdD}|dkrdStttt|dt D]}| t dz|kr!d D}t |dkrAt d|Ds[ fdt|d zt D}|s|g|}g|t }t d t||Drt|cSdSdS) aqRows at which an exactly repeated leading header splits a stacked table. Several tables printed one under another with no gap are detected as one grid, and the giveaway is that their shared header row recurs verbatim. The signature is the first row that carries at least two non-empty cells in a grid at least two columns wide and is not purely numeric or punctuation; it must also be a leading row -- inside the header region the header rules found, or within the first three rows, because that finder is conservative and a title row and a units row often precede the real header. A repeat further down is data, not a header. Repeats are matched on case- and whitespace-normalized text only: no fuzzy matching. A header signature also carries the grid's column structure, so it must hold at least half as many placements as the widest row: a row of a few spanning cells is a group header -- a sub-header such as "From- / To-" under an eight-column header, which recurs inside one table -- and not the header. A repeat is accepted as a cut only if the result really looks like a stack of tables rather than a table that happens to repeat a row: every segment must hold at least one row below its own signature row. That single structural invariant rejects both adjacent duplicate header rows (one header, not a cut) and a trailing repeat with no records under it, and it needs no row-count constant. Each cut row opens its segment by construction; the first segment may carry a title row above the signature. Returns the cut row indices, or () for no split. c@g|]}td|DS)c3XK|]%}t|V&dSr;)rcasefoldr)rs r+rtzB_refine_repeated_leading_header_cuts... s7 @ @Dt$$--// @ @ @ @ @ @r-)rrs r+r,z8_refine_repeated_leading_header_cuts.. s<EH @ @C @ @ @@@r-rac34K|]}t|VdSr;rUrs r+rtz7_refine_repeated_leading_header_cuts.. s(//SC//////r-r%ricg|]}||Srarar4s r+r,z8_refine_repeated_leading_header_cuts.. s777T$7D777r-c3HK|]}|D]}|VdSr;)isalpha)r)rrs r+rtz7_refine_repeated_leading_header_cuts.. s7HHd4HH44<<>>HHHHHHHr-c,g|]}|k|Srara)r) row_index normalized signatures r+r,z8_refine_repeated_leading_header_cuts.. s3   )$ 11 111r-r$c3.K|]\}}||z dkVdS)r%Nra)r)rrs r+rtz7_refine_repeated_leading_header_cuts.. s/TTJE3sU{aTTTTTTr-) r{rr|r#rXrvrQrr) rrrrnonemptyrepeatssignature_rows segment_endsr;r<s @@r+$_refine_repeated_leading_header_cutsrB s6LPJ r //J/// / /E qyyrs3s;//33S__EEFFu% y>>A  % % 77Y777 x==1   HHhHHHHH       "519c*oo>>      *'*22#j//2 TT#nl2S2STTT T T ">> ! ! !rr 2r-ct||d|}tt|}t||j}t ||j}t||j}||fS)zResolve the final placement grid (strict colspan, header boundary known), run header rules on its own text grid, complete the header under spanning header cells from the grid's spans, tag cells -> (tagged grid, region).Tr)rrr!rr&rsection_header_rowsr')r4workingr.rr*depthtaggeds r+_refine_build_placementsrH s{ * gdZ   D r-c#Kt|j}t|||jt |\}}}|d}d}nt t ||}|r:dg|tR}fdt||ddD}ng}t|dk} |D]} | rt|| n|} t|| | } t| } | s| r<| rt|| | rdn|j n|} t|| | \}}|| _|j| _|j| _| VdS) aORefine one detected table's grid and yield the resulting tagged tables. Order: structural split (shaded rows + under-segmented columns), the model grid that carries both the header/body boundary and the repeated-header split decision, then per segment the body-row split, the final merged-cell placement grid and the td/th tagging. A grid whose leading header row recurs verbatim is several tables printed under one another and yields one table per segment; that is the ordinary case of one segment, which yields exactly the table the unsplit path produced. ) table_bboxNr$rarc*g|]\}}||Srara)r)rrrEs r+r,z'_refine_grid_tables.. s&YYY:5#GE#I&YYYr-)rrG)r rrrr+rBr!rXrr/r r rrrHrr&rrDr)r4tabr model_gridrr.cuts boundariessegments was_splitsegmentrflatnew_tabrr*rEs @r+_refine_grid_tablesrU s ! + +D$D$38DDDG*|r6g},2jD]%}-|,"tG||-&|,2_|#2jD]}.|.$|._%n#t$r}/tj&d$tO|/zYd}/~/|!r |` n#t$rYnwxYwtj||t+|||| }tj|#dSd}/~/wwxYw|!r |` n#t$rYnwxYwtj||t+|||| }tj|#nm#|!r |` n#t$rYnwxYwtj||t+|||| }tj|#wxYwtQtR}02jD]}.|%|._|0|._*2S)%aDetect and extract tables on a page. use_layout: if True (default), use page.get_layout() to find layout- identified table regions and use them to restrict/complete line-based detection; if layout ran and found no tables, return an empty result immediately. Set False to always run full detection. union: if True (requires the layout analyzer), detect tables by fusing the layout analyzer's table grids with the line-based finder's candidates -- a candidate matching a layout table 1:1 can replace its grid, candidates contained in one layout table can split it, and unowned candidates are appended -- returning the fused tables in layout order then appended order. Off by default. Needs the raw layout form: when page.layout_information is None it is computed with page.get_layout(return_raw=True); when already populated it is reused as-is. refine: if True, refine each detected table's cell grid before building the Table -- splitting rows/columns the line grid merged (using page text and background shading) -- then reconstruct its merged-cell structure and header semantics. The tagged grid is attached as Table.placements (a row-major grid of SpanCell colspan/rowspan placements, each carrying its td/th tag; None on the default path), the header meta as Table.header_rows/section_rows, and Table.to_html() serializes it. Off by default. A grid whose column count the span resolution cannot preserve falls back to a flat one-cell-per-slot placement grid. A refined grid whose leading header row recurs verbatim is split into one table per recurrence: that is several tables printed under one another which the line grid detected as one. Tr)NNNrNFrgrhrirjrrrrrrrrrrrrtext_tolerance)text_x_tolerancetext_y_tolerance)_find_tables_union)rrc^g|]*}|ddktj|dd+S)rtableNrr&)r)r`s r+r,zfind_tables.. sC01PQRTPUY`P`P` QrrU++P`P`P`r-)r|r-)r.rr6rr)r|rcLg|]tfdD S)c3JK|]}tj|dkVdSg333333?Nrr)r)rrLs r+rtz)find_tables... s4CC4!,,3CCCCCCr-ru)r)rLboxess @r+r,zfind_tables.. sMCCCCUCCCCCr-cVg|]$tfdjD"%S)c3JK|]}t|jdkVdSrdre)r)rLrs r+rtz)find_tables... s4'V'VCQ(9(9C(?'V'V'V'V'V'Vr-)rQr)r)rtbfs @r+r,zfind_tables.. sNC'V'V'V'V3:'V'V'V$V$Vr-cFg|]}tj|ddSrIr&rs r+r,zfind_tables.. s*SSSagl1RaR511SSSr-)rz#find_tables: exception occurred: %s)+r'_warn_layout_once _CHARS_VARrB _EDGES_VARrNrrrkrr1rr)rsrpymupdf._table_unionr_r get_layoutlayout_informationrrrfr~table_settingsrrr extractWORDSrTABLE_DETECTOR_FLAGSrr3rrLrUrrr$rrrwr)3r4r.rgrhrVrWrrrrrrrrrrrrr\r]r^rvrrr6rXrYrZ_cell_group_filterrold_xrefold_rot old_mediabox owns_drawingsr|old_quad_correctionsr_rrmy_boxesrtp2r!rrefined_tablesrLrarrrfris3 @@r+ find_tablesr} sv NN2NN2W]::<<==I M))$/// }0B40H0H-h*:''< D"94@@DHM" ")+D & & " " "!MMM "    '#( '#( $&.2 "> $%5  .  ,  , . , , ? 0  4 !"8 #$< #$ : @ ? ? ? ? ?$$TY)TTTC|HHE  44T:::!!!*M88>>>595LE!8!D&d++Cx   ..     --i888  &tXw MMD ,,-ABBBBE!((((;;D"&D !$T222H ##     dTEWXXXC#CL "z  H DSS8;P;P;R;RSSS ''.B'CC  : :,S*dCC:J%%eD%&8&8999  ( Nz F F%%&9$&D&DEEEE'CJ    4 4 % 1 1 3 3 =AFGGGttt   ..     --i888  &tXw MMD ,,-ABBBBB   ..     --i888  &tXw MMD ,,-ABBBB   ..     --i888  &tXw MMD ,,-ABBBB KKE! JsC C'&C'?B&O0(H++ H87H8E!O0/S=0 R:$R S=%P(( P54P5 RS=R R'&R'=U'TU' TU'TAU')Fr)NNr$r)r$r$r;)NNNNN)r`inspectrr^rcollections.abcr contextvarsr dataclassesroperatorrrr'rpymupdf._table_refinerr r r r pymupdf._table_spansr rrrrpymupdf._table_headersrrrrrrrmrlr7r9rrw FZ_STEXT_BOLDrFZ_STEXT_STRIKEOUTrrSTEXT_COLLECT_STYLESTEXT_MEDIABOX_CLIPrergrf TEXT_SEGMENTTEXT_COLLECT_VECTORSrsrB whitespacerrlrxrrNrrrrr2rrqrrrsrrrrrrUrSrTrQr5rr r r%rWrr<rR parametersrrrrrrrrrrrrrrr/rr8rr-r3r7r=rErHrLrOrr#r]rorrrrrrrrrobjectrrrfrrrrrrrrrrr!r'r+r/rBrHrUr}rar-r+rs HHT $$$$$$""""""!!!!!! .-----Z-t < < < Z-t < < < ).#####L#"#"#"#"#"#"#"#"L  ## ##   )  !" !  "# "# !s6$%%     9 9 9MtMMMM888veeeeZ            A@@ 1  judH55             4     ########L^!^!^!^!^!^!^!^!BTTTTTTTTn88D8888#"7#566AFFHH))-88CHHJJ D w    3F"        ,,,d,,,,. %&4%&%&%&%&PT$HHHHH %%  %%%%$T(1D1111 5d 5 5 5 5 @3@@@@, 4S 4 4 4 4 4'&!!!!$@C@@@@68N6BM$MMMM222225553333O&&C&&&&R   3M::C::::z42;(;(;(|_D____D             y       UHUHUHUHUHUHUHUHp YEYEYEYEYEYEYE YExFFFFFFFFR*::::D Y Y Yj2j2j2j2Z )%)%)%X   *"BCHZ^ ? ? ? ? ?KKK UUU&---:::z    111l $&!2""2"" :">$%&*&*  ;``` `  `  ````````` ` "!`"$#`$$%`45`6 7`8 9``````r-