From 5551480d16d63f691855f102450d15a101413a7c Mon Sep 17 00:00:00 2001 From: AntonSarr Date: Sat, 29 Jun 2024 21:01:23 +0400 Subject: [PATCH] update to v0.2.0 --- dist/strtree-0.1.0-py3-none-any.whl | Bin 8220 -> 0 bytes dist/strtree-0.1.0.tar.gz | Bin 8875 -> 0 bytes dist/strtree-0.2.0-py3-none-any.whl | Bin 0 -> 9398 bytes dist/strtree-0.2.0.tar.gz | Bin 0 -> 10490 bytes dummy_example.ipynb | 336 ++++++++++++++++++++++++-- pyproject.toml | 2 +- site/assets/_mkdocstrings.css | 91 +++++-- site/index.html | 2 +- site/objects.inv | Bin 349 -> 365 bytes site/pattern_reference/index.html | 105 ++++---- site/patternnode_reference/index.html | 118 +++++---- site/search/search_index.json | 2 +- site/sitemap.xml.gz | Bin 127 -> 127 bytes site/stringtree_reference/index.html | 213 +++++++++++----- src/strtree/utils.py | 224 +++++++++++------ tests/test_main.py | 29 ++- 16 files changed, 839 insertions(+), 283 deletions(-) delete mode 100644 dist/strtree-0.1.0-py3-none-any.whl delete mode 100644 dist/strtree-0.1.0.tar.gz create mode 100644 dist/strtree-0.2.0-py3-none-any.whl create mode 100644 dist/strtree-0.2.0.tar.gz diff --git a/dist/strtree-0.1.0-py3-none-any.whl b/dist/strtree-0.1.0-py3-none-any.whl deleted file mode 100644 index 559e11a21536543ae06e826002d85aed3aecf491..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 8220 zcmaKx1yCJpwuKKGIJiS_4ess^0S@jG+}&LQ1b2dK@B;}FTn_F8cXtgA!R2MU?n|JuFkU&`_@u-E_q00F=sJ*;gLS}2kT1pqX{003COpSrraxVe~{ zvltp$J6O9J8ZtY1Ly|@umRZrIZm)1)D$RN?-r%1XL^FOzM6Q#z*5w5Bxi23%6b;{WaBg^SeDBsZ48OGwaz`%)F+BR>;=VC5Th|^R{3w9Mv1_{$I0>^jHG}0G5h=;1J*cPS_ zmnySIhg-L8eeZlU832`d6&B-GyptmVv&|_Fr=wq}e?aZG1>c{sUij@^jWD!{Q^$|` z8yPZjWtHlEOg8ljw|WlV^kHK_IC9b8me}LY**XS|VL!i_GH|M+3d~_1=V=}Xyh17e ze+Mr=4{JC1^0TaA007%s008>GbkY=j79g!=l#n2yh703RLBoHY}%U z^w2wdq=KvZj2k;l+bsHCj*sn9u39YCFH0~q*aS?^36SAgb`MIv8f~>>*3)KwZ8FY2 z!674b_HuC@^zQ4G2`#Jrj;~}~E?I+1*r0DAHOH7%sJoLDnZc*Y$(b_`NW2hyOarWB zMjmE-x=YpaduLSLAfa?JfJ%^S@zsI;#xZ0-cwk)53%X)5UfcV*R-0>cYYS&q?WV=J zRbsW;wo7vt)yjOn*{D&c7VeG?)%={tshMeBt%dthXu109SX9eqpIi)QBbHez0*nZ4 z8C|8Z!yL8JsIs_Ab%zaji^jA~l_SWAo&Wms91%K0Wm zJ!gdvU;RA42n5f_J{=yc|3<;LZWIBPl} z7Znzznp;>%xtf(^kj?9iXms`<(Ur(k{}jqc7bSq(!SL6?MG5B^Sc`7; z=@08u#UfQ)sHP*#Ww|v+xj7B#Of&)G1O*0lY7x98dV*=c5+s$|3-hbzSNC)0QCP-x zrCEilkIy_JW0V3kpXXt3g$*bPa$}qs^Gvl)Loa^ny3+6D)(TVs)Hc#OtdtRq0IPw0 zvG_WSAGwm$ia&<*DcE*Z%+4ifn`xP{+I^)ZyaDMTI8rPK^3BWaU%3ifrcIirm!%>c zEE18KAlC>|D%AXv-)ukVwCCE|gh!Ul#ei>hRi0BjOI+lCNlsUa>Necjk8>m3Qz63* zq}!$fYO6L)7Px~YoMPOOa4t`_`q}SVwK0 zmTy0cxBmsB;j7(uqJ&a|Z6Y!MvG!@nIy!MvaO~3wHw;q2F~aU!v6)&fgf>3DF~Pm6 zwWECycz$ZPil)gTU=SWTX0Tu@0Aa;QpY+f(1%0Vs$kAx$ zVdB7wyt-S%qt?DN3RBL*{w`c@gxXMcNS@H8hEKSjHoEliuyPPR6_0V`XMS5gO<0%G zFz~9HwToEsoW?2yVIAmbMV==?WR|meaVVGK(ZKPkjfbSZO8xCoYUy`XN%e{QImEMD z@4a&j1f`V$r1uHN8TvO~p!eS%B?H$hUFgmna=-?;9`M6A!w|vSZv}o7o;F8aQ%>0P z;WMsj9@I1f^NC(%-;{g`RO!5>)u(m*t<`yXe$lI&xyTd1Q`df$HW>?(b&G&cl0}K3 zLX}rL9_A|BnS{Xj;-lq6!)7$(f8G*~!uUcfKE(f^Ekaa^6&_I5PH^Osq_W)uNP0$> zb`kFIWcQK*lk;rn%dY zpy;fS{oJ#8z0b}deR<~Gl(ADbg6kk@nu>Kw%4-vd73+CT8G<`w`HVGn6k=^+3K2|& zmceKZa8P@*vIIL|`FK**>!BS+?1m{Ox#-|&#jDveVnUtp+SN3h3!8NAR)j2%hGUI1 z1DP=uODZKZcs#Bk?Y3^AAhg+^c3J^vB}gjGYTKShcdEtQ;0SS=BK74UaVbB$6@Kw$ z2zL=+W7BB#5yn~00Y*h!&m>&Ue54X2J{gh{Z;Z3^nr+sGnN^a3&-8~+KwoDy!`P>% zt$CSthD_qrtw4qOJgUnd&ge-Nm97;aFoJnpMqGPYz!OIi{#v3!kR;gCv(IghwD$uT zY1i+0Pd#LzBHLdEL&5C`ZO8U;8d;FC%vKCOLoA<#e$H0ly9I@G-fOm@QgJUXe)1P{ zh2(DZ73@gx5MeSSgNaO>Vg$_qH=!rE9@L*#Q6Z^w&^!kGu=>d}x(>UJ69nTz0=&4iuX(gu0yXT{3Ub(1FgZa%_5aK=WSRmXh znVnRspojAzp?`P;0UPtBw#`yv7{7V?l4v#>Mb_bpLJdD!+}Wg_os3)PpnFW5VX4RI zUDt~3D~|fS8H4-sX~ar|xOyALNQoayln?eyFpU?C*R-7kM=1>(7vd+cWPkKe@D^F+ zD~E|qz0ZoHUABipRd1_=qnFN=K{~ujr^{W!`wTTqS6n-HFcTNPUGUScvQ6;Q@6M~N zG?M`1Ka(=3lWtJDVRTuM#B7Q(ldwZtO89HqoR0Z7M=4o4Mg>v0TRQvGM%Xf{KC^~w zAFUg8sGyyn5C6(@I?Kn&X~KO4!v9DdD9;SrIm*>1x!tO6#l@Lox&X@O!)>-srEH)- z!1zS-8z|GwfH+yt!W=~3cv+pUGA#_jIe7ZoGL#>cW11FJ?Jz+ZR^fajG}k(zcIaVX zoqUO93{b|_aXx3*1VZGCiG)N}Z>lDU_f2oGL!D4<;-dRiH*kMZz(8QkoN=H`rj_T3 z>-#yLtRv>z?zCV_`QsPTWSkYomlI{N4XcgZR}p4k$EmltEBCHsww_#L*rzQeGv6pj zEIC;F9W9D?8*auCeI1sVM7B8IBG24_V&U9Lu|@YaOSf|g^){sD#PtDIa;^gY< z7t0!fwRSpJ+u3zJ)kK*()~2@3K6o)1YSBm3y*?i%EKMekM(7LqUilTy_+YZh&W|Ob z)1DE$989R9E4W3JceRtr^MQD{t;;jph_%t*3)8kM7QpB`P3e8pBMdjCe7bL&9R*!5 zH^hZrt$CxFL@_sO7gNlzP_|%yY$b1MEb)I5=NOH~7+##VGzvFa>%VX>*`xo^f2^Za zDU4`|gf1T3dJT6I4uv9N1S$7{GX2bMEni%n`R# zeszxZa7%E<-XGG!(8Q!j8fl{ z@jKHozpf0k5khyFO>Lmd$U;3fhy+qi!tSSDd+QzHYS;FOo4_f`!s10&@K5fee zRNSr7n(!>hVMi{Lhn`cAZQCjdpa8M>KO0%L7R>%4ADO2Vxdn0gDK0RFoY2sB);X?n$%;P*GuODqQj1xY2{4dzT!;6zRzwz5o-Y zS7ReQk)Q~|@cqKQ1&0j8DqcI;wYF6?kmYO|Laz9Ybzr(#ZtFW}TH@oYhGfSk8$5H! zdc|Q;X*~Jzu!yx_m71Aemzi2AZ4CtJeJ|>7VU%oN# zR2wMZA~JOVBPgzECy4M?t)bCLIls~ZdNf_r{!SP1IB(M84%ILzy~bD9(*HdA;Px&v zu@El)q=LvMbg(M`LmMO2J$sksjk73P2Y#Xk2;tUriqYOd4Yw!`+UL$_sb_@=DZq>^ zABDl;Iw6*JQ3)6hJQ&!r@2P<2c>>mw9w#!XlPdvZmER17YPrdn^MD}y?{SVPps)f_ zL+H5EsWxcx?UF}zBxOd@8U``^wyB;tn`Z5yzCWfrCBxUZF4kniyJ^+g^MLSEzzRdr92t)PisemubqUO-c1GKD=hN#i**{;hmw#nIOlxykYatxIek+5 zA%YAO>-ZhG)pHaC?X5)|`pU^-JTWoU;? zJM1M8_c9Ax8plFuxxx;I=2$mTldI%!zcoj*%!}xuuf}NGW|S-Aa2AR@)PvPQY|S!d zMNhZ}yj9*0MUR@MHtS2k=}tw-lx- z!?kvh&f|;G{J5ZFL6S;Rl)bNuCVV1 zRDMK78KJ;PqYkAF`()2-5`N(M;9L)XJ+!_|7Gcnt{X^nhqBRpanM8SsTIa`}Q2LJk z+iJa_g!hMm#nnaA)XgeW>o@GSf%~MZC}p<#&7}*Z>g1V)Q&=8HZ%H6$St4Q{=fKNj z-7hZGL>(Lo{)qf%yV~+t<+;|rjHQQr?r^iUs~_w~)=qBXAdwdDP6eMO?W9jis7w&v zU)$H*N}ZYa-DIpI(aXFuyC|~deZFkP%w1V=FUKcngK=Ef=cKNY)KKAJ*JT_Boh6=_ zX>rt;mNdu;@tp6+ff){-^%KsCu}yeeulNjNC<1UN?DlJrj~?kw%mbvZdl7RelCy%)5ymo9{nf zwOA`eFRMY$V3?m<1cojI z7vZ0tiFFs`xs%lTFLw-B7fKb-@~IO*v{A((c4v_dw`f_9>&yDK!YoScwb+a~Zg2-I zJ_TtV!`Ju>YvVpx74{5b<%OGdq{=%*ekGY=PSN%55#D_8;MmO%h2@mg;!luX>Z-Im z2D1`s7(zBqJ*4?e;}1tk9UL+a#bwCm90*Jyh{cea4 zWQu&{RJXjN2jaW0;kspHx^77iVtozk^|o4Y{sA|nf9wSTl18)#9TEG2p#cDCSO9?Z zkG&u!R%SM4R%SD6S2reW2Mb3Qh4&ItifU2@s)mkBtmuITs zUKa&|cpA1|wFnivsD~3zJgZhkaq;%n^^R6-af#En0CfuQvd)jzqW7{(q+skQD+bRIH`N?YsJq&Vh24LLa-Lp ziE!R(wXzWggKwqmB-}H(K(2KD=*3ppcZjQi(C!TX`=32}ZxwDufp}`*2(!{R)?Ls} zj(eLdXA2U^YlbSjUkizj&JmHpw~r{aji7?!;e2kU#ydM%BVGjsZ%mW0GEU{fgppMs z68ZnUxppiyE4`}p{34(4-U|_sVT7kw6adi<@ra053%!*9hR>BY<-L@Uy95>#_b+Ec zYcS`C1dMJ?Ouh)B(%QUJ{^@L=yhpk$Sw8W!b_?lHZs|w+R;axBj#$xj`uM3L=ThHM z=q|#eiunM!bbNbF_X~$Vnt<=}Tl(#|(T+rE7j%jMz}U6Z+6H+BGC{;Si3@PeXUpPZ%{>z;`%>mbxZUSwt| znm0Rbzchzg7X)t#d5^-oiU!$@N1zPS0*pC#DRiQmi!y2$i>_BDL#B+rP~nV$Gvq?U z!g18mTzPnT(-}HwNz!lg zr+~#bMp(CT=L^l^ErIWR^6B?jy_Q2+m^!~(I7p>Jk+h)ud|)*TL5bicJ^|{NN!n;# z=!5#*lJ@5Wp@k;S1{#0v8)Q`I>x!aaB~N*0%yx6msb$DNS&_o?TsDeBU4O9m7Oe`G znY=Z2qBk(n7>hiDa4m&2d+P0#!LoGR!4&!NaWN3X$L_Al7JIefcL=p+XMYmIZ!6;I z2KOfNEFU3;Kp#r3K-5Zu>)+fM}l6=VnG5qU;nV?r4Q!|Sn&F)~Qm{Qud zq0WQ|PA20uy+p6O>llfzfkoG!iOT2X_w#=F)GH4KV;0S{#D2qh%pxpp^ZEQa>P-fJ z+$al`IeeyM682zqQ3@?zCz5F@m6MXJ&G%5a#9eFRr;#)_&17R%)w%n+V^w;8Bvw57 z9PzSla|=+zg=nXvwpv3CD(Lq1);pz!Raqx4A(w^+c`ixfp_mIJgCS^cV67scW43s- zZ^xfyt@&;tdfOm%a-A0yErSx->T#amTO!Q@4BPj^*Jn*RTw%3cfRyW6rP!L2&;H;n zy)vG3ym4Pi>)W{T#6}EYi}_b;-M#-qeAbI)Tw}MLY%=|^9{P!*KY>PB1EF9GN|1s0 z$U6C%yFKdTmk<&=EACh5R+O@gxiX5*qekENwfwCI zu(!}HbHH{JQui>WVE!mor!?6fabxHegZ90A z9ZiYy_XI28X>P2Q#%4WLBY(#?T$&UR3qV-R)h$mNRnYa=EsSZWHdX~@x#fc%!31ew z1BF%34=XM21zx9pOw-+Y^Qps`2|FD1R*%B_lFPe}aszoSeug5}e6J+;c{Pmb1?QMu znhycm#t_Yqu0rL&Zvt`i=gVJWOyyA`=xfFuZ zB_sBAgaL96XpE>`We~i60j;LQWmICr@_7%uD#K7;4>mZhmSyKo61tU%C?Hd_7+#=D%wZ=fhk}d9YTbV$!Q8*zv&^u0jm3swWQ>aP4zq6rPXOGDTFE&Tl>(tnP=Csbc~{of<+9~bf8 zj6N+{DJcb{aaqvlB#Jx}{n(H3T2jVee z9LK~CaCn?$@)zSA3N4e|=#av9Ra!cF&@S-3LZd2e8Ry*S$hiD0=tsrQ7Bt{LKWjh~ z&*b+o{v8$q0Mvi;S#FL_hIZy2=61|(UTzG`bo6v`pxr;if?Nte>;BFfaeq4$lD~ne zN=YcGO1e*gTqQ&SL7TpT(FpxfLf2$=3FsKAv(bqb{^tH}-|{=!g=Q33?qSB;u5M!3 zqb~U050{v|@Al-F#{+Wq^_$;uh_NyGD4_<9!Clmco8X%c-*rWg zV0k9xs!qCoC93jmoGqasJ$lkfFYCN@V6~a(wCN4b>u3I@xJ3f^G@MN}gw8xAw;}am z!_j%G}c3^IjO%&v;d?+vD1!xq1jSg zw}h!Hg(nUqRn`H3rcWNe1Ua(SmT2MOONL!jOAzAH^}H#yw@L;ECa2z~1cz&j8%=4yJtGt}HsG%_;NPwJ z=h5)-AGiOK2>(0azeSM$TMhs;eC+<+?tcOP6-fSj^?x(1e^ihCPNe^@`mZePpJ9Kt z5P!g8asL|jFGKNX+MiYV2Q7l|uWA3(=$}!4R?;6RQlh^`{fDmpjQq2n{)MdjX!keB Z|5cZ=JRJN#-hcD^g#E2Y=zj8~E#P-CVV3N$l$;7s8+fJU~et-Ynt$O$4R&{lC zRrjY;=X7_S>su@W0(Y9NH5B0P;pX9HWyQqG%*M>h>|y2xaVccyzRp{JpQQyx_sQ0w zqRX%)5oWKNU7&Bytyrov%HWXk?L=Y{<1V06S5S9-cz@qE;b9JqMDxeGHY--IlZ8Sp zBsxJx?b+aN0o<$uKSXQT9zie6l~eQe-H(0_G~oDaqDSkJSLj!8KXR!rhQ6>S(0{Ht z*B;&>4vVB$ouYD`wvmC`&VEy_4Q8=kmGOnxjps@#NGhE_JBuR+2Fh-gNA(fPn|I! z@eRH+RqR?|0_g1Qw7TzJt+<8+wm0n-o}UTdMgXGt%^~#C{Au7iU-*e-q)w>VNfcSS zm-ogRdAq9(RnAwFY|^hm>R&BSnMEw|9LvJ3^#VHUKEY$T7sg7y!bR|gdVw*^NW60! z8Hvs)Oa%5VwWWu{D^H`mc%trAsHqw4j!|UB<=Pc$-3S6bBYqNB2P|(058^dbf%p|$ zU1$%{DlP=2g)?V?I!~i`wTrm`C+Xo$M#`RO8m+c2lZ8DWY`+&`P}=rLC&`xIebNhd zM7xkUsg`*=g^lo#_Q-UCP?HpnZtgB5KeFjDqz6=vK9z>Eqsk47l~B&)9}n~p^3(+`HL|0}!mNqK_8NW0KMaZJUWAEe5@kOl zdF>1KhJJ!XZDkMP0t#>Q1M}+&)K3K`TLZK#U*X^Et6HgCyAp{g%8ATD=lRdFAknEQ z70~6kCp5V_f#75F^!KIi7Z>npsA$6d)#%{2gNG;&l}}R8WdX6a-1T$A{g$by@-(tE zu)pfs4bSpM13z4V_C|9(DnRSwhSdKLJ&dT(I2Ws0t>^3+4&l<``h5pl&};iK@eL28 zi9DnR?7L2yw4)5sjFDqUM#AN2jO-z7Qy zKti{?De@19^Tdg}qB-f|<4z{d&Hr%S0s*_B0lY%O7ro=&Lbe9ao34q=upj)qS5G3^ zqh`+*&w+{Q{IIMuLKDM8vO#Y%{ocA3c%LMO4=O5uY2eFg@Q!bE!xQpND*mey_)hxM z{Ac*6)RO!8#2J|ZI&3~G)xsUQ#4xddRD3;BWML5D1Gc2w%K2C5zmT}rooQ{8h6zVt zpx_p0oCAX>mH`tv3Y205IQ|0R3fuSTVT9a{V|3L1h6Pz4E&g0q?hL@Nl`n``> zgK3t~#))_hQHH+UC z;4NRj>dMa3*&hyP_;bjlHQ`|G>M$6K;#%Y2F6XZwJWi>BaI0Z5?0|e zh9)Wdn$39+dr0q!@G#;ZKYVj1N;2N(Y8hq8%Xn=zC7v@qSm&VByzGJ2m_l{HizSHr zkrag55^~^ealHlGl(uXr0HuJEJ=zIZu?EO)>4gZHH^=sw_xjvR3wHR19Th*C@BcD= zhto_^B13jomd-$qP>m-JRmwIZAY@A7u%8n&9Xb0T`11!@9>U}5ww4odneME zcC1O80@VaW!SAp4acU@z=X7gc{I19mjH_gsWg%RsN5M7Q4(*SAmGTR*y~FwxPkYb$ zC79E0X=AgF<_V!<#hPbb6f|3T-;?2vgaTOdvtK-JcR!MSoY-V#!X$1x!lvJkudhqC zLAe>VND)089))UDkMwH5Ik2Pjf%G=+vP1^GbcyUktMj6eYSzSfqlSY}jrH?RqEO&l zPTs$^?(yyLEfUX2G*9Qgb>)&i3{-3@7^K34Hv@;!nIhr%2-93~-YjB!rIm_a>E3?4 zm?e>7XE-I~@t4j%nu}AxAE)y}1vc9F>f1uMLyd- z9N7k*?!VQku2enR=OGNGI$=W~F=(d336@Np6cVzcNaw4h_Lr*fRzyRv>is4yXuuW0t7e=uWmkj@6Ia$wH^gjp#b6c5 zyI=`wg})u+PuQQeUeSjLmDn*1-b^>d$P=%{8=4)6QO~unzP+fsfYdZe(Th`{Jm^HF z482l22*-Ves>e4)%7!g0N$UADd4bY8#h5v!GK%y3DQ~sBuT*QAO862Xf~08b8Hk51 zHXK3@TVj`@Lh3b*YZLerufXOB$BEWvb1Xi1sAS3&XCzsoMVH*u!`?Le9qz?jkqDKsqmqS)su zsTdz?F!VN@r4~xQiS;hRmS+8e6A&0&kQ;7g6<`SKoce z&vg-xq90FY(zjYhS0wp{=66<+Bq%IQY)+3!0Bz*-#C)FnyM+;-e^2~tyD?oSv zvH&hsYTn-ymuZ1ss5jwzAo>_|!ISg)`i&2mJ_S_j077T)C!%&f0F?f2^6&mL>%F^e ze&iK6-vwU5*CL6)`FZza9{!3lq7=Y%-mII~FGt|C3uop90q9@W5x>i7-gbSK0>SAGzgP?lnU z>2A1xAlo^Mg`oZZ)KRUP5GO2e`(O)2!=WDznMdmnUaMe!=!*4@IA~Toq@xE-m-N;} zHvvg!#RlvtX+w6}a4obwY}yn&Q{kv>q395SekgZK7W%wGjs8%l%ZB2gq8HQuz$8%U z7iguWb(`v7B*3_%3?m#%^}!b1`B#8NCo+sdNHV3S(F4!n)FV%PSWc@8QB*tYJE)4Q9% z+fELka;gWBnNP2*&*hcX(Z~NnC@)LsR)R54rW)MNkz}eEnVb@>V4^C%62hTK^*~3@ zvVi*Pn$MA+oK}PK_{+TbGn915L%cLl4XuKsax5iX)**NzaKy|2ZJnKz$c&JFIP1_r z1BnItvFcZfAJzK66bCs_PWiW43ek#TXeCx0Da@83CgqODpXry_T~Mcrd+;5`;F3v(N6bHe^xSF4*9P) zpv6xa?j6eLgB#2WCN1-%CN;S4IAMzCnJWEl*HyIy(d@D>W#QCRvk`8$Vo(ryO_sJ0 zH;#*C5SFfbtyt-nM4?b@R4H$v<{JAwZqlrT64{&_pKQkh61=n#93j0af2}Ll*lC}o zPBrM$7l)HC;kZvCu~iPKr0_p2g5sQ1DW6*wVE1EM;AmnTAuxtoWW+d63V5B%>K3RI zNPcAA_~4YdW_B)5R8>&d38

n05vydPe+;h{$u7?$P|s1qIKM82*AK zsaib;-8D!@>g|EqC?|KB(q9u_gr`5Hnw|DCM1lmh6IKs#8{+(fp>8Ps0{r7`Pct6>;0v%fN5t?!wWRn%pde%LL^Dfsc&A;$sI60J8sm~K)^uOAX_oMj z={X_;Ck=*YPhge5!^T>a3FN`>yS4ETeJjD(qj;zRrUmS5@j$(+%k7h+r!2)I0n!~a zl+RoUu^ob4z%SCWHWS3U^Yl((Bel^?-@ z8x+%RttPwJ&ac4%QH4i^3pk^Bk93CBE8h2q_sgV6eA4gD%_We=@yBwCdtSvE_E^Qa zJC_LX(Soxb&N7y=2bdRyO#C@7RWA|-YEo7{ib&L}AF^L>H}n7T#wZk-R648Rn&(u` zH6FNF<_PQ2aZII=@8+<@?`!CCS(yt!2pVwK#}D6T$axfp?od<72njL=J15!x?9!FV_z>I2N-?GC)WuDW79~(iQ8A`(+F$d+2~u=Kp3Q8+I-^7UhVy zS4+!YP&HX1gHgx>ueBYtYMp#j*l5=Dlq`y~7Yoi(=+a%t3;hLlWo1`ZnGbf_pU5*? zc3d}A4eNW$gF=z-*BRH?Wd2ypplsCEX)>EZpHKI zExk(}46iA*=!-Fpc@u8*a&MJGTRpTPb1`e};-x7|whmt!a(QXpv$kCja!MyB)nWPb zd+QQezs@`ZL97cTd?zHTGhUFs=3exVv& zVzsyt6a`A0sEzAOJ{ftbNLU}GACapHTwi#@a`T*u^Q~BFH^bnN7^39&p-oay7$N1V zhD;q;j>D0;BJ}c_lt{a*Q;(6P-0?t^jks#UV9P{H;v%tfG$dI@&e*F0mr`!XrNkvl zu|B2xz9b8vW1@ZKV6SWN`Knn^UoUC%AjpbXiyk7c9dbfk0H1e}DfL+76MmR-d3gLm zId;>cN}AtUN_ImZKBgYcvRHpCzvdOvlHBAXA+efw@Dft_ls}|xFo`Xp@M5#iVOfc? zgi1tpIE$mJ%*Erh4imjZ4^6Xm(d%vRHHT_osD}tuUq0_Ug1aV!_b0O0tgb$-fRYun z1k;9*C`s0(aM8%9oN^F>GN2%5PR7BmS;p(eNWUY6dz7A=GJfyK6?*`I!g3HUO)X(B zog}@DyCi<3lg;&ENxMwBDO+&6YLx*ot;$jYNh*auBpN^7dQH5~o{;X*-pa&+B)xIgB`(BYq zo+`uFy$IVN(Hz}Da*oID);=Vy!d%0ba&dtd$$ZHGzLT5dEHbv9ySoZ(`TJx^t3J5? z2Um#k>_w$zkne^ir3w8%wVxBrc?108ziqX(tN1RyYn50^>Fp=m)x_O0o5))x2;n+J*j)`qM0vzM+bzLRb85xj-72LNCI=HG1Sj)`v`n^?I8p$dULL z2j1_O;Rap@3bVp~ats^5s7?VlMmg%{xPfbvz*XFG5inecz}Zz&I+DQ2lUj7vcNQ+FP6p zi%&=zmUH0C5(!KZN5&xfZg|jp`H0=EryKX?=IcXty@sTaVPElxSal^{+Yak9UK*}g zv&7&b!|cq<2~Pf6cF40f#SV-fgD&^xWR-ip?QTmf$6&m9QdW)ma z`#RM)D4e36_wL9^*D)1bQpbK@HsXsD4pWNsUV)Z5STv%%neL9_d|7La{qyI-!G?n6 zfnwcD3!6>6oErHNmL46g^cJ=U68&O@XoM#hr%X*fM7Ba_i@6@2)zt)aJcO1o+L}6^ zvcgE5uWZymn6`9C-`w8FB@+7*=C8s`P#nL)Lg*L5 z-KxLeypg!>ZJsF;@JuC)rkLBhZU zL%CZP`W5v|KD|P@vL${@OTWUlr;a1DX$a@_51Jcc*Kheh304*N*C3WAxuZQZB-4h# z!R%<1IwZ$irBnJG0jgx`Fgy*?^(N|@B9C?Ybj8-0Di5BuNmPSJC4DbM*%4c#C#Wk8 z`}a)A{x7Vij5)}^@jJM>v($CmPbrxoT}xkCJ4JPHLaC?DRs)HbSKsb9oq~FTtm8zr>0bJrfG@J@j`dvW9rm>|4-&Awa5JjxE=HBD z|HyugqBzt@W|ikN`EDEK7+}WV`gk;@E7|E@*TV&Oc>(5}<4%(q&(M5Dh^0)5YehVo zA=i7_5?AuSO3Qqh@n%;&s+)he|*Cn%pnz2EBW#Fpyi0ByASOzN0G5LchFLhTGz! zrNtsuSo}nd6f)7sUEDLzgfrT<@cxsNchsD1@Lcbob{yw+1>trSxLM46+}q&Yh>FQf zqhI>F6V43B%uhmj#F|p`frAzU<;;pwR60xDlrssUu#Sx^#Ehc_u)cM7fP>n9cRE{| z2k9)rEPa=vrh9ss=&5fC6ct-NMLAA)0!>p3CC*J&R}sy9Xg<9hOlhE&hWLh7nAHHO zq|6%3_>O>DfgfJjeK>g8SX4m9RG6|)c{|!5`(dOkO;-p@oc8buy0mCW1f6xj{y^g) znQfWe;#HL4YmvZ^qWo2Zfs$pTS%mD{^R3{ZEs`m9f=##@B_jqOT;i&0vx5qg%s$Qp ze1&_TL6C}S2Vr2Yi;j+_3WZkeWM0!8*O5}ag#6=eI!tzqlVod4VNy|ynbK^+vZGGn z8Qs6Oz7b8SGD=d7pMSJE?x_$u^)Rkeg%g&a<;ZfpWa|5o_)m_4v)D>@!P9gugkblk5cFe8E(>EJH~ehg;9X&#Dsn zdvZud?DtEn7pB-Ov~l!1m5oLD03 z{XPo7R_>m5lWA3>qgC^W!=$TU`^(Ti2)nQ!kKikAO+Bqm4|@ggOzNa8!CThIEan4` zH->&t6m*azbWlUlIEgQco&IHT)&bV0{zjIb0gWe=Om^^sh(a{EeAYs}Lbw}&Q=Fy{ zRJUJLF5I7#tZl{WGv?9Kp}M8)i)wpL8Kuc7e5P6Eur`k`S`it!oep%Bd_=45OZ*Nv zXG#%zeS#O*-#9NsaFyK1VPO=twPr22{sFc3g?=!9rlk(PIlo)biQOV@Iq^LlMMm6)d^idkWT& zLd?#Al4m3N*m-?(N}H>ynad#iV3JYGvRrg0jjk*kZ#)$;7NQ1s8+`{P-*0`X^b09^ zYD>{b#(RDxLsCW^tbO|a;8}x=2lej@?BB_0b+pzH;_Ai}&uzX0wTXqX`@Lg7)$_&r z(&y+6+Z$(WGCtZ1hm2~DVtk4%1I;m8zgBWy1lLY;lNj0o;bOLQjxZ7ts|Ho1c>>*_ zZ0Wj?LS72Ko<*iDzsSecs(HVxNqbB)O2)h5uNT?x= zsTH>&m6#=4(eG91OPhwK z#HD3hSWYBE-|-9<(pF{jW@*VFp9qo&}jC0miRz&REN!V224>*3jNUB z1e)=28#hYJalhNX%Ugx7)@-iF!6}cuHT{O>JbsFnBcb^>nZOBp?d`p~!v8)o=K)rm zN8Sm7+^u1ZHkRh-9cyj0M&<;@QkWz7--*)dWav}!G6$lvSp7z2L$-ttmwf38N)p0Q z17u_pJfW>$e@Zoqx9AooAX%D;?jc~FN2v>sg5~BY2CJ%|pmL?yIbyG)aP#w9^+53= zTF80hTUk}tnHjqJUl*$S7Zdts@8HI?Ds-s$`=>yjD%aJhoo+<*XL|4JMYHZe!8**#P|b=m0l38uT+ z=2KC_I_A9@_Bg$ZvK9Qei1L(hhUbV_>xzw4|1%!vF%F(%oeb;aTp7zF!dPMPhut(f zD|LBol$&g!tKZ6ktGTnv!EG>zS6CKZYvz(uW&kRmV_2GAGE$DOC)9pg6y6A;E=COR z4fS!S%6=!`^vAuRPTllS>dJ**2?JzT7nzS2{k(hYi}i-V{@U1=0Sdx=ui)acwrL+$ z1hhIUOml1SM!skQSDr_9EXK3~v3@Ux3Rx-{0e%!&wkJWj^@x(uMQ)q?(5oOjzGT?X zT{zi73E~Ajmc~4|#!)gC0yS=SdDeU?ay0Kzp+xpRwbueMToOzL+Z4~jy?Xb{j8t*J z>EOBh@K{9T^0Vb*bLdkg{vG>eIpDKh&e_S{hwb5sCks$%2fml9ZI51q#{V0qK=CsO z;j>^HNWKTf0|g(Cfi)mE4{+xdXuan8g6aieexJMse4-!Jh|AR8(!sXvO>*;&*l}MR zzl9opimG3SSv&Y2EFl;Ygnrt2wE)C}5;FPn>Ndw!2Td`5c#I*Zb}{^+Mn)du z>&9ZLxXoTa$W$H=FknTqW4*g1z^aN^#t}VQ8#ITbfRy z#<#*s7;rJ5R@AwW^)31sH_U^R7kgUZWdij1DGdG?wmYpdtyuXrE}g#cTk_)%5XSS! zaKX}_^;Ji=_9k;<(a5-6&rZa>MLnF1kai3KyU^rgNuS-LLZyTZzZ^rEx>=$hcRslN zX`MJ$(D8><`W>SG7`I~MZTVLd?f>N&b*Zo~MI{0K*a8Nc)3#2FlQr^O|8R=tdxWm5 zT1Z(Bw8b`lHJOZ7ROTC@0tAp-CUAH`3J0U}%!Xq;kclf#rp-n&e7>)fr4x0u&37By zehE?0q7S1IKcEQLTl%cw_>mi^Bcg`YcB8-F-RQF4N~vl9GDaG6J8hv~%$A%b5S4nO?MEo;c)3`DKIOG@bm?N$iKL6f$^6S;;8wEmI)*`E2PBwUkn-h z3a455$M*k6E@=GX)Wm5>%@OZEmoP6y+Zc*=i6o(GokEjzdm6n(H%(h|_EvSC{(rit z`eFh#{VHx@P~WB>s%r}WW!9fPtNntSCdftubvai|eA-4Aeoo{eIH)Zz?G5Axs9XV~ z^9&CFin2)Fw+A@u7p`~a&jLROZ<cuf3rVP$eo|t8o5#?xa}Mt zoZfTCtKr_vT3?IAtqn$x_bg!$knorUV>C9joBB@8X>{-{!W`KmjhWZF_ZnbPKe7 zWX=Opm)+p0tM$D90hPmdz~E0-%`@QkxxKQ!>Ojt7+qgs40^FsQ3m(#`_>O7h|GzEm Qw7?*#D`hAMd`O7@4;k*Xt^fc4 diff --git a/dist/strtree-0.2.0-py3-none-any.whl b/dist/strtree-0.2.0-py3-none-any.whl new file mode 100644 index 0000000000000000000000000000000000000000..a650d90ce74297798abe65f828b3d154d05eda8f GIT binary patch literal 9398 zcmaKy1x#Ikvd1qj#i6*nySuwvad($nDDGaMP~6=vuEkx87x!Ylx41jJ?t9s{yZ`L& z@8smAtW1n}oQ<3&PrW!xo!9Er>hkD-G*s;&!K(UM89^eTi z@BmZS^EeAxOkr{IP}nH?FtALRtSf8fm(^K*0DvhF0KoXC2z~_GJ9+*I--(E0BGG8lHtM|?&~8uO!QKEQ)q`PiN=+k( zI4clZ3d{e+(IU<1R8@MKolC0bHZ6NQuPRWtH&V*yKriG$g3`7M^yeHcE_Oe7eb7Y( z-7lL4yy&n7;XIw3rdjhadEH+h)um-u*REz)+ketg?s<*vFJC_D#z*g|Q=f0D^OJUQq$Ka~UmJ!S|KH0%J5n?y%2TR-VTe%(^pIp3;U*9W< zs>3FJF`2-5CLbN)PpBmQurD$@E(RTbV!B6cVArE?{YaaW@M-2ARO*dN6Zj+0@wBkE zvFq@-Zq;VyOyG5YxOMB;I+b<6 zBRm!R-m$h_@`Sl-c{eG^SAmQudRs{kTj1HWcGWUuFDG^Q(2Kw9h!+gnZTuPg!9Sv- z0^yxgDqGS<$EZuKPk)*N|2Lc)M6+p-zdrVUIS64`S{uP_hL@#}5oQa)0`yfvW=lJ)`?q+fDdQT*PmXn8iz(Q{$Ay zhou5#F*korW}Nj4gnFOMV#-0XbCGqYbHi4nQ;?I-x*9`u*_vnA`=v+AGoAjr#xbTS z{7)aw+F)opaVKWc0YqpZ$yY+nH2d+)&_zO9ozzXVFLPnetzSX%fQPV@(DE*(m%J`Nk!Jf@AZtm^(+&^+t`|wHbJwrdAR7evV`dO27ae5p>fDLzjBCA zhNTR(XoSlgY`{H^Nm0@Z`E2{$u>@|zJ9{E%(lhI!5Vl+ zg-g#)$Z~Od;|1qZ0=G&rKWX`KOnV8LRKv3}l2xTrvcPi0PIhubGf^Q~Ad0^uQT&3% zf4zaV< z6BresP+logxFξ-xjy9KhHVOKgBB!f73F+>xjo?S}ptUKE#i&c@7r8o?X)n6#;$ zkl~UyM63RVUNPK*9r<@sxrw%F_N@pVaPxz{g-GF@2%;-Axy0-BH0Q1;d<2fl*<@c4 z`$&wGc&hnQVq^@iVv60nT=KY9cC^LogxINSTa#7vmZeL%L}C zZI?Th$n_}ehJE<}SFqaGxn)wi4F%1kmha4&`vy;LJbI%(nmgsnIHf)%FO^hUi>h6& z1OY`xc_(A68<=?ncV)S@gw<3t-26}Q;{8o#@^rju>i##Ks{SQ=^3JtS{{G*fT95-~ zRX$XrZ{!aVCj)Oe0$7c+Eq@zHeq20+ex$ZOE!iGUw5)m#0lVbV^?t4WVRfa=O1A+< zrfp#K?s9NJu-c3VQxXdnCTiSNHfrw9$HtTH-s9@khBo2HG+Ka;3aZpl&VeQ+qRC;r(C6iGn*yLy3e(9GX21c#COmph0WvKYduXcPQ~b^K;x)P?NWY+{t|^ zx(VAL`}#Re$XAl@Pq#x;SAT_ty+*tkzoEu0AvYyjkgMQQ@xE~uW<)&CxIZPDgszdz zl5cjShHt~FN!@E6Pk@#ZRQ+ui#z0{=z4ajLjBE2$a)E9PDh(B)cYN^D!2GzAU!$8m z$y7O{aw7Lt#|&FqBY%uZx}{SID)7sUPs6WMqEt&hjZB)kcjY0WV7I7ap`CLAL@ldj zMdb*~Nq=$w&_0K4!cD zGlKjw(9y1bnu`ievY}md4nC6-5+6pH2Mtxd`iqK1u|YRzZ4`@{nWvjY+&dHs;k`u# z|NQFe#>a1&{>;c0zK>i=Ehm7*b*Ht0NXM+3o?KS`rbV`LAfl$(H1z?5n!cGh)7Ob5 zyE-2|Uq*Uq@xCbOeKz?q9R|PXk#wQ>bBd4Vk9MNB@k}s(KO#?$n_|xi=Og5rqVkzn zk{Y-tRfHB?N|UNtB=+EO$TO@m*}2uYfv4g+K)M~}jD2ELH3uh@UE~$VaV5v9OizCb z>e9e<>9OF!ANBZQEs{AbY+6YZ^XBK4Br?qwCG+;-v|n=r`GK)PSbCkk8Ye~@(SLBs zQZ%hv`^!At&nZr~-IOGYQKM$-b~vKGk8WB=nunf^<>r((bdY$o?meWuvszfg(Ef}e z7UfvCZf=J{6>i04@6M$I@O-aB;~hRDu8Msu$m;p$y)AoNmcJXr)!oL$O0dwvcRzg# zlq6^Gic=uhkKY8`IQ#u~zjpmfN1;TCfZ>8>#xA@Es8z$+$6f_Pe&&)Yb4l}XKr!(CLDR-X9S7lXKUubQSg3LlpRwpt6_*-){N&+4 z_RILmZL=n1C7eB^Yol$pP*m@ADV={S;oJR}Q*^$@zMg7wmvsNhHf%Rm4O*zOV41 zgEYLA;G9C%v?%sCMKq|inm^)Q2weTU;!S9)ClCvpyvq{$JO!`{G1wBngyhnx|2r}4 zTk^6Bwf$bj6W+4_gGm~Xq7rJ^?CF@_OYGw3ncP`ZX3lPNDAVQkseI2ITNBE+Qq98(0}Rb&Zioke1@6_sjXlCBoMDn;5y*+tn#rIG5^7qq-A zfGstNm_24{fN^^qf#}&NR57T{Y`%pom#MW*U6LVOJPA<4ua~8I$3@h}GhKmQizQAX zaLB|^YK5~k!QTUV^ijL2O`f}^c-g9-Rmc*9*vJ$jsI*G7&I^oKe_fZ1>v@ zxtD8rs+XEM{!IK!>4+5LL6pBW6MPKUPF-idsvaZbp4VsZwfdjrdV6jU@k^SIJz3HLYMEq6m|W=lF}+oeo`_ zgwj!riH0wNrQ-1rYk!D}#o8OEs{6MRhm?Yj+ZtYpcl~MaAQwNjmmJ@~>E`B~kZ`?I zXV~(gTaCYDyKAre#uhfiAe@_ZBHEaf_y{kh6h2m}J@1UI>I9nfPFU?i>H6<`%<(cD z2O}p@7IRL9X_}k)^;+2i0cRo6$WGsvkSgGXXpO4BaI@uxdLLBj3*>5M( zG}UcNu?(>5ZMxTzsL7q-lEW5F2YF@V!ozwxf5RnQ;3t`cxm^bvA9c)y{yI=8>lPY# zdfLi(DPUo%p!l&U0=wNByzv>C^sVCeAkE9&i`htG#J8l`)^!STv2Q1C$7~)T>2Od# z#*z=5hD?hb*0#>;VK173OCw=PseZIDs<`YkEHDMvYTOaXx=lUhy7Zd1wN*B+WWh1C+&PvtRSr%4)g)q3B1h~2}vXY$Pv zx1;Y!o@I&SuZYIqo-5)qh6v?1*v^H6E2p=!wwFk}8mQx~frJ$oL*!br?C|eIq~kw) zF9L3Ed=mW$gl6F#d>=S94j!ai2vX)J4w)h5(Z{q0Pd<8;S>iQ5FivSb=BwK>R4!%9RTp?kIu}a4aTs+#6pX+Nt8b zWiEf#43?EVPny#W*YUhzcFw9;{g^V=a)28e++a;oe)}k!5qV*YN4l*!$j9Im1`S8M#f3=ex#l zjDrzm*tiE8-do#{nYeVHq-Eq>xQl6q3AX-Rv|an(E6ol$5U%{ap$J5*>LVF6O(V7T zv3@K8O>UWKMKSz_ekl9oh)W@ezfYJD>K1RF&rzN+u9{pp+;rvLii|zguq?&h$L72} zIZp*O(v6hJQrM(Mlz^3`U7s?w@=Qm3D?^{lsjaDCs=*1wPD~f~XJ~7p6awSc4O5p! zrnJF=^h;cQcb^7Tn79~ zqk)7o>e}*%V@c0ig~VmC7$!q=+@~RiY{^vsD+F*2D~`kHQSSe0o#{oR3%@^~USIsbq^4@bdYtiW%U$EotrG zuwtV6iU^;sh21m3=i5;VX2FkAXQ1-x7XWXoJ*c z!hV`+=vm!BzZJk2FC&1Cv!})(-@mxMgXG{|2~6U=e}%PWc0A;W81IGOYkd?QvPx=x zvHrTEfgE5p6H$0Y-Nq&6p1eQ`>77H-@S-lGdqnV04r(m5)};?_1D+cYW+Dl#f_$kA zk3yf#bQ5S1UO)2M;bi2hiwdK4c`ip~S(noilt0Aqk$XyH(X(xt)b7)aV7F!Y$f|A? zI7ge52T?fMS)Zz{Q}~qD`f-v|Qj(1KS$#+b;Ot(Ub$%@@d6(hzuKFe(5=rVx8(D6M z)|+ifI}}y!xT3NVa~t>F&^93YEJ-*Ir-bN&Pjhm6Ljo5mzr9*!{G6t&J}~}hm(N`_ z+1xMf(kxuySqLCq1<64(u3Vx>b2$y3-cVi041f1!DhT=?b7=dhO}#N!q~TC#06-QN z03iFv9GZolm6Mg7)ym!z$YSqebk~`5hS-Ol=I1Xc9jRw#eUwoEzwvoNu>C2<>5=QA}g6mGrM3$UbHAONqRsd%%y-<(^j*%|t2&fwh7PLPY#33@J! zU@N!}@x0S+V@-%j04bZ~BkLhbzN6G!nd1Xmfc#~mK2@Mh}4F3OG)>D1U2W@C7I zps0re_wK8rql#F5J582LW_U(bAr<;@J~7F95ke{CsHO66`LAUZ9zjK= zBkNhvI;^>3fm6G)bFac^^bU0DNAAvF56RZ0t7f0K?z(%`J4VoJiq(J8k*He!IDQ7@ zUK+WI+(&!Wv4T;`XZE%X3b_K%h5XhD8TS&VdXr>5Fen27)7Ng7d(;m>3sK_(u~IDQ zzJoXj8d9bEabut0-|6o8CH2XIQ;i(^kcJhz;o4z!U4Ew1H^JVYDPDBIR~~X{Xt(d^ z;aF$YacPJSVnZv%Bk{Tx(COoNcG&KNeTOe|nh&{JM*y+Rl8m4ltQjU$rc7Jn zI5pz#hVmTK7WNNWTpHA08bU>`kZ6+N_vSVh$(?j_97@K{(;X<36q6@3nfz(-wIS%o zvJ1jcWzs4_`i%N!vTF>I`$M69$)@&p+vf+&{E}xMr^N6n_L$`wv--3q?jTXU|C+v< zC?Yjme^NIH82}*vFX^iyqb(sVp)Jv^Yv{VpixY@f@a8rvI;6@xtf&iQKeVv_Q35|t zUGbwvMuYmZ@_G)9CQaqHwfeW7Gx8XM?g?wP*^bYVJbpEv9nr8_XV6tpb$by3-TNdda5mm`Fh0+9`P{v=Z2vj6IaCWKsPJNJ6~H?dq$+s?DQ6 z^z@oAuD_ZwdPP?93#cXp<#8D1WIfB^8yQ|@D+gS^ZVm@;Wf^Q>~(dO~Q?{XMS$2HUEYNDKhLN`VfVIpYkCzQ@fXoF+b zW^4iZ)Q(UIG9WvW29tu@inAB5S|@cVSPCLz+z+}YiOdNhG0fC~&FEp?mr9iY-vvF= z*|?wX&zAT(is=SAZbd~OWc}FX_;f-P&o4n@(i3>tO$+9;1_{&Jk)v^Qpyl+vWpfO8 zHAtx&6EQ~GkKXbo#;NpB;W8BD%z!>vg>eSetDPgmy{U4Oo7PJ8JYw5Ea|K?dMpJc4R>n15oYG_JIX z6>6Yb{`^rSN*I@Q?o1V__52xyR_O#SMpaU#!PhzwjB}!;6z3YLADf%T8gwEk+9u>B zqc@oFOyd**YeaDysp3ac*VWtGM{|!B&%BDQtfJBijZ+@C=n2JChlnt1&nLNEB}z@| zp;(6^BCeHGWiDGe`7PJ(H4rENwRti2O=7Ve*J-l4ThS;--WZe$GZzLm&bg8 zEy5;>_@jDPabU-kwNde!{ROxMaEqw5hwI}y;kS~QFXnjKr7s_ltsruBWjc=g;-;(zLU9Ee#aIW4$?_hIF z-P!N=agFNQu4tY*eTHA@K1xl6db#*zg5sP(kSmDph~Q%EQ2p$e3G77WCW1q%J8C)f zZW(>kIZ^Cb(x-}m8va_{mKBE&POz+Ay0{#~BI-cPInr3P(*dkldO&Rk<%Ysiw_L2V zFBT;m)_C>M3c(wkFitredr+n$Ge~|)wk<3`sP+Uqc^;l;N~yji;AQw$LviW&6>_Vc zh#FKDtL%BC8!O(IQ5aIMY{(0t^OIx2%W-s%9`@AM%7NoLCEtTfAANZ4$WyqL^$cUD zw$g8YXINBf+SJPjD+sloW$d9vq^f)xKU>1Tu`HowtlE<=KBn5IFqv*z5;6fZ5%~}9 zAbti^Cm;`!55lM9BueTr)9aiE+STAq*{Umprrl^^vYx|bEG{y|r|!@!sc5l*)5&F} zs;g;ZDRuOe!^+yYPGO({BC8v=f31y>qJAF3KQ-}hH_3mgjUVJ?WR&6hIgkh0QQ&5c z%V#stI5|j=d&D8SlJd5AqRxHt5@}HzqGtiG;$Km>ynhS`OkIZ$IA-9TM!SdW9|?;b zrfBudS>Rs&z9da(4SE-aK5GyZk$A=WXBy>;W&E#Rjf&%0{3+Id78w8ln*ZVz(ACY< z$=b`>i52(>$i&LP$e^fl01fz8STfR}zuuoc2;4s%4C#M?Y05~cX-Wsoc6x=f0|2v| zu1JVDVJIXR>e`z7g~9I-4k++Lk_&d0+oT{6i=Z8}^x3pld%^gkB1Su$hAF@p4X(|3 zfY+sK9#KBI^5YSYsjdL>4H2)+dR5Mk+ho*IrfgL|J}2^-d!&a#K?AePQ32KysHJf# zP~NJ*@Ru+mU!B^MLRBZ=1^giR1s2ynmr48!&BF%^eqA#GUIs+#SVmC!p~0ef(>fWnb8+NUUYcLb5Y0yB=gZa>M`&37bd!Oe!lT2AtxGiXpa|$gGwq6118aM{ z@s2|z_xg_GA-yh^EIKt<*jI&ukJvx2^DNSCfz4FH3+oxj3$$GE1xKC>C+MLSJA0Q; z=~6$TD?2B$xSlX3P3IG84HDq{_TQ;1K|$jH{_}RqpTPX@X$|??KW(Wi!NLFSe}q35>>oAe JQ2y=he*lfrS;PPU literal 0 HcmV?d00001 diff --git a/dist/strtree-0.2.0.tar.gz b/dist/strtree-0.2.0.tar.gz new file mode 100644 index 0000000000000000000000000000000000000000..533cc7b0a4f227a784021a4a1007e7a2e918df4d GIT binary patch literal 10490 zcmb8#Q*b3t_$U0>wmq>Xwrx8TTNB%w*tU6M+n6{L+qQYm{x1ISTe~+~wN+hx(@*zB zKQ~?9Pm{*L!O05-SwetZ-CW#UEG(EPHoiPus3j;5Ls;P$c8=ojJ968Br1#fk;WP z(7ZLC-Pne3JRrfTlCu}fxCX|_U(#h{x#39FH;`pkq7Tn!lGx9LS=E~3vAhTMovH{2Z!Uiz&D3F zr@CRWhE9_|=8O*SDJh%@FLv|P~M%kE-~T1hyc zwkT&ao-^(D`9V#!EE?C64d6QO+Q~#=YLXXL8P8D>9*7-ZBHa`<_GNB_bP@OW;iO#c zJC1PEp`j$BJBXXu8+)j?$qOTC+`=CmQW@w*VA^cmwlhrv*XU3Ssoh5&fbUWDvUb6fG7O1gi`!b?kK;y; zQV!m_28XD^+$84tN8Tnz&Hu87qiO6M0ei+6lm{~pZ*Q9y+gl_!1fsiKH}^SS8&u3g zatQP1MBXGyxlmC~v+QyEe;ec*c~lrJcvx%jhO_s(l@ez=nIu%y0`{IItkzLE8l476TeQ0Ci^2QZaZ(ol9-4L-gVaM#y6le2_g*L@en zPqP8_^{FquR*`V-ptCTyN$1z2+V;nrLSM1?-8>@FycUH04PcKW6 z*1Nc?ZwQv7C&kx2uuDBU_gzs~rG_Z;)3dkNl$}d%tD~8P!5b1kzgAd>%RaufLwC`B z50tLncK4=D|4skiaXDgeyfc!MLu9J{zV%@z9Wz|ub?$RKN+S)wbfgu{onB;oey*fN z;C0^3vg~WAXEe{cFs~1yzeKKB5+w{Y0?Cat>mR3LWJL49SI-Jxbcv?!RY5T03Z2Yn zwG%D`A-xGu_;*DE2y3oDA1Dkwy@a`IFR@AkaZdvPVc+BSfO^~qQ1b+cqa{Minlk{r z2$QM}#RmUG?tGr$9}4o1;SUogjMl zMis|?_+i<3UHxvD^+2C+?^Qevu#0-h?-hjC5M#N}(dfE$Ms`|_;?E^m^LG+!nZuuQ z$FS+Xf|9B36jVd?ZNEflEi+x*HYm3zM_>p2|J-Kpl&AAT>=UaXYv#^|B*uH2EV@Rz ziR~v4)}<<)1(tJ>^$yzIBo?%9j!mU4G9$zE2@VF^UU?P%?KC;G=K`05J0Jgz9P#CG zw%tjV{*X=hSr{eC-nk4W`AIs-z|a7z;2G7>q2_Zh*3;t^d{O*t@7Ap5Gb05rr`UtS z8!1OiZK#EdKS}`chRrt7mzc%<19HkDTO;%;L@#Ii*OD)p(^iemz|*$PSseK=m_`Nu z6WJ30{GuJ-U+nFZ%i0_qEdVas&T{k6F8jx`e^Dah1*rhx`F-&3CPO(}>Ord=hJGoObjP#7rl^2Sgp(?%MGLfemm%)qLq zz6s8mw@;uEFt1^O*g-ApV6=pixYHjfY!Zrc@s77Fo+hLv*L1|iTc4|UXpFG-0cc#X z*Setk`2EplVoMremsy@~A)HpSJVeCs14B6NhQZ}*djsd^&)XZj`<0>gX72jeQQsWV z4dHF<+sn7vK;R1>@cUEs*rkl>4vCocvQ(F5!RVRP&*qnDApUIIB;Dl;evgLTSIJ<5 z9`;)$BGd|eErCCtr_#=*qM2Q2AY!ln#S8JpuSo7q%Q$iZsZ?YYF!!x(9o|xLe}a@k zAu%3OV%s>pW#f{)V@OFzh+-!QMZ}uSUx%(hYl0!9tGzih2BfN65+89rCc>H#oz_^* z`LnDdlh1iqI<-04EiHC}8bz~KEgDB7H{VStgVA12LG?ljH;dzB65W1Ck@H0z$5!s;bm}Pbr7<*0vW4wk!C&Rgzt%KXa_;AKsR% zePx@Ik-a|vqA5MTBVeN`7>5pfwLMWW%u{Ia=|8HhC0ioSpJ15l?ojVxt#9gse;1Lc zhp`w{I+B-6AEE zyk7L4!Kzszb?1Me9OWU4Lv5FI;OHGeHn;}SjWL4#jD>i6Ll|iHS64wWx8K&}$kd zaCb&1vfU#FVrLFq_%Kf-$3seL$uWiYK+gIL@ZSvfcnLSsux98q8N3!IPO|GZ-m7GD zM;#((9;-8M-u@i-ZMi^BnzRy!A}5I`|C!ZF$eid8IX2kQ?JRMbSTx0Vhe!d796i8i z*?`A008Ym)rYFQo>l^YVx+Ju3nkafS4JQEG5G6YxyB9`Qm#`HpL1QEnrngihjdskVkRvA=TuPNfcxN51j79Q8EJx~K?y5U z&tf2u<1=Vd!39OdH`i(rG^5o`{2o|a!jie}hy&c6d(4dihb11DT(`|hg_cd#mLu)h zgbgr%0xw`Z`7_u;y~K0_pT5CdLxNAX%q|>v{XjGq%jOM*jcQ9gCIqW9_qc{%NGZfB zu(LaHHrj_U2glrH%Jvu+R4RI8j{cl4;#=@?PK#*R)|1IEo%(H~9N#2C9!R>TFeYU6 zQB9;{cEJzsmsH2HRwk)HH*a=x*JKU8|Da}>7MXvF7bH#)1~YNwpMcET7D|Z|woGVm zyAEbc2MZMW!d(u~y+ZaEelXexeU48ChJ&2QL6Q$fBE#n+c(HW_uAqvjp`P+LV1f~resql12hPv_tl?w0W*Gya>VouhW&r)Tm!Q{9puFo2X(zCKWybUy z6tDvNuZ0QvAWhKiiBEIy0`p5?%rofn`9S`5{)FIN^pJggab(N^E*;YIk*~a)YNCplM4taNf*0X^dP83r$95fMZ2K*4= zOpgAE?C^AYI)nae-Zgn%l#hYeLy*Ov7v{hAg@09CfMz_%LD&zZe*^8W-~IM)W#63; zPke|#Rg=fU&4wd^KIt^3$sMB%zcR6c8MpH8ntv%ICSA$q(m|+(g%g{G6e+8Q6**3X zb}4x&skO3&*3yTS0w-1)D4p2m8jtnO z2%6AZAM`1G4xF0&8HcdF6B}A6ttK4r-NIxjNl@#v&uk))tP+38jEQLBF}v@@6|oWi zz#xAtdfb9SjTI4h5)c?Gdtwa$e}|P25@0?+vDW11h`-iM3PClU9tg0X3a}^@=RcR8 zKwo7sSvlBRnyh-}5hPmYJlxFPuwZ_vTOpi>vS!}@Hsw|S3*Do7oacM#<5_4hO`W=R zxLb*s5DRxKBddpjSGVLgPro4Q3O!Th|7gSWyj|&QqbEr*!NOhrCtYLe6$56X1zWa? z2u5mmCX$?d;(-&uy2|olulE3H9GuBB>1zA|wb7Uho@ghNQau@1{xy#pIod$?TOXYO zEpGPD80^038tfNsS*cGENMrpI>?Dl1f!$pZW*7>4A!`}QeW(25fsO@EjBZqAz7z@5 ze!`3!*22Y8+;INP%kww=Uy^~$&lfV4AeMds876=@ku?vAXy1}-^uEE?FrSFOgQocJS+j=zZ7LR~N zC95Bh*vKRu631XuS47)J#PCUfhjWN4rJca1y4RKuj=xN#%!Bx_=07 zeP$K&@5jbnC1=NA+Z`DVlCVfl58{<0oWO0ow@#G64tJZ-gLBX^R6qqjo*sLNfG}pW z_(X!vvDZZy7bJk2=%E4zx2gM=%yv+@z4J3U6FwMX8qxRRu1^rg*zVvV zmqBPx_lrpZSaziZ@-#$%i5F8I&S8X1TlHYsEyo}3xPBT{q|nr<4o#d8ogNj0$>8a@ zeA;6-7=<-ptu20FQANF}5dp*+Y^z&1vJ?}xs;TLyWaUY@W3>1uE#hcuC`eg+up$z+ zykrMYdTKrU2y|1gVPse}b&pXL6k(Z(va;mR92IVXOZgCrf0HTfw0b}u!c_A_kNpWMXQb*NMC(Ss~UQ{lR0*1LAbz)$&GFn(m=l_Kp&N&=`{ZS03 zqcmB1Fd34ejV_l`Nrp-QA3HqPk%cV57RT1+rHjK&RR61yF`l{)9)klmKoj^k0Fugr z2}u@B)X7X~3e=u2(z$KsxmIeu*r|0Z{BD&@v=z6AImdlUi?74PNyB|7mJbrMn`{6J+W%gZ?%W^uCm3F z-sz^X*4faaCl!liw$@jj6q}T$PaeU<3oSo9b1Pb>)R5hvYW#~+l9LoIp7AbTI9H2P zX2zJ5I_Eh=9HXGcl%K-HO95xa70+Z{~>*Xc-G5TXZ*^U42P~IPo2uNxH-VV9GMOS+BfQQ(O*GV=^_m{F}L= zam~9DW_H{;6{kOKd_T!NqQ-I<_&V<~^X#;xOTO4HKBlf2p_AFM;A=q!c+y2-o<0)7 zSsgQRK)krm&!~wy%o|}86j!%!jxEcQl+`}!g=_=_cQL#?+hDuoci|<(YMiojaM|0p zg-{Xnv&&SIB?QO63=!h6bCX%% zkagMj4D{m;vxPeF21}d6YTj1;TYsZ(=Iq##gyt|Kt5LhzNK9j4M7<;OuYKotisCwL989lM$$$5_Wv8bp zD4Sg8&^Gef$>=%xh3N&`t5TJDeSGcX_~R%kwJ~ee4?V$8SZoS5e<1fG(~#WNeQxdI zem;z^EDFHwXqM2@)Dd<5T|IrXA_K|VgD{fXXg3PO0TJK`=`O1E$|hWax;Xe$eW6{A zi%Uw%%v_F&yFVNb`n@k?fQO1(gNn;S!VEm!KQKbY4fO4(6f#&MVV?c3j+FU^l$oSx zV0csQV4uU_Y7rnk*s&fP-WIn^^1%VH*%mf?8%YP<)u8ui=43FAh8>f8V6&-Q58u1HSZsVB${ZcEAiQ9mJ?9`3u|& zsA6&dyq$t{x`;SNu@NetI!Wcn4QHOb;Hq=foe(IB4IdivcZdubHbjyIn_h6m$x>c0 z@576xivrO+ECZ)$lgaOs`qq#kk|T>MWCUwQCJJGs%O)l*FbGi8#Bz<*j_A-G_TqwJ zRjRh27Sq->UN|Ted(-+C$UOx_AM(5ga6^6IE;$tE6cX)K}Ck=`EGhKZI>}E*F<-T%Y8&FO%@klQmTzeIBG;> z`FM}KL7crL>e`Jn)M;+cs`A3U>r7NfrG|-yLLO=U@rL?0o@>uC(|{ybTjTKic)#Lb zTsimMx;!d--waez3MhMj!~xo4)97KLxuK2(`v&F1_3h|8;0 z{0itrUC)W*Con#7w;P{8+5~bs6WcQ=5I_Z>Wz%CWE9&9eS* z;8dzfD&r{zNZgCOJV?8--kqU|NBT{ElQZmAp6QE10p2K`LutXTNEl(v&)KOUifCZSDe-zq}dFLE4 zC1+*GtYDUm{n28SIuMg&q-q2Fjxh}jzssp){V0e05cy_cDct-l#GzJx@4?83vK7j+ zX|y)_gIeW)JwS5dqCUS9JokpxPO^4`e7N{Q7c1jpwtBnYO83J0f~OIdBwT=QL}(1g z;Ud5=vd2b=xMB-IStoAZ)pfmLHl>=5Wy!0Kzlfa1eNl~FWj_3he2_iuCdjpmn?i`Z zL%YwFC+Q^H@IjIl<_Gz}DHpwhcg-1{1`+WF$Bi_!Mity-F%W;dwBSb)wnHWJBwuy~ z{qf@-ca`M5sl!W;;=Cykg_|rgO5XHtRrXf?J6H4TFM=%DQxdPEr)}N)FCz&2 zkZQFG|9i)E)nlZ&J-3P8F7%hm+xVTs;NuQH86^XC!%2Zw1!v!cETqq%G&%&bQ_V6b z_cFv*d3R}b`}_hsYJRd{)J1jeZLNe@MejoArXQQhT+|k3viW^0+@B8~I6P7;TmR-C z#BC5x^?9}?rWS?vDd)0FRRn@0H@qmb z7AKzOB@s4~))*!e@E&ly=}8L9Xvne8xW(QQPDgg3M&}f5FnhqUR&6o=zG9)QmVnVxH^f^Pvc?8t<#?UYaD&R^T&$o)m`n=R zZOE)5a)UzDjItgua`O>y0UjS41~I}m5;;F{-Bmof@m6JWCSB^mz1=mj;W%dVD+Y@V zj4aSaF_=uV$ua4Q2kT}aF;GY6=)9eO@fy6V!BxYPRZC zZH$>~SEtxg6A%qGKe?`@uCu!@iU)i_ppavM-uZtcUy(vnWSx@0yg7c&G8>6A#5u`!ylRJ&0xBHEv4 zwyLo}h5sf7*~rRnlzquG_?~_efEbre)Tmu~K6Y4Kd|`JtAgS0}FpVgjL>d62tRN}& zLDw34>c*A;f1)s~aKdS&c46w+CipwphDxCjzxJd8tL9zZlVg+HiR7-c^Rug#k)KKo zx^y86{fR0|I$E@Hx##?e51=226o8LxJQE-luyDI>CQf=;;V9@m?a_Ilqw<} zghdq)QenuxpE&EQAKJ<1)pzDmBj5UBc=3wlfJJTU)#3$?ST1GG4&DaX=;nr!>VHqt zf%cX0wQp`AQuq3yz@u4B9HlQtQ*?~yp-=uaM9=@CK9Qg)!HS8%Qd7Q$dhhXa$^A2q zh9pe1U@Lu&L`a%d3kcqkxY`&li`+DzX`CW)qE@ZSq#O>)P9dteDIts8@*Hz>y*o5? zYXwBvGBg4HHf$DsCxBT8+9Nt~oj6GC zt#)K={22SrTmBW!#-e|aB$DaSEb+5`th7}PMbn|8aJo&`l}K2-HbFsTt&BsP{=s26 zeQztHv>#r6n{|^;ghb@*O5~@Yb^SB;us3tPb^%oy}B9gbL)s5=H=Kfw|s~+c= zU$!-sa`K>#@ye7{=Z7_|jvs!_rp)DEQvb;2IQxgLpEslOrQ@vseVUJnXjd(^=z{nORI zYEO)Qb0(}4+*CIuUw`_vd9VAzehzJk(9C4sZmi0Mtq2gO5OcL-uI1xwYk<3zVy$g@spaJ zjZDn8eX@J17|Hs-$I8Qzc6MRs#1WEnBkM2?w<9Fw6KJ7M?Y3!rY)*003u7GuM|gd` zYQB@QGVuUgjaa7)*kyHl8bwlgq}=mI@z|!5l-S`dIX7B_#IdcIacyyuk&Y5y_5ubP zr$lb^h=2V@LM>Y_H1BArRW$`j6J$xyIl*IfTQFqkgoH8N;wrdgydDkd=>JMysHBS9 z1WskN9bc0g?~GOvA)6*wILZ(n>qfVW!C zpx5Rt(6?GYsC%0$?l}(7*7^Qw`VcVp8c6u`(Ph$2>2w`44FUiFU+<{>$KShzmO0y? z?X9n1d#p#$r_O)b`}uRfVJ&E`3D~}P8Q84z9`h{x3zPtQ?^@vB68@-t@9*r);s$Xm z>>+=A^e?b+2awH}0t25<0dPkKQw z@p!AkJhS=cL4dnr>)A%u&-lxuzX)p)Dq2@QY*`Us#T`W)PBC#aH&_?s*_ljxqbO0YXrZ8sCdxEZ3r!r^`IKQ_s&l5%J3-Y9ty_ zD~Ib16sL0SOwTw`=t7|0k`v%J3tYK%xPIwb_6%Ens)xjD)vjp0h`=e=7@!DpsyCnF zFCRL_zP3KgZ(~&2ZrOJ6cqQLb{=q`jAVIIdP5zWgpR5vi#1;7e4TrHj`Dh~$go{8~ z8$nMn^_}7YJC1}b+H&0-cyBLIu+_ob&tfNI>-G?-L5)9Fj3=BTck;T`FgUqi9AGg} zefWJND}1e)-;#QoAbbbv1Y`ey9UgSr@MrGQrR%jU3Cj@lCJyoahn2!y6BA3(9P|}! zwKodO_E?UGS``Y9+!V9geY~>-=6(1}@xAKvKOFu^RCvt8ekOXRZ@n~ifjMM_{tZF) z#mZk@;3h{5ruh~eU@MHyCjt|0A|)8GVEqTC1OMe{;L&jbcYs0!7mpwj*4El!6^2`ob3xZ@!h7YIV5_}1OTsiY{*dTDb+h5QiYDBkw2=69amXMZwz^TsL zIyQ*a@T_lEvOdxg|1f;M8Byi`1~AF?N&nV}*Fto)F7J?g#pZo-bciwTxc~cq1z>a% z)K~@kQ_DP#ORA3=U?__s&PK?-g5Y?xQlN?XORW$-oGk-8hQ|L8ZxEMO&o+OG+x!_} z(tpN#Rc+>0-8QOl5FunTe*`SMT4OJGlx93rfDNp!;P^X6|5J+zCpu%-XxvP-QU78o zcFgvl4q#cpeLm`b7lKBhj*t%V(`Y4L_;ajohm&_)ZmrH z_@vr${WoO#;adnibcJQ{r7c&4(+ zS>~FMhKthf|8v}|0^)Cth9-{CN!Hec;K<*iXqOa>XQBg+z_jntFn&a*)bX-delqYj z%SF%0oPLDjgzn35zU%{JwH2>E@UfvRS}WUzL7qfUE+llfgabY6B-DXfL8ExxAYAX} z<~uDB4!CN0CCu{VgNRV{p1c3yTd&UeLy@F3wU|hH{(RzB<6k`mYnTDADE+^%H<7~? z^5NIgiGTN-Pyx_=T=!(dSmXV_NnCrz(bmMxAJ)-C|3ntqC|F)cAe!$6IkVn45-sqV zpEaR;g-nQ!QyUYr>mU*B1*Jl#H~AT>yg0=6 zPFP={G%!y!4&&SW$zdtStc9$ic#1U*Ed1}2%1glzP+efR>HGBQYDO|zmjaU{D(d@ggk<(5o6h_)tBVG~te zSykHu#-<%_`h!ew8|Iz&{;on?SS8XzG>=zjxc~bnoXdQVX&dfWexB(R&u zC@5!&9s`Kd_#=%VofVtUUa&2y>dUpY}Y{zjmsd19$16Jq@Q?L;iRjUlMgK%QH$fHBGxLbs1Mt6Keyboard Shortcuts diff --git a/site/objects.inv b/site/objects.inv index 89461c1e6e5808f06ca1becc49a9b4024ce8f7b2..4f3d86216b880f4467e8a70e93e7cea91f7dd84e 100644 GIT binary patch delta 234 zcmV+OB1D>cRA7cS%$N&HU diff --git a/site/pattern_reference/index.html b/site/pattern_reference/index.html index 5d9d56c..3bb0010 100644 --- a/site/pattern_reference/index.html +++ b/site/pattern_reference/index.html @@ -89,15 +89,15 @@

  • Pattern
      -
    • filter() +
    • filter
      • -
    • match() +
    • match
      • -
    • scores() +
    • scores
      • @@ -112,26 +112,27 @@ -

      - Pattern +

      + Pattern

      -
      Pattern(pattern)
+
      Pattern(pattern)
 
      
 
   
      
 
   
       
      Class for representing a pattern (a regular expression).
      
-
   
       
      Initialize a Pattern.
      
 
+
+
   
      Parameters:
      
   
        
       
      • 
-        pattern
+        pattern
             (str | Pattern)
         –
         
        
@@ -153,70 +154,46 @@ 
        
 
 
 
+
 
        
 
 
 
-
        
-        filter
+
        
+          filter
 
 
 
        
-
        filter(strings, labels = None)
+
        filter(strings)
 
        
 
   
        
   
-      
        Return strings and labels which match the pattern and which don't.
        
+      
        Return a boolean mask for strings matching the pattern.
        
+
+
 
   
        Parameters:
        
   
          
       
        • 
-        strings
+        strings
             (list[str])
         –
         
          
           
          Strings to filter.
          
         
          
       
          • 
-      
        • 
-        labels
-            (list[int])
-        –
-        
          
-          
          Labels of strings.
          
-        
          
-      
          • 
   
        
 
+
+
   
        Returns:
        
   
          
       
        • 
-            matched_strings
-        –
-        
          
-          
          Strings which match the pattern.
          
-      
          
-      
          • 
-      
        • 
-            labels_of_matched
+            matches
         –
         
          
-          
          Labels of strings which match the pattern. If no labels provided, an empty list.
          
-      
          
-      
          • 
-      
        • 
-            not_matched_strings
-        –
-        
          
-          
          Strings which don't match the pattern.
          
-      
          
-      
          • 
-      
        • 
-            labels_of_not_matched
-        –
-        
          
-          
          Labels of strings which don't match the pattern. If no labels provided, an empty list.
          
+          
          Numpy array of bool type.
          
       
          
       
          • 
   
        
@@ -225,16 +202,17 @@ 
        
 
 
        
 
+
 
        
 
 
 
-
        
-        match
+
        
+          match
 
 
 
        
-
        match(string)
+
        match(string)
 
        
 
   
        
@@ -245,16 +223,17 @@ 
        
 
 
        
 
+
 
        
 
 
 
-
        
-        scores
+
        
+          scores
 
 
 
        
-
        scores(strings, labels)
+
        scores(strings, labels, full_labels_list=None)
 
        
 
   
        
@@ -262,10 +241,12 @@ 
        
       
        Calculate classification quality scores for pattern's matches and the labels.
        
 
        Pattern's matches are considered as "predictions" when calculating quality metrics.
        
 
+
+
   
        Parameters:
        
   
          
       
        • 
-        strings
+        strings
             (list[str])
         –
         
          
@@ -273,22 +254,35 @@ 
          
         
          
       
          • 
       
        • 
-        labels
+        labels
             (list[int])
         –
         
          
-          
          A list of strings labels consisting of 0 and 1.
          
+          
          A list of strings labels.
          
+        
          
+      
          • 
+      
        • 
+        full_labels_list
+            (list[int], default:
+                None
+)
+        –
+        
          
+          
          A full list of unique labels that can be present among labels.
          
         
          
       
          • 
   
        
 
+
+
   
        Returns:
        
   
          
       
        • 
-response(            dict
+response (            dict
 )        –
         
          
-          
          Contains keys: 'n_strings', 'total_positive', 'n_matches', 'precision', 'recall' and 'accuracy'.
          
+          
          Contains keys: 'n_strings', 'total_positive', 'n_matches', 'precision', 'recall' and 'accuracy'.
+If there are more than 2 classes, each key is a list corresponding to each class.
          
       
          
       
          • 
   
        
@@ -303,6 +297,7 @@ 
        
 
   
        
 
+
 
        
             
        
         
        
diff --git a/site/patternnode_reference/index.html b/site/patternnode_reference/index.html
index 117b3ec..8bfdafd 100644
--- a/site/patternnode_reference/index.html
+++ b/site/patternnode_reference/index.html
@@ -89,43 +89,43 @@
             
             
      • PatternNode
               
          
-            
        • get_labels()
+            
        • get_labels
               
            
               
          
             
          • 
-            
        • get_matches()
+            
        • get_matches
               
            
               
          
             
          • 
-            
        • get_pattern()
+            
        • get_pattern
               
            
               
          
             
          • 
-            
        • get_scores()
+            
        • get_scores
               
            
               
          
             
          • 
-            
        • get_strings()
+            
        • get_strings
               
            
               
          
             
          • 
-            
        • set_labels()
+            
        • set_labels
               
            
               
          
             
          • 
-            
        • set_matches()
+            
        • set_matches
               
            
               
          
             
          • 
-            
        • set_pattern()
+            
        • set_pattern
               
            
               
          
             
          • 
-            
        • set_scores()
+            
        • set_scores
               
            
               
          
             
          • 
-            
        • set_strings()
+            
        • set_strings
               
            
               
          
             
          • 
@@ -140,12 +140,12 @@
 
 
 
-
          
-        PatternNode
+
          
+          PatternNode
 
 
 
          
-
          PatternNode(pattern: Pattern)
+
          PatternNode(pattern: Pattern)
 
          
 
   
          
@@ -153,10 +153,12 @@ 
          
   
       
          Class representing a node in a StringTree.
          
 
+
+
   
          Attributes:
          
   
            
       
          • 
-        right
+        right
             (PatternNode)
         –
         
            
@@ -164,7 +166,7 @@ 
            
         
            
       
            • 
       
          • 
-        left
+        left
             (PatternNode)
         –
         
            
@@ -172,7 +174,7 @@ 
            
         
            
       
            • 
       
          • 
-        pattern
+        pattern
             (Pattern)
         –
         
            
@@ -180,42 +182,43 @@ 
            
         
            
       
            • 
       
          • 
-        matches
+        matches
         –
         
            
           
            Strings which match a Pattern object attributed to the PatternNode.
            
         
            
       
            • 
       
          • 
-        strings
+        strings
         –
         
            
           
            All strings attributed to the PatternNode.
            
         
            
       
            • 
       
          • 
-        labels
+        labels
         –
         
            
           
            Labels of all strings attributed to the PatternNode. 
            
         
            
       
            • 
       
          • 
-        scores
+        scores
         –
         
            
           
            Scores of an attributed pattern applied to the attributed strings.
            
         
            
       
            • 
   
          
-
   
       
          Initialize a PatternNode.
          
 
+
+
   
          Parameters:
          
   
            
       
          • 
-        pattern
+        pattern
             (Pattern)
         –
         
            
@@ -237,16 +240,17 @@ 
            
 
 
 
+
 
            
 
 
 
-
            
-        get_labels
+
            
+          get_labels
 
 
 
            
-
            get_labels()
+
            get_labels()
 
            
 
   
            
@@ -257,16 +261,17 @@ 
            
 
 
            
 
+
 
            
 
 
 
-
            
-        get_matches
+
            
+          get_matches
 
 
 
            
-
            get_matches()
+
            get_matches()
 
            
 
   
            
@@ -277,16 +282,17 @@ 
            
 
 
            
 
+
 
            
 
 
 
-
            
-        get_pattern
+
            
+          get_pattern
 
 
 
            
-
            get_pattern()
+
            get_pattern()
 
            
 
   
            
@@ -297,16 +303,17 @@ 
            
 
 
            
 
+
 
            
 
 
 
-
            
-        get_scores
+
            
+          get_scores
 
 
 
            
-
            get_scores()
+
            get_scores()
 
            
 
   
            
@@ -317,16 +324,17 @@ 
            
 
 
            
 
+
 
            
 
 
 
-
            
-        get_strings
+
            
+          get_strings
 
 
 
            
-
            get_strings()
+
            get_strings()
 
            
 
   
            
@@ -337,16 +345,17 @@ 
            
 
 
            
 
+
 
            
 
 
 
-
            
-        set_labels
+
            
+          set_labels
 
 
 
            
-
            set_labels(labels)
+
            set_labels(labels)
 
            
 
   
            
@@ -357,16 +366,17 @@ 
            
 
 
            
 
+
 
            
 
 
 
-
            
-        set_matches
+
            
+          set_matches
 
 
 
            
-
            set_matches(matches)
+
            set_matches(matches)
 
            
 
   
            
@@ -377,16 +387,17 @@ 
            
 
 
            
 
+
 
            
 
 
 
-
            
-        set_pattern
+
            
+          set_pattern
 
 
 
            
-
            set_pattern(pattern)
+
            set_pattern(pattern)
 
            
 
   
            
@@ -397,16 +408,17 @@ 
            
 
 
            
 
+
 
            
 
 
 
-
            
-        set_scores
+
            
+          set_scores
 
 
 
            
-
            set_scores(scores)
+
            set_scores(scores)
 
            
 
   
            
@@ -417,16 +429,17 @@ 
            
 
 
            
 
+
 
            
 
 
 
-
            
-        set_strings
+
            
+          set_strings
 
 
 
            
-
            set_strings(strings)
+
            set_strings(strings)
 
            
 
   
            
@@ -443,6 +456,7 @@ 
            
 
   
            
 
+
 
            
             
            
         
            
diff --git a/site/search/search_index.json b/site/search/search_index.json
index 61874bf..72f1d4b 100644
--- a/site/search/search_index.json
+++ b/site/search/search_index.json
@@ -1 +1 @@
-{"config":{"indexing":"full","lang":["en"],"min_search_length":3,"prebuild_index":false,"separator":"[\\s\\-]+"},"docs":[{"location":"","text":"Basics to strtree strtree is a Python package for strings binary classification, based on regular expressions put in a decision tree. Github repo: stretree With strtree you can: Do a binary classification of your strings using automatically extracted regular expressions Find shortest regular expressions which covers strings with positive labels in the most accurate way Look at a quick example. Example Firstly, let's build a tree from strings and their labels. import strtree strings = ['Samsung X-500', 'Samsung SM-10', 'Samsung X-1100', 'Samsung F-10', 'Samsung X-2200', 'AB Nokia 1', 'DG Nokia 2', 'THGF Nokia 3', 'SFSD Nokia 4', 'Nokia XG', 'Nokia YO'] labels = [1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0] tree = StringTree() tree.build(strings, labels, min_precision=0.75, min_token_length=1) Let's see what regular expressions were extracted. for leaf in tree.leaves: print(leaf) # Output: # PatternNode(\".+ .+a.+\", right=None, left=PatternNode(.+0.+), n_strings=11, precision=1.0, recall=0.57) # PatternNode(\".+0.+\", right=None, left=None, n_strings=7, precision=1.0, recall=1.0) You may need to check the precision and recall of the whole tree for a given set of strings and true labels. print('Precision: {}'.format(tree.precision_score(strings, labels))) # Precision: 1.0 print('Recall: {}'.format(tree.precision_score(strings, labels))) # Recall: 1.0 Finally, you can pass any strings you want and see if they match to extracted regular expressions or not. matches = tree.match(other_strings) # You will receive a vector of the same size as other_strings containing 0's (no match) or 1's (match) Installing Use PyPI: pip install strtree Use a distribution file located in the dist folder: pip install strtree-0.1.0-py3-none-any.whl Contribution You are very welcome to participate in the project. You may solve the current issues or add new functionality - it is up to you to.","title":"Overview"},{"location":"#basics-to-strtree","text":"strtree is a Python package for strings binary classification, based on regular expressions put in a decision tree. Github repo: stretree With strtree you can: Do a binary classification of your strings using automatically extracted regular expressions Find shortest regular expressions which covers strings with positive labels in the most accurate way Look at a quick example.","title":"Basics to strtree"},{"location":"#example","text":"Firstly, let's build a tree from strings and their labels. import strtree strings = ['Samsung X-500', 'Samsung SM-10', 'Samsung X-1100', 'Samsung F-10', 'Samsung X-2200', 'AB Nokia 1', 'DG Nokia 2', 'THGF Nokia 3', 'SFSD Nokia 4', 'Nokia XG', 'Nokia YO'] labels = [1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0] tree = StringTree() tree.build(strings, labels, min_precision=0.75, min_token_length=1) Let's see what regular expressions were extracted. for leaf in tree.leaves: print(leaf) # Output: # PatternNode(\".+ .+a.+\", right=None, left=PatternNode(.+0.+), n_strings=11, precision=1.0, recall=0.57) # PatternNode(\".+0.+\", right=None, left=None, n_strings=7, precision=1.0, recall=1.0) You may need to check the precision and recall of the whole tree for a given set of strings and true labels. print('Precision: {}'.format(tree.precision_score(strings, labels))) # Precision: 1.0 print('Recall: {}'.format(tree.precision_score(strings, labels))) # Recall: 1.0 Finally, you can pass any strings you want and see if they match to extracted regular expressions or not. matches = tree.match(other_strings) # You will receive a vector of the same size as other_strings containing 0's (no match) or 1's (match)","title":"Example"},{"location":"#installing","text":"Use PyPI: pip install strtree Use a distribution file located in the dist folder: pip install strtree-0.1.0-py3-none-any.whl","title":"Installing"},{"location":"#contribution","text":"You are very welcome to participate in the project. You may solve the current issues or add new functionality - it is up to you to.","title":"Contribution"},{"location":"pattern_reference/","text":"Pattern Pattern ( pattern ) Class for representing a pattern (a regular expression). Initialize a Pattern. Parameters: pattern ( str | Pattern ) \u2013 Str or Pattern object representing a regular expressions. It must be compatible with re.compile method. filter filter ( strings , labels = None ) Return strings and labels which match the pattern and which don't. Parameters: strings ( list [ str ] ) \u2013 Strings to filter. labels ( list [ int ] ) \u2013 Labels of strings. Returns: matched_strings \u2013 Strings which match the pattern. labels_of_matched \u2013 Labels of strings which match the pattern. If no labels provided, an empty list. not_matched_strings \u2013 Strings which don't match the pattern. labels_of_not_matched \u2013 Labels of strings which don't match the pattern. If no labels provided, an empty list. match match ( string ) Verify if the pattern matches the string (at any place). scores scores ( strings , labels ) Calculate classification quality scores for pattern's matches and the labels. Pattern's matches are considered as \"predictions\" when calculating quality metrics. Parameters: strings ( list [ str ] ) \u2013 A list of strings. labels ( list [ int ] ) \u2013 A list of strings labels consisting of 0 and 1. Returns: response ( dict ) \u2013 Contains keys: 'n_strings', 'total_positive', 'n_matches', 'precision', 'recall' and 'accuracy'.","title":"Pattern"},{"location":"pattern_reference/#utils.Pattern","text":"Pattern ( pattern ) Class for representing a pattern (a regular expression). Initialize a Pattern. Parameters: pattern ( str | Pattern ) \u2013 Str or Pattern object representing a regular expressions. It must be compatible with re.compile method.","title":"Pattern"},{"location":"pattern_reference/#utils.Pattern.filter","text":"filter ( strings , labels = None ) Return strings and labels which match the pattern and which don't. Parameters: strings ( list [ str ] ) \u2013 Strings to filter. labels ( list [ int ] ) \u2013 Labels of strings. Returns: matched_strings \u2013 Strings which match the pattern. labels_of_matched \u2013 Labels of strings which match the pattern. If no labels provided, an empty list. not_matched_strings \u2013 Strings which don't match the pattern. labels_of_not_matched \u2013 Labels of strings which don't match the pattern. If no labels provided, an empty list.","title":"filter()"},{"location":"pattern_reference/#utils.Pattern.match","text":"match ( string ) Verify if the pattern matches the string (at any place).","title":"match()"},{"location":"pattern_reference/#utils.Pattern.scores","text":"scores ( strings , labels ) Calculate classification quality scores for pattern's matches and the labels. Pattern's matches are considered as \"predictions\" when calculating quality metrics. Parameters: strings ( list [ str ] ) \u2013 A list of strings. labels ( list [ int ] ) \u2013 A list of strings labels consisting of 0 and 1. Returns: response ( dict ) \u2013 Contains keys: 'n_strings', 'total_positive', 'n_matches', 'precision', 'recall' and 'accuracy'.","title":"scores()"},{"location":"patternnode_reference/","text":"PatternNode PatternNode ( pattern : Pattern ) Class representing a node in a StringTree. Attributes: right ( PatternNode ) \u2013 Node with matching strings. left ( PatternNode ) \u2013 Node with non-matching strings. pattern ( Pattern ) \u2013 Attributed Pattern object. matches \u2013 Strings which match a Pattern object attributed to the PatternNode. strings \u2013 All strings attributed to the PatternNode. labels \u2013 Labels of all strings attributed to the PatternNode. scores \u2013 Scores of an attributed pattern applied to the attributed strings. Initialize a PatternNode. Parameters: pattern ( Pattern ) \u2013 A Pattern object attributed to a node. get_labels get_labels () Get PatternNode.labels attribute get_matches get_matches () Get PatternNode.matches attribute get_pattern get_pattern () Get PatternNode.pattern attribute get_scores get_scores () Get PatternNode.scores attribute get_strings get_strings () Get PatternNode.strings attribute set_labels set_labels ( labels ) Set PatternNode.labels attribute set_matches set_matches ( matches ) Set PatternNode.matches attribute set_pattern set_pattern ( pattern ) Set PatternNode.pattern attribute set_scores set_scores ( scores ) Set PatternNode.scores attribute set_strings set_strings ( strings ) Set PatternNode.strings attribute","title":"PatternNode"},{"location":"patternnode_reference/#utils.PatternNode","text":"PatternNode ( pattern : Pattern ) Class representing a node in a StringTree. Attributes: right ( PatternNode ) \u2013 Node with matching strings. left ( PatternNode ) \u2013 Node with non-matching strings. pattern ( Pattern ) \u2013 Attributed Pattern object. matches \u2013 Strings which match a Pattern object attributed to the PatternNode. strings \u2013 All strings attributed to the PatternNode. labels \u2013 Labels of all strings attributed to the PatternNode. scores \u2013 Scores of an attributed pattern applied to the attributed strings. Initialize a PatternNode. Parameters: pattern ( Pattern ) \u2013 A Pattern object attributed to a node.","title":"PatternNode"},{"location":"patternnode_reference/#utils.PatternNode.get_labels","text":"get_labels () Get PatternNode.labels attribute","title":"get_labels()"},{"location":"patternnode_reference/#utils.PatternNode.get_matches","text":"get_matches () Get PatternNode.matches attribute","title":"get_matches()"},{"location":"patternnode_reference/#utils.PatternNode.get_pattern","text":"get_pattern () Get PatternNode.pattern attribute","title":"get_pattern()"},{"location":"patternnode_reference/#utils.PatternNode.get_scores","text":"get_scores () Get PatternNode.scores attribute","title":"get_scores()"},{"location":"patternnode_reference/#utils.PatternNode.get_strings","text":"get_strings () Get PatternNode.strings attribute","title":"get_strings()"},{"location":"patternnode_reference/#utils.PatternNode.set_labels","text":"set_labels ( labels ) Set PatternNode.labels attribute","title":"set_labels()"},{"location":"patternnode_reference/#utils.PatternNode.set_matches","text":"set_matches ( matches ) Set PatternNode.matches attribute","title":"set_matches()"},{"location":"patternnode_reference/#utils.PatternNode.set_pattern","text":"set_pattern ( pattern ) Set PatternNode.pattern attribute","title":"set_pattern()"},{"location":"patternnode_reference/#utils.PatternNode.set_scores","text":"set_scores ( scores ) Set PatternNode.scores attribute","title":"set_scores()"},{"location":"patternnode_reference/#utils.PatternNode.set_strings","text":"set_strings ( strings ) Set PatternNode.strings attribute","title":"set_strings()"},{"location":"stringtree_reference/","text":"StringTree StringTree () A class for binary classification of strings with regular expressions. Each node is an instance of the PatternNode class. It contains a regular expression and metadata. Attributes: root ( PatternNode ) \u2013 The root PatternNode. leaves ( list [ PatternNode ] ) \u2013 List of all nodes. Initialize a StringTree object. build build ( strings , labels , min_precision = 0.5 , min_token_length = 1 , max_patterns = None , min_matches_leaf = 1 , min_strings_leaf = 1 , verbose = False ) Build a StringTree. For the StringTree object being used, create nodes and corresponding patterns. Use provided strings and labels. Parameters: strings ( list [ str ] ) \u2013 List of strings. labels ( list [ int ] ) \u2013 List of labels (0 or 1). min_precision ( float ) \u2013 The minimal precision of a pattern in the tree. min_token_length ( int ) \u2013 The initial length of the pattern. max_patterns ( int ) \u2013 The highest amount of patterns. Once the method finds more, it stops. min_matches_leaf ( int ) \u2013 The minimal amount of matches in one node. min_strings_leaf ( int ) \u2013 The minimal amount of strings in one node. verbose ( bool ) \u2013 If to provide additinal text output. filter filter ( strings , return_nodes = False ) Return strings matching the tree and corresponding nodes. A string matches a tree if it matches at least one node. Parameters: strings ( list [ str ] ) \u2013 List of strings. return_nodes ( bool ) \u2013 Flag indicating if to return nodes corresponding to the matched strings. If False, only matched strings are returned. Returns: matches ( list [ int ] ) \u2013 List containing matching strings. matched_nodes ( list [ PatternNode ] ) \u2013 List consisting of PatternNodes of matching strings. Returned only if return_nodes is True. get_leaves get_leaves () Get leaves attribute. match match ( strings , return_nodes = False ) Return flags indicating if strings match the tree. A string matches a tree if it matches at least one node. Parameters: strings ( list [ str ] ) \u2013 List of strings. return_nodes ( bool ) \u2013 Flag indicating if to return nodes corresponding to the matched strings. If False, only matched strings are returned. Returns: matches ( list [ int ] ) \u2013 List containing 1 (match) and 0 (no match) for each string. matched_nodes ( list [ PatternNode ] ) \u2013 List consisting of PatternNodes of matching strings. Returned only if return_nodes is True. precision_score precision_score ( strings , labels ) Calculate a precision score for given strings and labels. recall_score recall_score ( strings , labels ) Calculate a recall score for given strings and labels. set_leaves set_leaves ( leaves ) Set leaves attribute.","title":"StringTree"},{"location":"stringtree_reference/#utils.StringTree","text":"StringTree () A class for binary classification of strings with regular expressions. Each node is an instance of the PatternNode class. It contains a regular expression and metadata. Attributes: root ( PatternNode ) \u2013 The root PatternNode. leaves ( list [ PatternNode ] ) \u2013 List of all nodes. Initialize a StringTree object.","title":"StringTree"},{"location":"stringtree_reference/#utils.StringTree.build","text":"build ( strings , labels , min_precision = 0.5 , min_token_length = 1 , max_patterns = None , min_matches_leaf = 1 , min_strings_leaf = 1 , verbose = False ) Build a StringTree. For the StringTree object being used, create nodes and corresponding patterns. Use provided strings and labels. Parameters: strings ( list [ str ] ) \u2013 List of strings. labels ( list [ int ] ) \u2013 List of labels (0 or 1). min_precision ( float ) \u2013 The minimal precision of a pattern in the tree. min_token_length ( int ) \u2013 The initial length of the pattern. max_patterns ( int ) \u2013 The highest amount of patterns. Once the method finds more, it stops. min_matches_leaf ( int ) \u2013 The minimal amount of matches in one node. min_strings_leaf ( int ) \u2013 The minimal amount of strings in one node. verbose ( bool ) \u2013 If to provide additinal text output.","title":"build()"},{"location":"stringtree_reference/#utils.StringTree.filter","text":"filter ( strings , return_nodes = False ) Return strings matching the tree and corresponding nodes. A string matches a tree if it matches at least one node. Parameters: strings ( list [ str ] ) \u2013 List of strings. return_nodes ( bool ) \u2013 Flag indicating if to return nodes corresponding to the matched strings. If False, only matched strings are returned. Returns: matches ( list [ int ] ) \u2013 List containing matching strings. matched_nodes ( list [ PatternNode ] ) \u2013 List consisting of PatternNodes of matching strings. Returned only if return_nodes is True.","title":"filter()"},{"location":"stringtree_reference/#utils.StringTree.get_leaves","text":"get_leaves () Get leaves attribute.","title":"get_leaves()"},{"location":"stringtree_reference/#utils.StringTree.match","text":"match ( strings , return_nodes = False ) Return flags indicating if strings match the tree. A string matches a tree if it matches at least one node. Parameters: strings ( list [ str ] ) \u2013 List of strings. return_nodes ( bool ) \u2013 Flag indicating if to return nodes corresponding to the matched strings. If False, only matched strings are returned. Returns: matches ( list [ int ] ) \u2013 List containing 1 (match) and 0 (no match) for each string. matched_nodes ( list [ PatternNode ] ) \u2013 List consisting of PatternNodes of matching strings. Returned only if return_nodes is True.","title":"match()"},{"location":"stringtree_reference/#utils.StringTree.precision_score","text":"precision_score ( strings , labels ) Calculate a precision score for given strings and labels.","title":"precision_score()"},{"location":"stringtree_reference/#utils.StringTree.recall_score","text":"recall_score ( strings , labels ) Calculate a recall score for given strings and labels.","title":"recall_score()"},{"location":"stringtree_reference/#utils.StringTree.set_leaves","text":"set_leaves ( leaves ) Set leaves attribute.","title":"set_leaves()"}]}
\ No newline at end of file
+{"config":{"indexing":"full","lang":["en"],"min_search_length":3,"prebuild_index":false,"separator":"[\\s\\-]+"},"docs":[{"location":"","text":"Basics to strtree strtree is a Python package for strings binary classification, based on regular expressions put in a decision tree. Github repo: stretree With strtree you can: Do a binary classification of your strings using automatically extracted regular expressions Find shortest regular expressions which covers strings with positive labels in the most accurate way Look at a quick example. Example Firstly, let's build a tree from strings and their labels. import strtree strings = ['Samsung X-500', 'Samsung SM-10', 'Samsung X-1100', 'Samsung F-10', 'Samsung X-2200', 'AB Nokia 1', 'DG Nokia 2', 'THGF Nokia 3', 'SFSD Nokia 4', 'Nokia XG', 'Nokia YO'] labels = [1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0] tree = StringTree() tree.build(strings, labels, min_precision=0.75, min_token_length=1) Let's see what regular expressions were extracted. for leaf in tree.leaves: print(leaf) # Output: # PatternNode(\".+ .+a.+\", right=None, left=PatternNode(.+0.+), n_strings=11, precision=1.0, recall=0.57) # PatternNode(\".+0.+\", right=None, left=None, n_strings=7, precision=1.0, recall=1.0) You may need to check the precision and recall of the whole tree for a given set of strings and true labels. print('Precision: {}'.format(tree.precision_score(strings, labels))) # Precision: 1.0 print('Recall: {}'.format(tree.precision_score(strings, labels))) # Recall: 1.0 Finally, you can pass any strings you want and see if they match to extracted regular expressions or not. matches = tree.match(other_strings) # You will receive a vector of the same size as other_strings containing 0's (no match) or 1's (match) Installing Use PyPI: pip install strtree Use a distribution file located in the dist folder: pip install strtree-0.1.0-py3-none-any.whl Contribution You are very welcome to participate in the project. You may solve the current issues or add new functionality - it is up to you to.","title":"Overview"},{"location":"#basics-to-strtree","text":"strtree is a Python package for strings binary classification, based on regular expressions put in a decision tree. Github repo: stretree With strtree you can: Do a binary classification of your strings using automatically extracted regular expressions Find shortest regular expressions which covers strings with positive labels in the most accurate way Look at a quick example.","title":"Basics to strtree"},{"location":"#example","text":"Firstly, let's build a tree from strings and their labels. import strtree strings = ['Samsung X-500', 'Samsung SM-10', 'Samsung X-1100', 'Samsung F-10', 'Samsung X-2200', 'AB Nokia 1', 'DG Nokia 2', 'THGF Nokia 3', 'SFSD Nokia 4', 'Nokia XG', 'Nokia YO'] labels = [1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0] tree = StringTree() tree.build(strings, labels, min_precision=0.75, min_token_length=1) Let's see what regular expressions were extracted. for leaf in tree.leaves: print(leaf) # Output: # PatternNode(\".+ .+a.+\", right=None, left=PatternNode(.+0.+), n_strings=11, precision=1.0, recall=0.57) # PatternNode(\".+0.+\", right=None, left=None, n_strings=7, precision=1.0, recall=1.0) You may need to check the precision and recall of the whole tree for a given set of strings and true labels. print('Precision: {}'.format(tree.precision_score(strings, labels))) # Precision: 1.0 print('Recall: {}'.format(tree.precision_score(strings, labels))) # Recall: 1.0 Finally, you can pass any strings you want and see if they match to extracted regular expressions or not. matches = tree.match(other_strings) # You will receive a vector of the same size as other_strings containing 0's (no match) or 1's (match)","title":"Example"},{"location":"#installing","text":"Use PyPI: pip install strtree Use a distribution file located in the dist folder: pip install strtree-0.1.0-py3-none-any.whl","title":"Installing"},{"location":"#contribution","text":"You are very welcome to participate in the project. You may solve the current issues or add new functionality - it is up to you to.","title":"Contribution"},{"location":"pattern_reference/","text":"Pattern Pattern ( pattern ) Class for representing a pattern (a regular expression). Initialize a Pattern. Parameters: pattern ( str | Pattern ) \u2013 Str or Pattern object representing a regular expressions. It must be compatible with re.compile method. filter filter ( strings ) Return a boolean mask for strings matching the pattern. Parameters: strings ( list [ str ] ) \u2013 Strings to filter. Returns: matches \u2013 Numpy array of bool type. match match ( string ) Verify if the pattern matches the string (at any place). scores scores ( strings , labels , full_labels_list = None ) Calculate classification quality scores for pattern's matches and the labels. Pattern's matches are considered as \"predictions\" when calculating quality metrics. Parameters: strings ( list [ str ] ) \u2013 A list of strings. labels ( list [ int ] ) \u2013 A list of strings labels. full_labels_list ( list [ int ] , default: None ) \u2013 A full list of unique labels that can be present among labels. Returns: response ( dict ) \u2013 Contains keys: 'n_strings', 'total_positive', 'n_matches', 'precision', 'recall' and 'accuracy'. If there are more than 2 classes, each key is a list corresponding to each class.","title":"Pattern"},{"location":"pattern_reference/#utils.Pattern","text":"Pattern ( pattern ) Class for representing a pattern (a regular expression). Initialize a Pattern. Parameters: pattern ( str | Pattern ) \u2013 Str or Pattern object representing a regular expressions. It must be compatible with re.compile method.","title":"Pattern"},{"location":"pattern_reference/#utils.Pattern.filter","text":"filter ( strings ) Return a boolean mask for strings matching the pattern. Parameters: strings ( list [ str ] ) \u2013 Strings to filter. Returns: matches \u2013 Numpy array of bool type.","title":"filter"},{"location":"pattern_reference/#utils.Pattern.match","text":"match ( string ) Verify if the pattern matches the string (at any place).","title":"match"},{"location":"pattern_reference/#utils.Pattern.scores","text":"scores ( strings , labels , full_labels_list = None ) Calculate classification quality scores for pattern's matches and the labels. Pattern's matches are considered as \"predictions\" when calculating quality metrics. Parameters: strings ( list [ str ] ) \u2013 A list of strings. labels ( list [ int ] ) \u2013 A list of strings labels. full_labels_list ( list [ int ] , default: None ) \u2013 A full list of unique labels that can be present among labels. Returns: response ( dict ) \u2013 Contains keys: 'n_strings', 'total_positive', 'n_matches', 'precision', 'recall' and 'accuracy'. If there are more than 2 classes, each key is a list corresponding to each class.","title":"scores"},{"location":"patternnode_reference/","text":"PatternNode PatternNode ( pattern : Pattern ) Class representing a node in a StringTree. Attributes: right ( PatternNode ) \u2013 Node with matching strings. left ( PatternNode ) \u2013 Node with non-matching strings. pattern ( Pattern ) \u2013 Attributed Pattern object. matches \u2013 Strings which match a Pattern object attributed to the PatternNode. strings \u2013 All strings attributed to the PatternNode. labels \u2013 Labels of all strings attributed to the PatternNode. scores \u2013 Scores of an attributed pattern applied to the attributed strings. Initialize a PatternNode. Parameters: pattern ( Pattern ) \u2013 A Pattern object attributed to a node. get_labels get_labels () Get PatternNode.labels attribute get_matches get_matches () Get PatternNode.matches attribute get_pattern get_pattern () Get PatternNode.pattern attribute get_scores get_scores () Get PatternNode.scores attribute get_strings get_strings () Get PatternNode.strings attribute set_labels set_labels ( labels ) Set PatternNode.labels attribute set_matches set_matches ( matches ) Set PatternNode.matches attribute set_pattern set_pattern ( pattern ) Set PatternNode.pattern attribute set_scores set_scores ( scores ) Set PatternNode.scores attribute set_strings set_strings ( strings ) Set PatternNode.strings attribute","title":"PatternNode"},{"location":"patternnode_reference/#utils.PatternNode","text":"PatternNode ( pattern : Pattern ) Class representing a node in a StringTree. Attributes: right ( PatternNode ) \u2013 Node with matching strings. left ( PatternNode ) \u2013 Node with non-matching strings. pattern ( Pattern ) \u2013 Attributed Pattern object. matches \u2013 Strings which match a Pattern object attributed to the PatternNode. strings \u2013 All strings attributed to the PatternNode. labels \u2013 Labels of all strings attributed to the PatternNode. scores \u2013 Scores of an attributed pattern applied to the attributed strings. Initialize a PatternNode. Parameters: pattern ( Pattern ) \u2013 A Pattern object attributed to a node.","title":"PatternNode"},{"location":"patternnode_reference/#utils.PatternNode.get_labels","text":"get_labels () Get PatternNode.labels attribute","title":"get_labels"},{"location":"patternnode_reference/#utils.PatternNode.get_matches","text":"get_matches () Get PatternNode.matches attribute","title":"get_matches"},{"location":"patternnode_reference/#utils.PatternNode.get_pattern","text":"get_pattern () Get PatternNode.pattern attribute","title":"get_pattern"},{"location":"patternnode_reference/#utils.PatternNode.get_scores","text":"get_scores () Get PatternNode.scores attribute","title":"get_scores"},{"location":"patternnode_reference/#utils.PatternNode.get_strings","text":"get_strings () Get PatternNode.strings attribute","title":"get_strings"},{"location":"patternnode_reference/#utils.PatternNode.set_labels","text":"set_labels ( labels ) Set PatternNode.labels attribute","title":"set_labels"},{"location":"patternnode_reference/#utils.PatternNode.set_matches","text":"set_matches ( matches ) Set PatternNode.matches attribute","title":"set_matches"},{"location":"patternnode_reference/#utils.PatternNode.set_pattern","text":"set_pattern ( pattern ) Set PatternNode.pattern attribute","title":"set_pattern"},{"location":"patternnode_reference/#utils.PatternNode.set_scores","text":"set_scores ( scores ) Set PatternNode.scores attribute","title":"set_scores"},{"location":"patternnode_reference/#utils.PatternNode.set_strings","text":"set_strings ( strings ) Set PatternNode.strings attribute","title":"set_strings"},{"location":"stringtree_reference/","text":"StringTree StringTree () A class for binary classification of strings with regular expressions. Each node is an instance of the PatternNode class. It contains a regular expression and metadata. Attributes: root ( PatternNode ) \u2013 The root PatternNode. leaves ( list [ PatternNode ] ) \u2013 List of all nodes. Initialize a StringTree object. build build ( strings , labels , min_precision = 0.5 , min_token_length = 1 , max_patterns = None , min_matches_leaf = 1 , min_strings_leaf = 1 , verbose = False , ) Build a StringTree. For the StringTree object being used, create nodes and corresponding patterns. Use provided strings and labels. Parameters: strings ( list [ str ] ) \u2013 List of strings. labels ( list [ int ] ) \u2013 List of labels (0 or 1). min_precision ( float , default: 0.5 ) \u2013 The minimal precision of a pattern in the tree. min_token_length ( int , default: 1 ) \u2013 The initial length of the pattern. max_patterns ( int , default: None ) \u2013 The highest amount of patterns. Once the method finds more, it stops. min_matches_leaf ( int , default: 1 ) \u2013 The minimal amount of matches in one node. min_strings_leaf ( int , default: 1 ) \u2013 The minimal amount of strings in one node. verbose ( bool , default: False ) \u2013 If to provide additinal text output. filter filter ( strings , return_nodes = False ) Return strings matching the tree and corresponding nodes. A string matches a tree if it matches at least one node. Parameters: strings ( list [ str ] ) \u2013 List of strings. return_nodes ( bool , default: False ) \u2013 Flag indicating if to return nodes corresponding to the matched strings. If False, only matched strings are returned. Returns: matches ( list [ int ] ) \u2013 List containing matching strings. matched_nodes ( list [ PatternNode ] ) \u2013 List consisting of PatternNodes of matching strings. Returned only if return_nodes is True. get_leaves get_leaves () Get leaves attribute. get_nodes_by_label get_nodes_by_label ( label ) Get nodes where the label is the most probable. match match ( strings , return_nodes = False ) Return flags indicating if strings match the tree. A string matches a tree if it matches at least one node. Parameters: strings ( list [ str ] ) \u2013 List of strings. return_nodes ( bool , default: False ) \u2013 Flag indicating if to return nodes corresponding to the matched strings. If False, only matched strings are returned. Returns: matches ( list [ int ] ) \u2013 List containing 1 (match) and 0 (no match) for each string. matched_nodes ( list [ PatternNode ] ) \u2013 List consisting of PatternNodes of matching strings. If not match found, None is retured. Returned only if return_nodes is True. precision_score precision_score ( strings , labels ) Calculate a precision score for given strings and labels. predict_label predict_label ( strings , return_nodes = False ) Predict labels for given strings. recall_score recall_score ( strings , labels ) Calculate a recall score for given strings and labels. set_leaves set_leaves ( leaves ) Set leaves attribute.","title":"StringTree"},{"location":"stringtree_reference/#utils.StringTree","text":"StringTree () A class for binary classification of strings with regular expressions. Each node is an instance of the PatternNode class. It contains a regular expression and metadata. Attributes: root ( PatternNode ) \u2013 The root PatternNode. leaves ( list [ PatternNode ] ) \u2013 List of all nodes. Initialize a StringTree object.","title":"StringTree"},{"location":"stringtree_reference/#utils.StringTree.build","text":"build ( strings , labels , min_precision = 0.5 , min_token_length = 1 , max_patterns = None , min_matches_leaf = 1 , min_strings_leaf = 1 , verbose = False , ) Build a StringTree. For the StringTree object being used, create nodes and corresponding patterns. Use provided strings and labels. Parameters: strings ( list [ str ] ) \u2013 List of strings. labels ( list [ int ] ) \u2013 List of labels (0 or 1). min_precision ( float , default: 0.5 ) \u2013 The minimal precision of a pattern in the tree. min_token_length ( int , default: 1 ) \u2013 The initial length of the pattern. max_patterns ( int , default: None ) \u2013 The highest amount of patterns. Once the method finds more, it stops. min_matches_leaf ( int , default: 1 ) \u2013 The minimal amount of matches in one node. min_strings_leaf ( int , default: 1 ) \u2013 The minimal amount of strings in one node. verbose ( bool , default: False ) \u2013 If to provide additinal text output.","title":"build"},{"location":"stringtree_reference/#utils.StringTree.filter","text":"filter ( strings , return_nodes = False ) Return strings matching the tree and corresponding nodes. A string matches a tree if it matches at least one node. Parameters: strings ( list [ str ] ) \u2013 List of strings. return_nodes ( bool , default: False ) \u2013 Flag indicating if to return nodes corresponding to the matched strings. If False, only matched strings are returned. Returns: matches ( list [ int ] ) \u2013 List containing matching strings. matched_nodes ( list [ PatternNode ] ) \u2013 List consisting of PatternNodes of matching strings. Returned only if return_nodes is True.","title":"filter"},{"location":"stringtree_reference/#utils.StringTree.get_leaves","text":"get_leaves () Get leaves attribute.","title":"get_leaves"},{"location":"stringtree_reference/#utils.StringTree.get_nodes_by_label","text":"get_nodes_by_label ( label ) Get nodes where the label is the most probable.","title":"get_nodes_by_label"},{"location":"stringtree_reference/#utils.StringTree.match","text":"match ( strings , return_nodes = False ) Return flags indicating if strings match the tree. A string matches a tree if it matches at least one node. Parameters: strings ( list [ str ] ) \u2013 List of strings. return_nodes ( bool , default: False ) \u2013 Flag indicating if to return nodes corresponding to the matched strings. If False, only matched strings are returned. Returns: matches ( list [ int ] ) \u2013 List containing 1 (match) and 0 (no match) for each string. matched_nodes ( list [ PatternNode ] ) \u2013 List consisting of PatternNodes of matching strings. If not match found, None is retured. Returned only if return_nodes is True.","title":"match"},{"location":"stringtree_reference/#utils.StringTree.precision_score","text":"precision_score ( strings , labels ) Calculate a precision score for given strings and labels.","title":"precision_score"},{"location":"stringtree_reference/#utils.StringTree.predict_label","text":"predict_label ( strings , return_nodes = False ) Predict labels for given strings.","title":"predict_label"},{"location":"stringtree_reference/#utils.StringTree.recall_score","text":"recall_score ( strings , labels ) Calculate a recall score for given strings and labels.","title":"recall_score"},{"location":"stringtree_reference/#utils.StringTree.set_leaves","text":"set_leaves ( leaves ) Set leaves attribute.","title":"set_leaves"}]}
\ No newline at end of file
diff --git a/site/sitemap.xml.gz b/site/sitemap.xml.gz
index ab96ed1246b69e090ce41678a6b492b7512caf5b..877dbc5ddc9c5ceae812b5679d0167085f4369c7 100644
GIT binary patch
delta 13
Ucmb=gXP58h;1IBFn8;oM02v$uod5s;

delta 13
Ucmb=gXP58h;HdYinaExN02}876#xJL

diff --git a/site/stringtree_reference/index.html b/site/stringtree_reference/index.html
index 024dc11..70454fc 100644
--- a/site/stringtree_reference/index.html
+++ b/site/stringtree_reference/index.html
@@ -89,31 +89,39 @@
             
             
          • StringTree
               
              
-            
            • build()
+            
            • build
               
                
               
              
             
              • 
-            
            • filter()
+            
            • filter
               
                
               
              
             
              • 
-            
            • get_leaves()
+            
            • get_leaves
               
                
               
              
             
              • 
-            
            • match()
+            
            • get_nodes_by_label
               
                
               
              
             
              • 
-            
            • precision_score()
+            
            • match
               
                
               
              
             
              • 
-            
            • recall_score()
+            
            • precision_score
               
                
               
              
             
              • 
-            
            • set_leaves()
+            
            • predict_label
+              
                
+              
              
+            
              • 
+            
            • recall_score
+              
                
+              
              
+            
              • 
+            
            • set_leaves
               
                
               
              
             
              • 
@@ -128,12 +136,12 @@
 
 
 
-
              
-        StringTree
+
              
+          StringTree
 
 
 
              
-
              StringTree()
+
              StringTree()
 
              
 
   
              
@@ -142,10 +150,12 @@ 
              
       
              A class for binary classification of strings with regular expressions. 
              
 
              Each node is an instance of the PatternNode class. It contains a regular expression and metadata. 
              
 
+
+
   
              Attributes:
              
   
                
       
              • 
-        root
+        root
             (PatternNode)
         –
         
                
@@ -153,7 +163,7 @@ 
                
         
                
       
                • 
       
              • 
-        leaves
+        leaves
             (list[PatternNode])
         –
         
                
@@ -161,7 +171,6 @@ 
                
         
                
       
                • 
   
              
-
   
       
              Initialize a StringTree object.
              
 
@@ -178,16 +187,26 @@ 
              
 
 
 
+
 
              
 
 
 
-
              
-        build
+
              
+          build
 
 
 
              
-
              build(strings, labels, min_precision = 0.5, min_token_length = 1, max_patterns = None, min_matches_leaf = 1, min_strings_leaf = 1, verbose = False)
+
              build(
+    strings,
+    labels,
+    min_precision=0.5,
+    min_token_length=1,
+    max_patterns=None,
+    min_matches_leaf=1,
+    min_strings_leaf=1,
+    verbose=False,
+)
 
              
 
   
              
@@ -195,10 +214,12 @@ 
              
       
              Build a StringTree.
              
 
              For the StringTree object being used, create nodes and corresponding patterns. Use provided strings and labels.
              
 
+
+
   
              Parameters:
              
   
                
       
              • 
-        strings
+        strings
             (list[str])
         –
         
                
@@ -206,7 +227,7 @@ 
                
         
                
       
                • 
       
              • 
-        labels
+        labels
             (list[int])
         –
         
                
@@ -214,48 +235,60 @@ 
                
         
                
       
                • 
       
              • 
-        min_precision
-            (float)
+        min_precision
+            (float, default:
+                0.5
+)
         –
         
                
           
                The minimal precision of a pattern in the tree.
                
         
                
       
                • 
       
              • 
-        min_token_length
-            (int)
+        min_token_length
+            (int, default:
+                1
+)
         –
         
                
           
                The initial length of the pattern.
                
         
                
       
                • 
       
              • 
-        max_patterns
-            (int)
+        max_patterns
+            (int, default:
+                None
+)
         –
         
                
           
                The highest amount of patterns. Once the method finds more, it stops.
                
         
                
       
                • 
       
              • 
-        min_matches_leaf
-            (int)
+        min_matches_leaf
+            (int, default:
+                1
+)
         –
         
                
           
                The minimal amount of matches in one node.
                
         
                
       
                • 
       
              • 
-        min_strings_leaf
-            (int)
+        min_strings_leaf
+            (int, default:
+                1
+)
         –
         
                
           
                The minimal amount of strings in one node.
                
         
                
       
                • 
       
              • 
-        verbose
-            (bool)
+        verbose
+            (bool, default:
+                False
+)
         –
         
                
           
                If to provide additinal text output.
                
@@ -267,16 +300,17 @@ 
                
 
 
                
 
+
 
                
 
 
 
-
                
-        filter
+
                
+          filter
 
 
 
                
-
                filter(strings, return_nodes = False)
+
                filter(strings, return_nodes=False)
 
                
 
   
                
@@ -284,10 +318,12 @@ 
                
       
                Return strings matching the tree and corresponding nodes.
                
 
                A string matches a tree if it matches at least one node.
                
 
+
+
   
                Parameters:
                
   
                  
       
                • 
-        strings
+        strings
             (list[str])
         –
         
                  
@@ -295,8 +331,10 @@ 
                  
         
                  
       
                  • 
       
                • 
-        return_nodes
-            (bool)
+        return_nodes
+            (bool, default:
+                False
+)
         –
         
                  
           
                  Flag indicating if to return nodes corresponding to the matched strings. 
@@ -305,17 +343,19 @@ 
                  
       
                  • 
   
                
 
+
+
   
                Returns:
                
   
                  
       
                • 
-matches(            list[int]
+matches (            list[int]
 )        –
         
                  
           
                  List containing matching strings.
                  
       
                  
       
                  • 
       
                • 
-matched_nodes(            list[PatternNode]
+matched_nodes (            list[PatternNode]
 )        –
         
                  
           
                  List consisting of PatternNodes of matching strings. Returned only if return_nodes is True.
                  
@@ -327,16 +367,17 @@ 
                  
 
 
                  
 
+
 
                  
 
 
 
-
                  
-        get_leaves
+
                  
+          get_leaves
 
 
 
                  
-
                  get_leaves()
+
                  get_leaves()
 
                  
 
   
                  
@@ -347,16 +388,38 @@ 
                  
 
 
                  
 
+
+
                  
+
+
+
+
                  
+          get_nodes_by_label
+
+
+
                  
+
                  get_nodes_by_label(label)
+
                  
+
+  
                  
+  
+      
                  Get nodes where the label is the most probable.
                  
+
+  
                  
+
+
                  
+
+
 
                  
 
 
 
-
                  
-        match
+
                  
+          match
 
 
 
                  
-
                  match(strings, return_nodes = False)
+
                  match(strings, return_nodes=False)
 
                  
 
   
                  
@@ -364,10 +427,12 @@ 
                  
       
                  Return flags indicating if strings match the tree.
                  
 
                  A string matches a tree if it matches at least one node.
                  
 
+
+
   
                  Parameters:
                  
   
                    
       
                  • 
-        strings
+        strings
             (list[str])
         –
         
                    
@@ -375,8 +440,10 @@ 
                    
         
                    
       
                    • 
       
                  • 
-        return_nodes
-            (bool)
+        return_nodes
+            (bool, default:
+                False
+)
         –
         
                    
           
                    Flag indicating if to return nodes corresponding to the matched strings. 
@@ -385,20 +452,23 @@ 
                    
       
                    • 
   
                  
 
+
+
   
                  Returns:
                  
   
                    
       
                  • 
-matches(            list[int]
+matches (            list[int]
 )        –
         
                    
           
                    List containing 1 (match) and 0 (no match) for each string.
                    
       
                    
       
                    • 
       
                  • 
-matched_nodes(            list[PatternNode]
+matched_nodes (            list[PatternNode]
 )        –
         
                    
-          
                    List consisting of PatternNodes of matching strings. Returned only if return_nodes is True.
                    
+          
                    List consisting of PatternNodes of matching strings. If not match found, None is retured. 
+Returned only if return_nodes is True.
                    
       
                    
       
                    • 
   
                  
@@ -407,16 +477,17 @@ 
                  
 
 
                  
 
+
 
                  
 
 
 
-
                  
-        precision_score
+
                  
+          precision_score
 
 
 
                  
-
                  precision_score(strings, labels)
+
                  precision_score(strings, labels)
 
                  
 
   
                  
@@ -427,16 +498,38 @@ 
                  
 
 
                  
 
+
 
                  
 
 
 
-
                  
-        recall_score
+
                  
+          predict_label
 
 
 
                  
-
                  recall_score(strings, labels)
+
                  predict_label(strings, return_nodes=False)
+
                  
+
+  
                  
+  
+      
                  Predict labels for given strings.
                  
+
+  
                  
+
+
                  
+
+
+
                  
+
+
+
+
                  
+          recall_score
+
+
+
                  
+
                  recall_score(strings, labels)
 
                  
 
   
                  
@@ -447,16 +540,17 @@ 
                  
 
 
                  
 
+
 
                  
 
 
 
-
                  
-        set_leaves
+
                  
+          set_leaves
 
 
 
                  
-
                  set_leaves(leaves)
+
                  set_leaves(leaves)
 
                  
 
   
                  
@@ -473,6 +567,7 @@ 
                  
 
   
                  
 
+
 
                  
             
                  
         
                  
diff --git a/src/strtree/utils.py b/src/strtree/utils.py
index 5ab92ca..17be469 100644
--- a/src/strtree/utils.py
+++ b/src/strtree/utils.py
@@ -5,6 +5,7 @@
 
 class Pattern:
     """Class for representing a pattern (a regular expression)."""
+    
     def __init__(self, pattern):
         """Initialize a Pattern.
 
@@ -31,9 +32,10 @@ def __repr__(self):
     def __copy__(self):
         return Pattern(self.str)
 
-    def scores(self, strings, labels):
+    def _binary_class_scores(self, strings, labels):
         """Calculate classification quality scores for pattern's matches and the labels.
 
+        Labels must be binary (must consist of 0 and 1 only).
         Pattern's matches are considered as "predictions" when calculating quality metrics.
         
         Parameters
@@ -41,33 +43,29 @@ def scores(self, strings, labels):
         strings : list[str]
             A list of strings.
         labels : list[int]
-            A list of strings labels consisting of 0 and 1.
+            A list of strings labels.
 
         Returns
         -------
         response : dict
-            Contains keys: 'n_strings', 'total_positive', 'n_matches', 'precision', 'recall' and 'accuracy'.
+            Contains keys: 'n_strings', 'total_positive', 'n_matches', 'precision', 'recall', 'accuracy'.
         """
         true_positive = 0
         true_negative = 0
         total_positive = sum(labels)
         n_strings = len(strings)
-        n_matches = 0
-        for i in range(n_strings):
-            match = self.match(strings[i])
-            if match:
-                n_matches += 1
-                if labels[i] == 1:
-                    true_positive += 1
-            else:
-                if labels[i] == 0:
-                    true_negative += 1
+
+        matches = np.array(list(map(self.match, strings)))
+        n_matches = np.sum(matches)
+        true_positive = np.sum(matches & labels)
+        true_negative = np.sum(~matches & (labels == 0))
+        
         if n_matches == 0:
             precision = 0.
             accuracy = 0.
         else:
             precision = true_positive / n_matches
-            accuracy = (true_positive + true_negative) / n_matches
+            accuracy = (true_positive + true_negative) / n_strings
         if total_positive == 0:
             recall = 0.
         else:
@@ -82,48 +80,73 @@ def scores(self, strings, labels):
         }
         return response
 
+    def scores(self, strings, labels, full_labels_list=None):
+        """Calculate classification quality scores for pattern's matches and the labels.
+
+        Pattern's matches are considered as "predictions" when calculating quality metrics.
+        
+        Parameters
+        ----------
+        strings : list[str]
+            A list of strings.
+        labels : list[int]
+            A list of strings labels.
+        full_labels_list : list[int]
+            A full list of unique labels that can be present among labels.
+
+        Returns
+        -------
+        response : dict
+            Contains keys: 'n_strings', 'total_positive', 'n_matches', 'precision', 'recall' and 'accuracy'.
+            If there are more than 2 classes, each key is a list corresponding to each class.
+        """
+        max_label = max(labels)
+        if max_label > 1:  # is multiclass
+            if full_labels_list is not None:
+                label_names = full_labels_list
+            else:
+                label_names = np.unique(labels)
+            scores = {
+                'n_strings': [],
+                'total_positive': [],
+                'n_matches': [],
+                'precision': [],
+                'recall': [],
+                'accuracy': []
+            }
+            for label_name in label_names:
+                one_vs_rest_labels = (np.array(labels) == label_name).astype('int32')
+                class_scores = self._binary_class_scores(strings, one_vs_rest_labels)
+                scores['n_strings'] = class_scores['n_strings']
+                scores['total_positive'].append(class_scores['total_positive'])
+                scores['n_matches'] = class_scores['n_matches']
+                scores['precision'].append(class_scores['precision'])
+                scores['recall'].append(class_scores['recall'])
+                scores['accuracy'].append(class_scores['accuracy'])
+            return scores
+        else:
+            return self._binary_class_scores(strings, labels)
+
     def match(self, string):
         """Verify if the pattern matches the string (at any place)."""
         return self.regex.search(string) is not None
 
-    def filter(self, strings, labels=None):
-        """Return strings and labels which match the pattern and which don't.
+    def filter(self, strings):
+        """Return a boolean mask for strings matching the pattern.
 
         Parameters
         ----------
         strings : list[str]
             Strings to filter.
-        labels : list[int], default None
-            Labels of strings.
 
         Returns
         -------
-        matched_strings
-            Strings which match the pattern.
-        labels_of_matched
-            Labels of strings which match the pattern. If no labels provided, an empty list.
-        not_matched_strings
-            Strings which don't match the pattern.
-        labels_of_not_matched
-            Labels of strings which don't match the pattern. If no labels provided, an empty list.
+        matches
+            Numpy array of bool type.
         """
-        matched_strings = []
-        labels_of_matched = []
-        not_matched_strings = []
-        labels_of_not_matched = []
-
-        for string_i in range(len(strings)):
-            match = self.match(strings[string_i])
-            if match:
-                matched_strings.append(strings[string_i])
-                if labels is not None:
-                    labels_of_matched.append(labels[string_i])
-            else:
-                not_matched_strings.append(strings[string_i])
-                if labels is not None:
-                    labels_of_not_matched.append(labels[string_i])
+        matches = np.array(list(map(self.match, strings)))
     
-        return matched_strings, labels_of_matched, not_matched_strings, labels_of_not_matched
+        return matches
 
 
 class PatternNode:
@@ -157,8 +180,8 @@ def __init__(self, pattern: 'Pattern'):
         self.right = None
         self.left = None
         self._pattern = pattern
-        self._matches = None
-        self._strings = None
+        self._matches = []
+        self._strings = []
         self._labels = None
         self._scores = None
     
@@ -174,6 +197,7 @@ def __repr__(self):
             f'right={right_node}, ',
             f'left={left_node}, ',
             f'n_strings={len(self._strings)}, ',
+            f'n_matches={len(self._matches)}, ',
             f'precision={self._scores["precision"]}, '
             f'recall={self._scores["recall"]}'
             ')'
@@ -189,8 +213,6 @@ def get_strings(self):
 
     def set_strings(self, strings):
         """Set PatternNode.strings attribute"""
-        if self._strings is not None:
-            raise ValueError("PatternNode.strings attribute is immutable once set")
         self._strings = strings.copy()
 
     def get_labels(self):
@@ -213,8 +235,6 @@ def get_matches(self):
 
     def set_matches(self, matches):
         """Set PatternNode.matches attribute"""
-        if self._matches is not None:
-            raise ValueError("PatternNode.matches attribute is immutable once set")
         self._matches = matches.copy()
 
     def get_pattern(self):
@@ -293,8 +313,9 @@ def _generate_tokens(strings, labels, length):
         """
         n = length
         ngrams = {}
+        multiclass = max(labels) > 1
         for string_i in range(len(strings)):
-            if labels[string_i] == 0:  # Don't add ngramgs for negative target.
+            if labels[string_i] == 0 and not multiclass:  # Don't add ngramgs for negative target if it is binary classification
                 continue
             string = strings[string_i]
             for i in range(len(string) - n + 1):
@@ -385,15 +406,24 @@ def _augment_pattern(strings, labels, current_pattern: 'Pattern', tokens):
         """
         candidates_scores = []
         pattern_candidates = []
+        multiclass = max(labels) > 1
         for token in tokens:
             token_patterns = StringTree._combine_patterns(current_pattern, Pattern(token))
             for pattern in token_patterns:
                 scores = pattern.scores(strings, labels)
-                precision, recall, n_match = scores['precision'], scores['recall'], scores['n_matches']
-                if precision + recall == 0:
-                    f1_score = 0
+                precision, recall = scores['precision'], scores['recall']
+                if multiclass:
+                    max_precision = np.max(precision)
+                    max_recall = np.max(recall)
+                    if max_precision + max_recall == 0:
+                        f1_score = 0
+                    else:
+                        f1_score =  2*max_precision*max_recall / (max_precision+max_recall) 
                 else:
-                    f1_score =  2*precision*recall / (precision+recall) 
+                    if precision + recall == 0:
+                        f1_score = 0
+                    else:
+                        f1_score =  2*precision*recall / (precision+recall) 
                 candidates_scores.append(f1_score)
                 pattern_candidates.append(pattern)
         if len(pattern_candidates) > 0:
@@ -435,6 +465,10 @@ def build(
             raise ValueError('min_precision must not be < 0 or > 1')
         if max_patterns is None:
             max_patterns = np.inf
+
+        multiclass = max(labels) > 1
+        classes = np.unique(labels)
+        self._classes = classes
             
         cur_strings = strings.copy()
         cur_labels = labels.copy()
@@ -449,30 +483,38 @@ def build(
 
         for (cur_strings, cur_labels) in evaluation_queue:
             if verbose:
-                print(f'\nStart processing another {len(cur_strings)} of strings with {sum(cur_labels)} positive labels.')
+                if not multiclass:
+                    print(f'\nStart processing another {len(cur_strings)} of strings with {sum(cur_labels)} positive labels.')
+                else:
+                    print(f'\nStart processing another {len(cur_strings)} of strings with {len(classes)} classes.')
             
             cur_pattern = Pattern('')
-            scores = cur_pattern.scores(cur_strings, cur_labels)
+            scores = cur_pattern.scores(cur_strings, cur_labels, full_labels_list=classes)
 
             cur_node = PatternNode(cur_pattern)
             cur_node.scores = scores
             cur_node.strings = cur_strings
             cur_node.labels = cur_labels
             cur_node.matches = cur_strings
-            
+
             precision = scores['precision']
             recall = scores['recall']
             n_matches = scores['n_matches']
             if verbose:
                 print(f'Current pattern="{cur_pattern}". N matches: {n_matches}, Precision={precision}, Recall={recall}')
 
+            if multiclass:
+                precision = np.max(scores['precision'])
+                recall = np.max(scores['recall'])
+                n_matches = np.sum(scores['n_matches'])
+
             first_run = True
             pattern_was_not_found = False
             stop_processing = True
 
             local_cur_strings, local_cur_labels = cur_strings, cur_labels
-            while (precision < min_precision
-                      and sum(local_cur_labels) > 0 
+            while cur_pattern.str == '' or (precision < min_precision
+                      and (sum(local_cur_labels) > 0 or multiclass)
                       and n_matches > min_matches_leaf
                       and len(local_cur_strings) > min_strings_leaf):
                 stop_processing = False
@@ -489,15 +531,19 @@ def build(
                     if verbose:
                         print(f'Pattern was not found. Current pattern="{cur_pattern}". Precision={precision}, Recall={recall}')
                     break
-                scores = best_pattern.scores(local_cur_strings, local_cur_labels)
+                scores = best_pattern.scores(local_cur_strings, local_cur_labels, full_labels_list=classes)
 
                 precision = scores['precision']
                 recall = scores['recall']
                 n_matches = scores['n_matches']
-                
                 if verbose:
                     print(f'Best pattern="{best_pattern}". N matches: {n_matches}, Precision={precision}, Recall={recall}')
 
+                if multiclass:
+                    precision = np.max(scores['precision'])
+                    recall = np.max(scores['recall'])
+                    n_matches = np.sum(scores['n_matches'])
+
                 if n_matches < min_matches_leaf:
                     stop_processing = True
                     if cur_pattern.str == '':
@@ -510,15 +556,20 @@ def build(
                     break
                     
                 cur_pattern = best_pattern
-                
-                local_cur_strings, local_cur_labels, _, _ = \
-                cur_pattern.filter(local_cur_strings, local_cur_labels)
+
+                cur_pattern_matches = cur_pattern.filter(local_cur_strings)
+                local_cur_strings = (np.array(local_cur_strings)[cur_pattern_matches]).tolist()
+                local_cur_labels = (np.array(local_cur_labels)[cur_pattern_matches]).tolist()
                 
                 first_run = False
                 
             if pattern_was_not_found:
-                cur_strings, cur_labels, not_matched_strings, labels_of_not_matched = \
-                    cur_pattern.filter(cur_strings, cur_labels)
+                cur_pattern_matches = cur_pattern.filter(cur_strings)
+                not_matched_strings = (np.array(cur_strings)[~cur_pattern_matches]).tolist()
+                labels_of_not_matched = (np.array(cur_labels)[~cur_pattern_matches]).tolist()
+                cur_strings = (np.array(cur_strings)[cur_pattern_matches]).tolist()
+                cur_labels = (np.array(cur_labels)[cur_pattern_matches]).tolist()
+                
                 if sum(labels_of_not_matched) > 0:
                     evaluation_queue.append((not_matched_strings, labels_of_not_matched))
                 continue
@@ -528,8 +579,11 @@ def build(
             cur_node.strings = cur_strings
             cur_node.labels = cur_labels
 
-            cur_strings, cur_labels, not_matched_strings, labels_of_not_matched = \
-            cur_pattern.filter(cur_strings, cur_labels)
+            cur_pattern_matches = cur_pattern.filter(cur_strings)
+            not_matched_strings = (np.array(cur_strings)[~cur_pattern_matches]).tolist()
+            labels_of_not_matched = (np.array(cur_labels)[~cur_pattern_matches]).tolist()
+            cur_strings = (np.array(cur_strings)[cur_pattern_matches]).tolist()
+            cur_labels = (np.array(cur_labels)[cur_pattern_matches]).tolist()
 
             cur_node.matches = cur_strings
                 
@@ -543,7 +597,7 @@ def build(
                 print(f'Best pattern has {len(local_cur_strings)} strings which is less or equal to min_strings_leaf. Processing stopped.')
                 continue
                 
-            if sum(cur_labels) > 0:
+            if sum(cur_labels) > 0 or multiclass:
                 leaves.append(cur_node)
                 if verbose:
                     print('Last pattern was saved')
@@ -635,7 +689,8 @@ def match(self, strings, return_nodes=False):
         matches : list[int]
             List containing 1 (match) and 0 (no match) for each string.
         matched_nodes : list[PatternNode]
-            List consisting of PatternNodes of matching strings. Returned only if return_nodes is True.
+            List consisting of PatternNodes of matching strings. If not match found, None is retured. 
+            Returned only if return_nodes is True.
         """
         if self._leaves is None:
             raise ValueError("The StringTree was not built. Run StringTree.build method first.")
@@ -680,3 +735,34 @@ def recall_score(self, strings, labels):
         else:
             recall_score = 0
         return recall_score
+
+    def predict_label(self, strings, return_nodes=False):
+        """Predict labels for given strings."""
+        if self._leaves is None:
+            raise ValueError("The StringTree was not built. Run StringTree.build method first.")
+
+        matches, matched_nodes = self.match(strings, return_nodes=True)
+        if len(self._classes) > 2:
+            get_label = lambda node: self._classes[np.argmax(node._scores['precision'])] if node is not None else None
+        else:
+            get_label = lambda node: self._classes[int(node._scores['precision'] > 0.5)] if node is not None else None
+        predicted_labels = list(map(get_label, matched_nodes))
+
+        if return_nodes:
+            return predicted_labels, matched_nodes
+        return predicted_labels
+        
+
+    def get_nodes_by_label(self, label):
+        """Get nodes where the label is the most probable."""
+        if self._leaves is None:
+            raise ValueError("The StringTree was not built. Run StringTree.build method first.")
+
+        if len(self._classes) > 2:
+            get_label = lambda node: self._classes[np.argmax(node._scores['precision'])] if node is not None else None
+        else:
+            get_label = lambda node: self._classes[int(node._scores['precision'] > 0.5)] if node is not None else None
+
+        nodes_labels = np.array(list(map(get_label, self._leaves)))
+
+        return np.array(self._leaves)[nodes_labels == label] 
diff --git a/tests/test_main.py b/tests/test_main.py
index 5502585..ba1939e 100644
--- a/tests/test_main.py
+++ b/tests/test_main.py
@@ -26,12 +26,35 @@ def test_tree_methods():
     strings = ['Samsung X-500', 'Samsung SM-10', 'Samsung X-1100', 'Samsung F-10', 'Samsung X-2200',
                'AB Nokia 1', 'DG Nokia 2', 'THGF Nokia 3', 'SFSD Nokia 4', 'Nokia XG', 'Nokia YO']
     
-    target = [1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0]
+    labels = [1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0]
 
     tree = strtree.StringTree()
-    tree.build(strings, target, min_precision=0.75, min_token_length=1, verbose=True)
+    tree.build(strings, labels, min_precision=0.75, min_token_length=1, verbose=True)
 
     assert tree.filter(['OO Nokia 12']) == ['OO Nokia 12'] 
     assert tree.match(['OO Nokia 12']) == [1]
     assert tree.precision_score(['OO Nokia 12'], [1]) == 1.0
-    assert tree.recall_score(['OO Nokia 12'], [1]) == 1.0
\ No newline at end of file
+    assert tree.recall_score(['OO Nokia 12'], [1]) == 1.0
+    assert tree.predict_label(['OO Nokia 12']) == [1]
+    assert len(tree.get_nodes_by_label(1)) > 0
+
+
+def test_tree_methods_multiclass():
+
+    strings = ['Admiral', 'Apple', 'Age',
+               'Bee', 'Bubble', 'Butter',
+               'Color', 'Climate', 'CPU']
+    
+    labels = [0, 0, 0,
+              1, 1, 1,
+              2, 2, 2]
+
+    tree = strtree.StringTree()
+    tree.build(strings, labels, min_precision=0.75, min_token_length=1, verbose=True)
+
+    assert tree.filter(['Ananas']) == ['Ananas'] 
+    assert tree.match(['Ananas']) == [1]
+    assert tree.precision_score(['Ananas'], [1]) == 1.0
+    assert tree.recall_score(['Ananas'], [1]) == 1.0
+    assert tree.predict_label(['Ananas']) == [0]
+    assert len(tree.get_nodes_by_label(1)) > 0
\ No newline at end of file