From 0c704f880ce7d557f452c51afe721dd08bfbe2b0 Mon Sep 17 00:00:00 2001 From: Nazarii Zastavnyi Date: Wed, 5 Nov 2025 09:54:48 +0100 Subject: [PATCH 1/3] FCLIQU-1352: build new release --- .github/workflows/publish.yml | 25 + .gitignore | 11 +- build.gradle | 81 +++ gradle/wrapper/gradle-wrapper.jar | Bin 0 -> 45633 bytes gradle/wrapper/gradle-wrapper.properties | 7 + gradlew | 248 +++++++++ gradlew.bat | 93 ++++ .../core2/collections/art/ArtNode16.java | 470 +++++++++++++++++ .../core2/collections/art/ArtNode256.java | 397 ++++++++++++++ .../core2/collections/art/ArtNode4.java | 492 ++++++++++++++++++ .../core2/collections/art/ArtNode48.java | 483 +++++++++++++++++ .../core2/collections/art/IArtNode.java | 74 +++ .../art/LongAdaptiveRadixTreeMap.java | 308 +++++++++++ .../collections/art/LongObjConsumer.java | 28 + .../collections/objpool/ObjectsPool.java | 117 +++++ 15 files changed, 2833 insertions(+), 1 deletion(-) create mode 100644 .github/workflows/publish.yml create mode 100644 build.gradle create mode 100644 gradle/wrapper/gradle-wrapper.jar create mode 100644 gradle/wrapper/gradle-wrapper.properties create mode 100755 gradlew create mode 100644 gradlew.bat create mode 100644 src/main/java/exchange/core2/collections/art/ArtNode16.java create mode 100644 src/main/java/exchange/core2/collections/art/ArtNode256.java create mode 100644 src/main/java/exchange/core2/collections/art/ArtNode4.java create mode 100644 src/main/java/exchange/core2/collections/art/ArtNode48.java create mode 100644 src/main/java/exchange/core2/collections/art/IArtNode.java create mode 100644 src/main/java/exchange/core2/collections/art/LongAdaptiveRadixTreeMap.java create mode 100644 src/main/java/exchange/core2/collections/art/LongObjConsumer.java create mode 100644 src/main/java/exchange/core2/collections/objpool/ObjectsPool.java diff --git a/.github/workflows/publish.yml b/.github/workflows/publish.yml new file mode 100644 index 000000000..6d8fa4e70 --- /dev/null +++ b/.github/workflows/publish.yml @@ -0,0 +1,25 @@ +name: Publish to GitHub Packages +on: + push: + tags: [ "v*" ] + workflow_dispatch: {} + +jobs: + publish: + runs-on: ubuntu-latest + permissions: + contents: read + packages: write + steps: + - uses: actions/checkout@v4 + with: + fetch-depth: 0 + - uses: actions/setup-java@v4 + with: + distribution: temurin + java-version: '17' + - name: Publish + env: + GITHUB_ACTOR: ${{ github.actor }} + GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }} + run: ./gradlew publish --no-daemon diff --git a/.gitignore b/.gitignore index 82ff57cb9..7509717d5 100644 --- a/.gitignore +++ b/.gitignore @@ -9,4 +9,13 @@ delombok/ *.ipr # dumps # -dumps/*.ec* \ No newline at end of file +dumps/*.ec* + +#build +build + +#gradle +.gradle + +#DS +.DS_Store \ No newline at end of file diff --git a/build.gradle b/build.gradle new file mode 100644 index 000000000..46dd428d4 --- /dev/null +++ b/build.gradle @@ -0,0 +1,81 @@ +plugins { + id "java" + id "maven-publish" +} + +group = "com.dashdevs.exchange" +version = "0.5.4" + +java { + sourceCompatibility = JavaVersion.VERSION_1_8 + targetCompatibility = JavaVersion.VERSION_1_8 + withSourcesJar() +} + +repositories { + mavenCentral() + maven { url = uri("https://repo1.maven.org/maven2") } +} + +dependencies { + implementation "com.lmax:disruptor:3.4.4" + + // LZ4 + implementation "org.lz4:lz4-java:1.8.0" + + // Chronicle + implementation "net.openhft:chronicle-core:2.17.10" + implementation "net.openhft:chronicle-bytes:2.17.10" + implementation "net.openhft:chronicle-wire:2.17.10" + + implementation "org.eclipse.collections:eclipse-collections:10.4.0" + implementation "org.agrona:agrona:1.13.0" + + // Lombok + JetBrains annotations + compileOnly "org.projectlombok:lombok:1.18.30" + annotationProcessor "org.projectlombok:lombok:1.18.30" + compileOnly "org.jetbrains:annotations:24.1.0" + + // Logging + implementation "ch.qos.logback:logback-classic:1.3.15" +} + +tasks.withType(Javadoc).configureEach { + enabled = false +} + +sourceSets { + test { + java.setSrcDirs([]) + resources.setSrcDirs([]) + } +} +tasks.withType(JavaCompile).configureEach { + if (name == "compileTestJava") enabled = false +} +tasks.withType(Test).configureEach { + enabled = false +} + +publishing { + publications { + mavenJava(MavenPublication) { + from components.java + artifactId = "exchange-core" + pom { + name = "exchange-core (dashdevs fork)" + description = "Fork of exchange-core with vendored collections; Javadoc & tests disabled for publish" + } + } + } + repositories { + maven { + name = "GitHubPackages" + url = uri("https://maven.pkg.github.com/dashdevs/exchange-core") + credentials { + username = System.getenv("GITHUB_ACTOR") ?: project.findProperty("gpr.user") + password = System.getenv("GITHUB_TOKEN") ?: project.findProperty("gpr.key") + } + } + } +} diff --git a/gradle/wrapper/gradle-wrapper.jar b/gradle/wrapper/gradle-wrapper.jar new file mode 100644 index 0000000000000000000000000000000000000000..f8e1ee3125fe0768e9a76ee977ac089eb657005e GIT binary patch literal 45633 zcma&NV|1n6wyqu9PQ|uu+csuwn-$x(T~Woh?Nr6KUD3(A)@l1Yd+oj6Z_U=8`RAE` z#vE6_`?!1WLs1443=Ieh3JM4ai0JG2|2{}S&_HrxszP*9^5P7#QX*pVDq?D?;6T8C z{bWO1$9at%!*8ax*TT&F99vwf1Ls+3lklsb|bC`H`~Q z_w}*E9P=Wq;PYlGYhZ^lt#N97bt5aZ#mQcOr~h^B;R>f-b0gf{y(;VA{noAt`RZzU z7vQWD{%|q!urW2j0Z&%ChtL(^9m` zgaU%|B;V#N_?%iPvu0PVkX=1m9=*SEGt-Lp#&Jh%rz6EJXlV^O5B5YfM5j{PCeElx z8sipzw8d=wVhFK+@mgrWyA)Sv3BJq=+q+cL@=wuH$2;LjY z^{&+X4*HFA0{QvlM_V4PTQjIdd;d|2YuN;s|bi!@<)r-G%TuOCHz$O(_-K z)5in&6uNN<0UfwY=K>d;cL{{WK2FR|NihJMN0Q4X+(1lE)$kY?T$7UWleIU`i zQG#X-&&m-8x^(;n@o}$@vPMYRoq~|FqC~CU3MnoiifD{(CwAGd%X#kFHq#4~%_a!{ zeX{XXDT#(DvX7NtAs7S}2ZuiZ>gtd;tCR7E)3{J^`~#Vd**9qz%~JRFAiZf{zt|Dr zvQw!)n7fNUn_gH`o9?8W8t_%x6~=y*`r46bjj(t{YU*qfqd}J}*mkgUfsXTI>Uxl6 z)Fj>#RMy{`wINIR;{_-!xGLgVaTfNJ2-)%YUfO&X5z&3^E#4?k-_|Yv$`fpgYkvnA%E{CiV zP|-zAf8+1@R`sT{rSE#)-nuU7Pwr-z>0_+CLQT|3vc-R22ExKT4ym@Gj77j$aTVns zp4Kri#Ml?t7*n(;>nkxKdhOU9Qbwz%*#i9_%K<`m4T{3aPbQ?J(Mo`6E5cDdbAk%X z+4bN%E#a(&ZXe{G#V!2Nt+^L$msKVHP z|APpBhq7knz(O2yY)$$VyI_Xg4UIC*$!i7qQG~KEZnO@Q1i89@4ZKW*3^Wh?o?zSkfPxdhnTxlO!3tAqe_ zuEqHVcAk3uQIFTpP~C{d$?>7yt3G3Fo>syXTus>o0tJdFpQWC27hDiwC%O09i|xCq z@H6l|+maB;%CYQIChyhu;PVYz9e&5a@EEQs3$DS6dLIS+;N@I0)V}%B`jdYv;JDck zd|xxp(I?aedivE7*19hesoa-@Xm$^EHbbVmh$2^W-&aTejsyc$i+}A#n2W*&0Qt`5 zJS!2A|LVV;L!(*x2N)GjJC;b1RB_f(#D&g_-};a*|BTRvfdIX}Gau<;uCylMNC;UG zzL((>6KQBQ01wr%7u9qI2HLEDY!>XisIKb#6=F?pAz)!_JX}w|>1V>X^QkMdFi@Jr z`1N*V4xUl{qvECHoF?#lXuO#Dg2#gh|AU$Wc=nuIbmVPBEGd(R#&Z`TP9*o%?%#ob zWN%ByU+55yBNfjMjkJnBjT!cVDi}+PR3N&H(f8$d^Pu;A_WV*{)c2Q{IiE7&LPsd4 z!rvkUf{sco_WNSIdW+btM#O+4n`JiceH6%`7pDV zRqJ@lj=Dt(e-Gkz$b!c2>b)H$lf(fuAPdIsLSe(dZ4E~9+Ge!{3j~>nS%r)eQZ;Iq ztWGpp=2Ptc!LK_TQ8cgJXUlU5mRu|7F2{eu*;a>_5S<;bus=t*IXcfzJRPv4xIs;s zt2<&}OM>KxkTxa=dFMfNr42=DL~I}6+_{`HT_YJBiWkpVZND1Diad~Yr*Fuq{zljr z*_+jXk=qVBdwlQkYuIrB4GG*#voba$?h*u0uRNL+87-?AjzG2X_R9mzQ7BJEawutObr|ey~%in>6k%A`K*`pb-|DF5m})!`b=~osoiW2)IFh?_y9y<3Cix_ znvC=bjBX1J820!%%9FaB@v?hAsd05e@w$^ZAvtUp*=Bi+Owkl?rLa6F#yl{s+?563 zmn2 zV95%gySAJ$L!Vvk4kx!n@mo`3Mfi`2lXUkBmd%)u)7C?Pa;oK~zUQ#p0u{a|&0;zNO#9a4`v^3df90X#~l_k$q7n&L5 z?TszF842~g+}tgUP}UG?ObLCE1(Js_$e>XS7m%o7j@@VdxePtg)w{i5an+xK95r?s zDeEhgMO-2$H?@0{p-!4NJ)}zP+3LzZB?FVap)ObHV6wp}Lrxvz$cjBND1T6ln$EfJ zZRPeR2lP}K0p8x`ahxB??Ud;i7$Y5X!5}qBFS+Zp=P^#)08nQi_HuJcN$0=x;2s53 zwoH}He9BlKT4GdWfWt)@o@$4zN$B@5gVIN~aHtwIhh{O$uHiMgYl=&Vd$w#B2 zRv+xK3>4E{!)+LXA2#*K6H~HpovXAQeXV(^Pd%G_>ro0(4_@`{2Ag(+8{9pqJ>Co$ zRRV(oX;nD+Jel_2^BlNO=cQP8q*G#~R3PTERUxvug_C4T3qwb9MQE|^{5(H*nt`fn z^%*p-RwkAhT6(r>E@5w8FaB)Q<{#`H9fTdc6QBuSr9D-x!Tb9f?wI=M{^$cB5@1;0 z+yLHh?3^c-Qte@JI<SW`$bs5Vv9!yWjJD%oY z8Cdc$a(LLy@tB2)+rUCt&0$&+;&?f~W6+3Xk3g zy9L�|d9Zj^A1Dgv5yzCONAB>8LM`TRL&7v_NKg(bEl#y&Z$py}mu<4DrT@8HHjE zqD@4|aM>vt!Yvc2;9Y#V;KJ8M>vPjiS2ycq52qkxInUK*QqA3$&OJ`jZBo zpzw&PT%w0$D94KD%}VN9c)eCueh1^)utGt2OQ+DP(BXszodfc1kFPWl~BQ5Psy*d`UIf zc}zQ8TVw35jdCSc78)MljC-g3$GX2$<0<3MEQXS&i<(ZFClz9WlL}}?%u>S2hhEk_ zyzfm&@Q%YVB-vw3KH|lU#c_)0aeG^;aDG&!bwfOz_9)6gLe;et;h(?*0d-RV0V)1l zzliq#`b9Y*c`0!*6;*mU@&EFSbW>9>L5xUX+unp%@tCW#kLfz)%3vwN{1<-R*g+B_C^W8)>?n%G z<#+`!wU$L&dn)Pz(9DGGI%RlmM2RpeDy9)31OZV$c2T>-Jl&4$6nul&e7){1u-{nP zE$uZs%gyanu+yBcAb+jTYGy(^<;&EzeLeqveN12Lvv)FQFn0o&*qAaH+gLJ)*xT9y z>`Y`W?M#K7%w26w?Oen>j7=R}EbZ;+jcowV&i}P|IfW^C5GJHt5D;Q~)|=gW3iQ;N zQGl4SQFtz=&~BGon6hO@mRnjpmM79ye^LY_L2no{f_M?j80pr`o3BrI7ice#8#Zt4 zO45G97Hpef+AUEU%jN-dLmPYHY(|t#D)9|IeB^i1X|eEq+ymld_Uj$l^zVAPRilx- z^II$sL4G~{^7?sik2BK7;ZV-VIVhrKjUxBIsf^N&K`)5;PjVg-DTm1Xtw4-tGtElU zJgVTCk4^N4#-kPuX=7p~GMf5Jj5A#>)GX)FIcOqY4lf}Vv2gjrOTuFusB@ERW-&fb zTp=E0E?gXkwzn)AMMY*QCftp%MOL-cbsG{02$0~b?-JD{-nwj58 zBHO1YL~yn~RpnZ6*;XA|MSJeBfX-D?afH*E!2uGjT%k!jtx~OG_jJ`Ln}lMQb7W41 zmTIRd%o$pu;%2}}@2J$x%fg{DZEa-Wxdu6mRP~Ea0zD2+g;Dl*to|%sO-5mUrZ`~C zjJ zUe^**YRgBvlxl<(r0LjxjSQKiTx+E<7$@9VO=RYgL9ldTyKzfqR;Y&gu^ub!fVX7u z3H@;8j#tVgga~EMuXv_#Q8<*uK@R{mGzn92eDYkF1sbxh5!P|M-D)T~Ae*SO`@u$Q z7=5s)HM)w~s2j5{I67cqSn6BLLhCMcn0=OTVE?T7bAmY!T+xZ_N3op~wZ3Oxlm6(a5qB({6KghlvBd9HJ#V6YY_zxbj-zI`%FN|C*Q`DiV z#>?Kk7VbuoE*I9tJaa+}=i7tJnMRn`P+(08 za*0VeuAz!eI7giYTsd26P|d^E2p1f#oF*t{#klPhgaShQ1*J7?#CTD@iDRQIV+Z$@ z>qE^3tR3~MVu=%U%*W(1(waaFG_1i5WE}mvAax;iwZKv^g1g}qXY7lAd;!QQa#5e= z1_8KLHje1@?^|6Wb(A{HQ_krJJP1GgE*|?H0Q$5yPBQJlGi;&Lt<3Qc+W4c}Ih~@* zj8lYvme}hwf@Js%Oj=4BxXm15E}7zS0(dW`7X0|$damJ|gJ6~&qKL>gB_eC7%1&Uh zLtOkf7N0b;B`Qj^9)Bfh-( z0or96!;EwEMnxwp!CphwxxJ+DDdP4y3F0i`zZp-sQ5wxGIHIsZCCQz5>QRetx8gq{ zA33BxQ}8Lpe!_o?^u2s3b!a-$DF$OoL=|9aNa7La{$zI#JTu_tYG{m2ly$k?>Yc); zTA9ckzd+ibu>SE6Rc=Yd&?GA9S5oaQgT~ER-|EwANJIAY74|6 z($#j^GP}EJqi%)^jURCj&i;Zl^-M9{=WE69<*p-cmBIz-400wEewWVEd^21}_@A#^ z2DQMldk_N)6bhFZeo8dDTWD@-IVunEY*nYRON_FYII-1Q@@hzzFe(lTvqm}InfjQ2 zN>>_rUG0Lhaz`s;GRPklV?0 z;~t4S8M)ZBW-ED?#UNbCrsWb=??P># zVc}MW_f80ygG_o~SW+Q6oeIUdFqV2Fzys*7+vxr^ZDeXcZZc;{kqK;(kR-DKL zByDdPnUQgnX^>x?1Tz~^wZ%Flu}ma$Xmgtc7pSmBIH%&H*Tnm=L-{GzCv^UBIrTH5 zaoPO|&G@SB{-N8Xq<+RVaM_{lHo@X-q}`zjeayVZ9)5&u*Y>1!$(wh9Qoe>yWbPgw zt#=gnjCaT_+$}w^*=pgiHD8N$hzqEuY5iVL_!Diw#>NP7mEd?1I@Io+?=$?7cU=yK zdDKk_(h_dB9A?NX+&=%k8g+?-f&`vhAR}&#zP+iG%;s}kq1~c{ac1@tfK4jP65Z&O zXj8Ew>l7c|PMp!cT|&;o+(3+)-|SK&0EVU-0-c&guW?6F$S`=hcKi zpx{Z)UJcyihmN;^E?*;fxjE3kLN4|&X?H&$md+Ege&9en#nUe=m>ep3VW#C?0V=aS zLhL6v)|%$G5AO4x?Jxy8e+?*)YR~<|-qrKO7k7`jlxpl6l5H&!C4sePiVjAT#)b#h zEwhfkpFN9eY%EAqg-h&%N>E0#%`InXY?sHyptcct{roG42Mli5l)sWt66D_nG2ed@ z#4>jF?sor7ME^`pDlPyQ(|?KL9Q88;+$C&3h*UV*B+*g$L<{yT9NG>;C^ZmPbVe(a z09K^qVO2agL`Hy{ISUJ{khPKh@5-)UG|S8Sg%xbJMF)wawbgll3bxk#^WRqmdY7qv zr_bqa3{`}CCbREypKd!>oIh^IUj4yl1I55=^}2mZAAW6z}Kpt3_o1b4__sQ;b zv)1=xHO?gE-1FL}Y$0YdD-N!US;VSH>UXnyKoAS??;T%tya@-u zfFo)@YA&Q#Q^?Mtam19`(PS*DL{PHjEZa(~LV7DNt5yoo1(;KT)?C7%^Mg;F!C)q= z6$>`--hQX4r?!aPEXn;L*bykF1r8JVDZ)x4aykACQy(5~POL;InZPU&s5aZm-w1L< z`crCS5=x>k_88n(*?zn=^w*;0+8>ui2i>t*Kr!4?aA1`yj*GXi#>$h8@#P{S)%8+N zCBeL6%!Ob1YJs5+a*yh{vZ8jH>5qpZhz_>(ph}ozKy9d#>gba1x3}`-s_zi+SqIeR z0NCd7B_Z|Fl+(r$W~l@xbeAPl5{uJ{`chq}Q;y8oUN0sUr4g@1XLZQ31z9h(fE_y( z_iQ(KB39LWd;qwPIzkvNNkL(P(6{Iu{)!#HvBlsbm`g2qy&cTsOsAbwMYOEw8!+75D!>V{9SZ?IP@pR9sFG{T#R*6ez2&BmP8*m^6+H2_ z>%9pg(+R^)*(S21iHjLmdt$fmq6y!B9L!%+;wL5WHc^MZRNjpL9EqbBMaMns2F(@h zN0BEqZ3EWGLjvY&I!8@-WV-o@>biD;nx;D}8DPapQF5ivpHVim8$G%3JrHtvN~U&) zb1;=o*lGfPq#=9Moe$H_UhQPBjzHuYw;&e!iD^U2veY8)!QX_E(X@3hAlPBIc}HoD z*NH1vvCi5xy@NS41F1Q3=Jkfu&G{Syin^RWwWX|JqUIX_`}l;_UIsj&(AFQ)ST*5$ z{G&KmdZcO;jGIoI^+9dsg{#=v5eRuPO41<*Ym!>=zHAXH#=LdeROU-nzj_@T4xr4M zJI+d{Pp_{r=IPWj&?%wfdyo`DG1~|=ef?>=DR@|vTuc)w{LHqNKVz9`Dc{iCOH;@H5T{ zc<$O&s%k_AhP^gCUT=uzrzlEHI3q`Z3em0*qOrPHpfl1v=8Xkp{!f9d2p!4 zL40+eJB4@5IT=JTTawIA=Z%3AFvv=l1A~JX>r6YUMV7GGLTSaIn-PUw| z;9L`a<)`D@Qs(@P(TlafW&-87mcZuwFxo~bpa01_M9;$>;4QYkMQlFPgmWv!eU8Ut zrV2<(`u-@1BTMc$oA*fX;OvklC1T$vQlZWS@&Wl}d!72MiXjOXxmiL8oq;sP{)oBe zS#i5knjf`OfBl}6l;BSHeY31w8c~8G>$sJ9?^^!)Z*Z*Xg zbTbkcbBpgFui(*n32hX~sC7gz{L?nlnOjJBd@ zUC4gd`o&YB4}!T9JGTe9tqo0M!JnEw4KH7WbrmTRsw^Nf z^>RxG?2A33VG3>E?iN|`G6jgr`wCzKo(#+zlOIzp-^E0W0%^a>zO)&f(Gc93WgnJ2p-%H-xhe{MqmO z8Iacz=Qvx$ML>Lhz$O;3wB(UI{yTk1LJHf+KDL2JPQ6#m%^bo>+kTj4-zQ~*YhcqS z2mOX!N!Q$d+KA^P0`EEA^%>c12X(QI-Z}-;2Rr-0CdCUOZ=7QqaxjZPvR%{pzd21HtcUSU>u1nw?)ZCy+ zAaYQGz59lqhNXR4GYONpUwBU+V&<{z+xA}`Q$fajmR86j$@`MeH}@zz*ZFeBV9Ot< ze8BLzuIIDxM&8=dS!1-hxiAB-x-cVmtpN}JcP^`LE#2r9ti-k8>Jnk{?@Gw>-WhL=v+H!*tv*mcNvtwo)-XpMnV#X>U1F z?HM?tn^zY$6#|(|S~|P!BPp6mur58i)tY=Z-9(pM&QIHq+I5?=itn>u1FkXiehCRC zW_3|MNOU)$-zrjKnU~{^@i9V^OvOJMp@(|iNnQ%|iojG2_Snnt`1Cqx2t)`vW&w2l zwb#`XLNY@FsnC-~O&9|#Lpvw7n!$wL9azSk)$O}?ygN@FEY({2%bTl)@F2wevCv`; zZb{`)uMENiwE|mti*q5U4;4puX{VWFJ#QIaa*%IHKyrU*HtjW_=@!3SlL~pqLRs?L zoqi&}JLsaP)yEH!=_)zmV-^xy!*MCtc{n|d%O zRM>N>eMG*Qi_XAxg@82*#zPe+!!f#;xBxS#6T-$ziegN-`dLm z=tTN|xpfCPng06|X^6_1JgN}dM<_;WsuL9lu#zLVt!0{%%D9*$nT2E>5@F(>Fxi%Y zpLHE%4LZSJ1=_qm0;^Wi%x56}k3h2Atro;!Ey}#g&*BpbNXXS}v>|nn=Mi0O(5?=1V7y1^1Bdt5h3}oL@VsG>NAH z1;5?|Sth=0*>dbXSQ%MQKB?eN$LRu?yBy@qQVaUl*f#p+sLy$Jd>*q;(l>brvNUbIF0OCf zk%Q;Zg!#0w0_#l)!t?3iz~`X8A>Yd3!P&A4Ov6&EdZmOixeTd4J`*Wutura(}4w@KV>i#rf(0PYL&v^89QiXBP6sj=N;q8kVxS}hA! z|3QaiYz!w+xQ%9&Zg${JgQ*Ip_bg2rmmG`JkX^}&5gbZF!Z(gDD1s5{QwarPK(li- zW9y-CiQ`5Ug1ceN1w7lCxl=2}7c*8_XH8W7y0AICn19qZ`w}z0iCJ$tJ}NjzQCH90 zc!UzpKvk%3;`XfFi2;F*q2eMQQ5fzO{!`KU1T^J?Z64|2Z}b1b6h80_H%~J)J)kbM0hsj+FV6%@_~$FjK9OG7lY}YA zRzyYxxy18z<+mCBiX?3Q{h{TrNRkHsyF|eGpLo0fKUQ|19Z0BamMNE9sW z?vq)r`Qge{9wN|ezzW=@ojpVQRwp##Q91F|B5c`a0A{HaIcW>AnqQ*0WT$wj^5sWOC1S;Xw7%)n(=%^in zw#N*+9bpt?0)PY$(vnU9SGSwRS&S!rpd`8xbF<1JmD&6fwyzyUqk){#Q9FxL*Z9%#rF$} zf8SsEkE+i91VY8d>Fap#FBacbS{#V&r0|8bQa;)D($^v2R1GdsQ8YUk(_L2;=DEyN%X*3 z;O@fS(pPLRGatI93mApLsX|H9$VL2)o(?EYqlgZMP{8oDYS8)3G#TWE<(LmZ6X{YA zRdvPLLBTatiUG$g@WK9cZzw%s6TT1Chmw#wQF&&opN6^(D`(5p0~ zNG~fjdyRsZv9Y?UCK(&#Q2XLH5G{{$9Y4vgMDutsefKVVPoS__MiT%qQ#_)3UUe=2fK)*36yXbQUp#E98ah(v`E$c3kAce_8a60#pa7rq6ZRtzSx6=I^-~A|D%>Riv{Y`F9n3CUPL>d`MZdRmBzCum2K%}z@Z(b7#K!-$Hb<+R@Rl9J6<~ z4Wo8!!y~j(!4nYsDtxPIaWKp+I*yY(ib`5Pg356Wa7cmM9sG6alwr7WB4IcAS~H3@ zWmYt|TByC?wY7yODHTyXvay9$7#S?gDlC?aS147Ed7zW!&#q$^E^_1sgB7GKfhhYu zOqe*Rojm~)8(;b!gsRgQZ$vl5mN>^LDgWicjGIcK9x4frI?ZR4Z%l1J=Q$0lSd5a9 z@(o?OxC72<>Gun*Y@Z8sq@od{7GGsf8lnBW^kl6sX|j~UA2$>@^~wtceTt^AtqMIx zO6!N}OC#Bh^qdQV+B=9hrwTj>7HvH1hfOQ{^#nf%e+l)*Kgv$|!kL5od^ka#S)BNT z{F(miX_6#U3+3k;KxPyYXE0*0CfL8;hDj!QHM@)sekF9uyBU$DRZkka4ie^-J2N8w z3PK+HEv7kMnJU1Y+>rheEpHdQ3_aTQkM3`0`tC->mpV=VtvU((Cq$^(S^p=+$P|@} zueLA}Us^NTI83TNI-15}vrC7j6s_S`f6T(BH{6Jj{Lt;`C+)d}vwPGx62x7WXOX19 z2mv1;f^p6cG|M`vfxMhHmZxkkmWHRNyu2PDTEpC(iJhH^af+tl7~h?Y(?qNDa`|Ogv{=+T@7?v344o zvge%8Jw?LRgWr7IFf%{-h>9}xlP}Y#GpP_3XM7FeGT?iN;BN-qzy=B# z=r$79U4rd6o4Zdt=$|I3nYy;WwCb^`%oikowOPGRUJ3IzChrX91DUDng5_KvhiEZwXl^y z+E!`Z6>}ijz5kq$nNM8JA|5gf_(J-);?SAn^N-(q2r6w31sQh6vLYp^ z<>+GyGLUe_6eTzX7soWpw{dDbP-*CsyKVw@I|u`kVX&6_h5m!A5&3#=UbYHYJ5GK& zLcq@0`%1;8KjwLiup&i&u&rmt*LqALkIqxh-)Exk&(V)gh9@Fn+WU=6-UG^X2~*Q-hnQ$;;+<&lRZ>g0I`~yuv!#84 zy>27(l&zrfDI!2PgzQyV*R(YFd`C`YwR_oNY+;|79t{NNMN1@fp?EaNjuM2DKuG%W z5749Br2aU6K|b=g4(IR39R8_!|B`uQ)bun^C9wR4!8isr$;w$VOtYk+1L9#CiJ#F) z)L}>^6>;X~0q&CO>>ZBo0}|Ex9$p*Hor@Ej9&75b&AGqzpGpM^dx}b~E^pPKau2i5 zr#tT^S+01mMm}z480>-WjU#q`6-gw4BJMWmW?+VXBZ#JPzPW5QQm@RM#+zbQMpr>M zX$huprL(A?yhv8Y81K}pTD|Gxs#z=K(Wfh+?#!I$js5u8+}vykZh~NcoLO?ofpg0! zlV4E9BAY_$pN~e-!VETD&@v%7J~_jdtS}<_U<4aRqEBa&LDpc?V;n72lTM?pIVG+> z*5cxz_iD@3vIL5f9HdHov{o()HQ@6<+c}hfC?LkpBEZ4xzMME^~AdB8?2F=#6ff!F740l&v7FN!n_ zoc1%OfX(q}cg4LDk-1%|iZ^=`x5Vs{oJYhXufP;BgVd*&@a04pSek6OS@*UH`*dAp z7wY#70IO^kSqLhoh9!qIj)8t4W6*`Kxy!j%Bi%(HKRtASZ2%vA0#2fZ=fHe0zDg8^ zucp;9(vmuO;Zq9tlNH)GIiPufZlt?}>i|y|haP!l#dn)rvm8raz5L?wKj9wTG znpl>V@};D!M{P!IE>evm)RAn|n=z-3M9m5J+-gkZHZ{L1Syyw|vHpP%hB!tMT+rv8 zIQ=keS*PTV%R7142=?#WHFnEJsTMGeG*h)nCH)GpaTT@|DGBJ6t>3A)XO)=jKPO<# zhkrgZtDV6oMy?rW$|*NdJYo#5?e|Nj>OAvCXHg~!MC4R;Q!W5xcMwX#+vXhI+{ywS zGP-+ZNr-yZmpm-A`e|Li#ehuWB{{ul8gB&6c98(k59I%mMN9MzK}i2s>Ejv_zVmcMsnobQLkp z)jmsJo2dwCR~lcUZs@-?3D6iNa z2k@iM#mvemMo^D1bu5HYpRfz(3k*pW)~jt8UrU&;(FDI5ZLE7&|ApGRFLZa{yynWx zEOzd$N20h|=+;~w$%yg>je{MZ!E4p4x05dc#<3^#{Fa5G4ZQDWh~%MPeu*hO-6}2*)t-`@rBMoz&gn0^@c)N>z|Ikj8|7Uvdf5@ng296rq2LiM#7KrWq{Jc7;oJ@djxbC1s6^OE>R6cuCItGJ? z6AA=5i=$b;RoVo7+GqbqKzFk>QKMOf?`_`!!S!6;PSCI~IkcQ?YGxRh_v86Q%go2) zG=snIC&_n9G^|`+KOc$@QwNE$b7wxBY*;g=K1oJnw8+ZR)ye`1Sn<@P&HZm0wDJV* z=rozX4l;bJROR*PEfHHSmFVY3M#_fw=4b_={0@MP<5k4RCa-ZShp|CIGvW^9$f|BM#Z`=3&=+=p zp%*DC-rEH3N;$A(Z>k_9rDGGj2&WPH|}=Pe3(g}v3=+`$+A=C5PLB3UEGUMk92-erU%0^)5FkU z^Yx#?Gjyt*$W>Os^Fjk-r-eu`{0ZJbhlsOsR;hD=`<~eP6ScQ)%8fEGvJ15u9+M0c|LM4@D(tTx!T(sRv zWg?;1n7&)-y0oXR+eBs9O;54ZKg=9eJ4gryudL84MAMsKwGo$85q6&cz+vi)9Y zvg#u>v&pQQ1NfOhD#L@}NNZe+l_~BQ+(xC1j-+({Cg3_jrZ(YpI{3=0F1GZsf+3&f z#+sRf=v7DVwTcYw;SiNxi5As}hE-Tpt)-2+lBmcAO)8cP55d0MXS*A3yI5A!Hq&IN zzb+)*y8d8WTE~Vm3(pgOzy%VI_e4lBx&hJEVBu!!P|g}j(^!S=rNaJ>H=Ef;;{iS$$0k-N(`n#J_K40VJP^8*3YR2S`* zED;iCzkrz@mP_(>i6ol5pMh!mnhrxM-NYm0gxPF<%(&Az*pqoRTpgaeC!~-qYKZHJ z2!g(qL_+hom-fp$7r=1#mU~Dz?(UFkV|g;&XovHh~^6 z1eq4BcKE%*aMm-a?zrj+p;2t>oJxxMgsmJ^Cm%SwDO?odL%v6fXU869KBEMoC0&x>qebmE%y+W z51;V2xca9B=wtmln74g7LcEgJe1z7o>kwc1W=K1X7WAcW%73eGwExo&{SSTnXR+pA zRL)j$LV7?Djn8{-8CVk94n|P>RAw}F9uvp$bpNz<>Yw3PgWVJo?zFYH9jzq zU|S+$C6I?B?Jm>V{P67c9aRvK283bnM(uikbL=``ew5E)AfV$SR4b8&4mPDkKT&M3 zok(sTB}>Gz%RzD{hz|7(AFjB$@#3&PZFF5_Ay&V3?c&mT8O;9(vSgWdwcy?@L-|`( z@@P4$nXBmVE&Xy(PFGHEl*K;31`*ilik77?w@N11G7IW!eL@1cz~XpM^02Z?CRv1R z5&x6kevgJ5Bh74Q8p(-u#_-3`246@>kY~V4!XlYgz|zMe18m7Vs`0+D!LQwTPzh?a zp?X169uBrRvG3p%4U@q_(*^M`uaNY!T6uoKk@>x(29EcJW_eY@I|Un z*d;^-XTsE{Vjde=Pp3`In(n!ohHxqB%V`0vSVMsYsbjN6}N6NC+Ea`Hhv~yo@ z|Ab%QndSEzidwOqoXCaF-%oZ?SFWn`*`1pjc1OIk2G8qSJ$QdrMzd~dev;uoh z>SneEICV>k}mz6&xMqp=Bs_0AW81D{_hqJXl6ZWPRNm@cC#+pF&w z{{TT0=$yGcqkPQL>NN%!#+tn}4H>ct#L#Jsg_I35#t}p)nNQh>j6(dfd6ng#+}x3^ zEH`G#vyM=;7q#SBQzTc%%Dz~faHJK+H;4xaAXn)7;)d(n*@Bv5cUDNTnM#byv)DTG zaD+~o&c-Z<$c;HIOc!sERIR>*&bsB8V_ldq?_>fT!y4X-UMddUmfumowO!^#*pW$- z_&)moxY0q!ypaJva)>Bc&tDs?D=Rta*Wc^n@uBO%dd+mnsCi0aBZ3W%?tz844FkZD zzhl+RuCVk=9Q#k;8EpXtSmR;sZUa5(o>dt+PBe96@6G}h`2)tAx(WKR4TqXy(YHIT z@feU+no42!!>y5*3Iv$!rn-B_%sKf6f4Y{2UpRgGg*dxU)B@IRQ`b{ncLrg9@Q)n$ zOZ7q3%zL99j1{56$!W(Wu{#m|@(6BBb-*zV23M!PmH7nzOD@~);0aK^iixd%>#BwR zyIlVF*t4-Ww*IPTGko3RuyJ*^bo-h}wJ{YkHa2y3mIK%U%>PFunkx0#EeIm{u93PX z4L24jUh+37=~WR47l=ug2cn_}7CLR(kWaIpH8ojFsD}GN3G}v6fI-IMK2sXnpgS5O zHt<|^d9q}_znrbP0~zxoJ-hh6o81y+N;i@6M8%S@#UT)#aKPYdm-xlbL@v*`|^%VS(M$ zMQqxcVVEKe5s~61T77N=9x7ndQ=dzWp^+#cX}v`1bbnH@&{k?%I%zUPTDB(DCWY6( zR`%eblFFkL&C{Q}T6PTF0@lW0JViFzz4s5Qt?P?wep8G8+z3QFAJ{Q8 z9J41|iAs{Um!2i{R7&sV=ESh*k(9`2MM2U#EXF4!WGl(6lI!mg_V%pRenG>dEhJug z^oLZ?bErlIPc@Jo&#@jy@~D<3Xo%x$)(5Si@~}ORyawQ{z^mzNSa$nwLYTh6E%!w_ zUe?c`JJ&RqFh1h18}LE47$L1AwR#xAny*v9NWjK$&6(=e0)H_v^+ZIJ{iVg^e_K-I z|L;t=x>(vU{1+G+P5=i7QzubN=dWIe(bqeBJ2fX85qrBYh5pj*f05=8WxcP7do(_h zkfEQ1Fhf^}%V~vr>ed9*Z2aL&OaYSRhJQFWHtirwJFFkfJdT$gZo;aq70{}E#rx((U`7NMIb~uf>{Y@Fy@-kmo{)ei*VjvpSH7AU zQG&3Eol$C{Upe`034cH43cD*~Fgt?^0R|)r(uoq3ZjaJqfj@tiI~`dQnxfcQIY8o| zx?Ye>NWZK8L1(kkb1S9^8Z8O_(anGZY+b+@QY;|DoLc>{O|aq(@x2=s^G<9MAhc~H z+C1ib(J*&#`+Lg;GpaQ^sWw~f&#%lNQ~GO}O<5{cJ@iXSW4#};tQz2#pIfu71!rQ( z4kCuX$!&s;)cMU9hv?R)rQE?_vV6Kg?&KyIEObikO?6Nay}u#c#`ywL(|Y-0_4B_| zZFZ?lHfgURDmYjMmoR8@i&Z@2Gxs;4uH)`pIv#lZ&^!198Fa^Jm;?}TWtz8sulPrL zKbu$b{{4m1$lv0`@ZWKA|0h5U!uIwqUkm{p7gFZ|dl@!5af*zlF% zpT-i|4JMt%M|0c1qZ$s8LIRgm6_V5}6l6_$cFS# z83cqh6K^W(X|r?V{bTQp14v|DQg;&;fZMu?5QbEN|DizzdZSB~$ZB%UAww;P??AT_-JFKAde%=4c z*WK^Iy5_Y`*IZ+cF`jvkCv~Urz3`nP{hF!UT7Z&e;MlB~LBDvL^hy{%; z7t5+&Ik;KwQ5H^i!;(ly8mfp@O>kH67-aW0cAAT~U)M1u`B>fG=Q2uC8k}6}DEV=% z<0n@WaN%dDBTe*&LIe^r-!r&t`a?#mEwYQuwZ69QU3&}7##(|SIP*4@y+}%v^Gb3# zrJ~68hi~77ya4=W-%{<(XErMm>&kvG`{7*$QxRf(jrz|KGXJN3Hs*8BfBx&9|5sZ1 zpFJ1(B%-bD42(%cOiT@2teyYoUBS`L%<(g;$b6nECbs|ADH5$LYxj?i3+2^#L@d{%E(US^chG<>aL7o>Fg~ zW@9wW@Mb&X;BoMz+kUPUcrDQOImm;-%|nxkXJ8xRz|MlPz5zcJHP<+yvqjB4hJAPE zRv>l{lLznW~SOGRU~u77UcOZyR#kuJrIH_){hzx!6NMX z>(OKAFh@s2V;jk|$k5-Q_ufVe;(KCrD}*^oBx{IZq^AB|7z*bH+g_-tkT~8S$bzdU zhbMY*g?Qb;-m|0`&Jm}A8SEI0twaTfXhIc=no}$>)n5^cc)v!C^YmpxLt=|kf%!%f zp5L$?mnzMt!o(fg7V`O^BLyjG=rNa}=$hiZzYo~0IVX$bp^H-hQn!;9JiFAF<3~nt zVhpABVoLWDQ}2vEEF3-?zzUA(yoYw&$YeHB#WGCXkK+YrG=+t0N~!OmTN;fK*k>^! zJW_v+4Q4n2GP7vgBmK;xHg^7zFqyTTfq|0+1^H2lXhn6PpG#TB*``?1STTC#wcaj3 zG~Q9!XHZ#1oPZo zB6h(BVIW5K+S@JG_HctDLHWb;wobZ0h(3xr6(uUspOSK0WoSHeF$ZLw@)cpoIP|kL zu`GnW>gD$rMt}J0qa9kJzn0s`@JNy1Crkb&;ve|()+_%!x%us>1_Xz|BS>9oQeD3O zy#CHX#(q^~`=@_p$XV6N&RG*~oEH$z96b8S16(6wqH)$vPs=ia!(xPVX5o&5OIYQ%E(-QAR1}CnLTIy zgu1MCqL{_wE)gkj0BAezF|AzPJs=8}H2bHAT-Q@Vuff?0GL=)t3hn{$Le?|+{-2N~`HWe24?!1a^UpC~3nK$(yZ_Gp(EzP~a{qe>xK@fN zEETlwEV_%9d1aWU0&?U>p3%4%>t5Pa@kMrL4&S@ zmSn!Dllj>DIO{6w+0^gt{RO_4fDC)f+Iq4?_cU@t8(B^je`$)eOOJh1Xs)5%u3hf; zjw$47aUJ9%1n1pGWTuBfjeBumDI)#nkldRmBPRW|;l|oDBL@cq1A~Zq`dXwO)hZkI zZ=P7a{Azp06yl(!tREU`!JsmXRps!?Z~zar>ix0-1C+}&t)%ist94(Ty$M}ZKn1sDaiZpcoW{q&ns8aWPf$bRkbMdSgG+=2BSRQ6GG_f%Lu#_F z&DxHu+nKZ!GuDhb>_o^vZn&^Sl8KWHRDV;z#6r*1Vp@QUndqwscd3kK;>7H!_nvYH zUl|agIWw_LPRj95F=+Ex$J05p??T9_#uqc|q>SXS&=+;eTYdcOOCJDhz7peuvzKoZhTAj&^RulU`#c?SktERgU|C$~O)>Q^$T8ippom{6Ze0_44rQB@UpR~wB? zPsL@8C)uCKxH7xrDor zeNvVfLLATsB!DD{STl{Fn3}6{tRWwG8*@a2OTysNQz2!b6Q2)r*|tZwIovIK9Ik#- z0k=RUmu97T$+6Lz%WQYdmL*MNII&MI^0WWWGKTTi&~H&*Ay7&^6Bpm!0yoVNlSvkB z;!l3U21sJyqc`dt)82)oXA5p>P_irU*EyG72iH%fEpUkm1K$?1^#-^$$Sb=c8_? zOWxxguW7$&-qzSI=Z{}sRGAqzy3J-%QYz2Cffj6SOU|{CshhHx z6?5L$V_QIUbI)HZ9pwP9S15 zXc%$`dxETq+S3_jrfmi$k=)YO5iUeuQ&uX}rCFvz&ubO?u)tv|^-G_`h$pb+8vn@f z7@eQe#Kx|8^37a4d0GulYIUAW|@I5|NIh%=OqHU{(>(UhKvJ}i_X*>!Geb+Rs0MWf66Lf z-cQ(4QOENSbTX$6w_9w4{5eR?14#?)Jqf2UCk5US4bnz8!e>vFduH6(cZZ=5*_!M# zUTZ_b<4v@}dSQOcH@wt-s;3JhkVDct$6k9!ETdi-tplkaxl^qF=p}Q8KMVm+ zeIa2q?RYr}nM0d_W2YWv%JKyCrGSePj8GrRN)<$Nsq8l$X=>`W;?>0eME3|8t&d$~ zH`XG45lBh>-te_f0Mh0??)=Ee0~zESx=sZPv<#!sAVv$0qTn@CmCUNJU<#=`GC)&P z9zuV~9*3_n2*ZQBUh)2xIi;0yo)9XXJxM-VB*6xpyz{Rx2ZCvFnF$2aPcYFG( zyXkO(B30?mt;5GW&{m^w3?!P`#_o;Y%P2z^A`|4%Bt2@3G?C2dcSPNy1#HMXZ>{+L z3BE#xvqR@Ub}uKfzGC=RO|W%dJpUK#m8p&Dk|6Ub8S+dN3qxf9dJ_|WFdM9CSNQv~ zjaFxIX`xx-($#Fq+EI76uB@kK=B4FS0k=9(c8UQnr(nLQxa2qWbuJyD7%`zuqH|eF zNrpM@SIBy@lKb%*$uLeRJQ->ko3yaG~8&}9|f z*KE`oMHQ(HdHlb&)jIzj5~&z8r}w?IM1KSdR=|GFYzDwbn8-uUfu+^h?80e*-9h%Nr;@)Q-TI#dN1V zQPT2;!Wk)DP`kiY<{o7*{on%It(j0&qSv=fNfg3qeNjT@CW{WT<)1Eig!g9lAGx6& zk9_Zrp2I+w_f!LRFsgxKA}gO=xSPSY``kn=c~orU4+0|^K762LWuk_~oK{!-4N8p8 zUDVu0ZhvoD0fN8!3RD~9Bz5GNEn%0~#+E-Js}NTBX;JXE@29MdGln$Aoa3Nzd@%Z= z^zuGY4xk?r(ax7i4RfxA?IPe27s87(e-2Z_KJ(~YI!7bhMQvfN4QX{!68nj@lz^-& z1Zwf=V5ir;j*30AT$nKSfB;K9(inDFwbI^%ohwEDOglz}2l}0!#LsdS3IW43= zBR#E@135bu#VExrtj?)RH^PM(K4B`d=Z6^kix`8$C1&q)w1<&?bAS?70}9fZwZU7R z5RYFo?2Q>e3RW2dl&3E^!&twE<~Lk+apY?#4PM5GWJb2xuWyZs6aAH-9gqg${<1?M zoK&n+$ZyGIi=hakHqRu{^8T4h@$xl?9OM46t;~1_mPs9}jV58E-sp!_CPH4<^A|Q5 zedUHmiyxTc2zgdxU?4PyQ{ON@r+Ucn1kjWSOsh6WzLV~Bv&vWLaj#Xz4VSDs*F#@M>#e^ixNCQ-J|iC=LcB*M4WUb>?v6C z14^8h9Ktd1>XhO$kb-rRL}SFTH)kSu+Dwds$oed7qL)Jbd zhQys4$Uw~yj03)6Kq+K-BsEDftLgjDZk@qLjAyrb5UMeuO^>D43g%0GoKJ~TO0o!D z9E$WfxEDFTT?~sT?|!7aYY*mpt`}i;WTgY|Cb4{Cscrmzb(?UE+nz1wC3#QSjbg>N zleu?7MGaQ&FtejK#?07Uq$vIZX5FqR*a=(zUm`Fq$VUl){GQ{2MA)_j4H$U8FZ`=A z&GU_an)?g%ULunbBq4EUT7uT=vI6~uapKC|H6uz1#Rqt$G(!hE7|c8_#JH%wp9+F? zX`ZigNe9GzC(|Nr8GlmwPre3*Nfu+ zF=SHtv_g@vvoVpev$Jxs|F7CH`X5#HAI=ke(>G6DQQ=h^U8>*J=t5Z3Fi>eH9}1|6 znwv3k>D=kufcp= zAyK#v05qERJxS_ts79QVns}M?sIf(hCO0Q9hKe49a@PzvqzZXTAde6a)iZLw|8V-) ziK`-s)d(oQSejO?eJki$UtP0ped)5T1b)uVFQJq*`7w8liL4TX*#K`hdS!pY9aLD+ zLt=c$c_wt^$Wp~N^!_nT(HiDVibxyq2oM^dw-jC~+3m-#=n!`h^8JYkDTP2fqcVC& zA`VWy*eJC$Eo7qIe@KK;HyTYo0c{Po-_yp=>J(1h#)aH5nV8WGT(oSP)LPgusH%N$?o%U%2I@Ftso10xd z)Tx(jT_vrmTQJDx0QI%9BRI1i!wMNy(LzFXM_wucgJGRBUefc413a9+)}~*UzvNI{KL# z_t4U&srNV|0+ZqwL(<}<%8QtjUD8kSB&p$v^y}vuEC2wyW{aXp2{LTi$EBEHjVnS# z+4=G$GUllsjw&hTbh6z%D2j=cG>gkNVlh|24QUfD*-x9OMzTO93n*pE(U7Vz7BaL% z@(c!GbEjK~fH}sqbB1JNI!~b+AYb5le<-qxDA9&r2o)|epl9@5Ya7}yVkcM)yW6KY7QOX_0-N=)+M!A$NpG? z6BvZ8Tb}Pw(i9f7S00=KbWmNvJGL(-MsAz3@aR~PM$Z>t)%AiCZu?A|?P*~UdhhFT`;Nb)MxIg*0QlkYVX+46( zSd%WoWR@kYToK7)(J=#qUD-ss;4M&27w#03y6$gk6X<-VL8AJM@NFTx#Z!n)F5T357%njjKyjro(yW8ceP{!%;*Y>DN`&_18p(z2Hg$%K zohbgJcp%+ux%q6F?(sc_mYJ<$;DxgkTEi?yjT6Du@+n(KsKtFHcO%7O z=AsfLSTdE2>7a@0^`;)?Fg|s2XOPV&fo<%Q)Izaw4s&RvrX0^+aPNq|yE?oSa7 zsnNs!+vGcTM4yM|$9so*2Nv;ngDD}b0MjH6i4e|l^O`lzCRj)-qa6f%|afJpmf(S1J2k7Nt^!;Q}0 z4ejPF?^M~Sv+@LYn&IFUk2;1h?kb8lfrT`oMm=JBm{fo5N|HY~yQQ`T*e2?!tF%*t zf+ncx15$NdF82GXrpP5rJ7!PVE3>u`ME$9Hw5RlP zUh+s#pg{9kEOsAhvu2pry#@dvbB3Lti+9VkLxPZSl;fNr9}wv1cTahUw_Py7%Xp;C zaz__|kz*ydKiYbsqK{?cXhqR(!1KMoV-+!mz>3S8S`Va4kD#(aKyqecGXB^nF*>mS z1gG>fKZc?R~Tye>%x+43D8=e zf0eKr-)>VEu7^I{%T}BT-WaGXO3+x<2w2jwnXePdc2#BdofU6wbE)ZWHsyj=_NT3o z)kySji#CTEnx8*-n=88Ld+TuNy;x$+vDpZ)=XwCr_Gx-+N=;=LCE7CqKX9 zQ-0{jIr zktqqWCgBa3PYK*qQqd=BO70DfM#|JvuW*0%zmTE{mBI$55J=Y2b2UoZ)Yk z3M%rrX7!nwk#@CXTr5=J__(3cI-8~*MC+>R);Z)0Zkj2kpsifdJeH)2uhA|9^B;S$ z4lT3;_fF@g%#qFotZ#|r-IB*zSo;fokxbsmMrfNfJEU&&TF%|!+YuN=#8jFS4^f*m zazCA-2krJ-;Tkufh!-urx#z*imYo|n6+NDGT#*EH355(vRfrGnr*x z5PWMD7>3IwEh=lO^V>O>iLP~S!GjrvI5lx<7oOg(d;6uEFqo5>IwptBQz;`>zx`n$ zjZQ#Hb)qJdQy#ML&qcfmb$KT+f_1#uYNo7HHDY}7xAw8qbl;9LWO-cndfI=5$%jBw zb}K3U%88Fg^|&0Vc~99bKl|$3JzdawRZ|`7%1S<8B7>9*rWAT0U<@mHDfnL1`~1U| zDw7m@<@}C|zqeHM(OK@di6~sKHiJvk^I0^S<LBe^_xZsUOzVkYSE)Bxn*NekQYbyTn5SRt!n{EseOo-$u)vjM(PV%6cIG3Kv$>dd}HUyXi;_Lv>}OyUj38dPe8+1Pr?{LXnIBCoTnocD60@vhsz+GG5lJB9ncgP8T6@LwuzZ)J zKETBS~AvzGE!{u^+Rd-|Gn!rc@UUnioP0{@_j_>tg8YI#?y zL-H$=&xXkCJ2Qe7&exbI!z`OyPxBp|4_ zZrrc;OAb%T4Ze%7E}FBB`8t$QN0sA3vpwU>?7QAmE%-ethXdCtby$Qm3v$lNxB2a7 ze6F5eEWV`={#W(G)Va}7?$D65WF|f0nmfZT;?=LE6Yz{{W3CV2h^Ma+LXdZ(HMVKZ z!YXJ*34lo!FA>)jSo@*!Hs_)IwmTo6pBr3c^j2u_amZ~g;&Z2jZIw!}v@w8DtZz7|A%rFksD4^HYB!xFAqX;u0HxPeG!3Z(z z4}+^N5-nckKf2YSR5R_}PD+2?Wq#BOiON74#{`u=4f59WKdy_77EYq~_|X6cNtno{ zZ?WLwbV57Z6uI|uY_;vzv~~`eiiOl($Au7C*X<&MY5v0b`KEu-GW}{2UNfmmrP!^Y zAOczy!}TIJsom=}kxH)9W`&Rp&rR6T7y&~5nXbut;wcs@M?aa^9j{ZDtx=1?P8TV{ zee2kKf%CE$mogyKKT=xQQ#)OCl9bjc)}{p2X$}aG`^B0w0yi-rI!d4e-u9uR$kJK3 zhqBG9Wx<-3DFw5olJ6neF@hB;8o(r(GB_;p1i>}cjN`JNEZg-dlxtLL=8~gfLrBy_ z1~bGh{I>_xqh(}?%bCf1U6~K@+N*i}bTi+pUAW)oM0`D*PeJq=S(-|Plxe9OqxBRg zM((r)xkSH@j!8@+=cA4US0fDL&O?W~x=Mlu>7zvHO2sy7D5_7ulP+YMecP~}F0b*K z3oO2j{o&WHd<&UWcyA(&6hvBJv}qUZ!@R<(mwKB^;y3zeE1>LzbDWSkRD1|5MZPx( zxd=&MsQi1eE@@6W+4N`cF?yh!3R5JlAV--&RONWQ#?SbrQ95<@ag>C{jQmGXpQX{) z1dbFg1_`qLxuDZnX#PKfCW*Jl3F&^7@gO&{>Nb8um$VBcF1!AL=N6`A%BFj=`QaPI z+m^`n+{o)KLif;Gt|7aQ(XXRP@x)jJt}s{&S`I3}jPTY>$@W0BD3Oif^ehs~!H7T1FUSWxLS&W;0q6+azjbWn?3!q$ z9qbmdr4H4Y)p^NOACJ^L>u}NS8T0_5hW)G z%Hv}dAqM}d@t;|hf8>+NHHPi*xePsRlqr46njzhiXXZti7i5+GTKcrlxA->OJ9*Pna`02EIA5~(SMV`T@H6F2VtwwP1$tYujbC1^VE$Yd&I`WSwB^1( zT7NP3|85z#R%&wktjwY_i*n_$RRZPM^ota{LPV%*>=>sAv%fn*cnkCIX{^SJRmwZv z!?f@T&D%Lz@*!mNYTGp{J|7)~PR*ib`;l^E)rQw@)Qn0ECnB8W1S_SbLZWdqcmo?V zX5g0_3qhn4TrN27^x#Qdq*4*G1L|)I^b8GuP_8O{p|M`uvZO6McXa>OSQRW|kQTNPZ#Zyj~SZ<`6B)Y+}jxpn+YT>MhZ!Rxyd@rU>N zP>MkDBLX|<)SJaO?Ge=!D>i+Wq&PgneO?ZXUq4IQuTq z+V{ZGkuw77o~o$!b>4ov`6CKJ)$cf=S6%1ZQyYU!kz_qiuNxY2*Bh;K9J6o_YV6xQ znW|>x+#Mymu&wF9P|3wP*(ZjwE+ou|{eFqMv}d_iEyH zQ?NSf3VX+EpbrIKmp|oD-t_rh(D#e)fp)dYbG{=yPj-3-#l+iu7r+~#w|(#wv@G0` z38`Yhf5CznhyDEhD;jzaz7fc8L?(n-m zR#|5hqq#yRoeTm+h^9J42mnB>BY>HSu&&O-Hxo6j!dqck)dGS&odS@Hsk2-*Z~x z0!%{@gT645S5DeF@JZeE$DFl*nJB8Z|JKvs%7d`KjbJ*AsA_=fEZ&V9=*+K{(TF^( ztjjYr(7@fV^tDs9c*#=8)ZRKO17A5Z`8v*)U+?hS>3sEfgh3`#vFO^7n}&&adV?}n zdy&BY1h|I@eBm=l*kqiJn>vNkOH4l$Op5Hw3K_w8lF!6T@-H)S2W|Km#6!-X#NqLJ zsiVDrc%*@I3^Gen$)6O0C_qw;8{aucF;}U^1%YE`?AYTtb`Z$B$vfhcHQF`VCB(Pf z_G#fV*Colv-k!O+=^nDNe(03?m+RTu&28d%>JrrwFNb{ND&?Ad(=DP@voz$usk1|w z&#gTB7F)#*LtY6@pIb(g72*LcnXRlTPQAD?)ZFnB*EsZqxM&Uk_KGXnR{4}K`I6i- zU9}R>tiO0De1Hx=kAy>7O+nKO@kGQEYOai&S9&WTY+flvR?uhI695W-xZnq4aRMh8 zwfp)+KYWVB#r=5AwwlSdM4@x7-R_{2;1iqz2lXL$7iu1>5W*+I)jlkMs>60=LN)Y= zbPw;;%U+%p_&{2Obemh$BLmbpDd31YxJ8#TpH3~3B8QLUMvx1X5Vl48hWSNN*UTlO zQgQyZbmyjGC-s$3tnB z0mfKUu2+_c`ZVvDVwUy#j3W*l^BSXXQ%=r6Z}C73jx8DAk!t7k{dK^udpHIcUejp# zyx}og$Hr+f>9kaZvno*Om`d|VTUce9tHM=R8thoG!a=NT$s;g@n_rAN%cp7nnLuav z6}j56TSSfPL$p#y#!5TVyqa3zTzi7@#IoeR=E6CdS`JrR+@i2DwZ?T*bh+(k5!a)0 zgRdF93z8XJ|5?>hDN!YAW5cK=+BwDLNT_+otd zqC@*{S0hCKZ+TnN*2&qx+WP;ZjHA`yytPcwKl~)uy)sQ}Q*0-&3X|YFYAjmolaciq zxS$r5^fxICetD*Dw78M9leVvhAOZ$=;SP7L!Vs?+0f1h*YCuTXIt03iAf)0=0KEvZ zB69o-zg`0C#hQ>`4`}1g=a~EID(j9HbjJG^tV-zumR-+fahTPveA{%0u2uQwMZ%}5 zwY!|}i0oTd&>^QSRhIKU+cMC#|C3f>|647?v1B(wH)EWb{vuJEJh~!#|J7%=h!x3| zCH6m}wg;>Q&?@5Ct1%n`lj%*>9a52d@wmvE`=aQjtz$sWj3V;fDns5<7d2*``)u1( zh!Ub>!#N0m=Vz1n1=El zwb2IVRw$6NIFRpGyUoM0iqc$IPehcmm7<0s7F*Yv+zq?_%pf*SS~~}s0M`m(rMbx% zi?|Wjr6fJN`_J8&B2$4+V+iO~m>s~Zr2T3Y3HGREFQ%%pEoU0N));AeSVM#gYQ>l} z0`RhgS`R^pJH31YQ~eTeJiI}g$&^|nv{!h?8mJK{{XDt+sG8D`7)$jvM#hjPI(5sS zfFW4s7wao%Lo| z#pJRC?iZOai;57ANs|vm6%}rPlGo}}Aso1t#xJn}%VW@~1WSjh(@JTgM$0x6ZQ)gB zdiox3f>kqGZY}+R<;wlNoWJ8#X-v)1;wRD*ec*wnvsN06Q@cZuD`deT-Bu&G;2fBC z0FE1%pG@{Yo2O87&dE;w???%`9s1gs=3GpM8xx_}=AB$K9y=cD);^iE*p4;T1RU%B zBPr)yqOBX<2}xt%g9qr>;z&|?4vhhw7@$a}Uy2b%_^VdB^VfzrebKUPnq;hliCNU% zVt3R5EHkhN^Pv`REF+npA@#HdCQN9IbQbqSDs^+zt(A6;rLwN+@Em}WrV5vPEo!w^ zSCd3RZ8{7a@d9@|IF&&G%irS7FHle?@49LctrtTt=rP$W)se*#RkFmyf)D1^U6EYI zfh+N?uH?-))O$9zM19VsuGn8?o~5`scXU?!P@_cWP&1U4PQqGus=sQzrX+YvKG%XBL3nt6!&M<#}wqA;Mo(}qrq<1lNkpQD-T#-y>grt|E+JNU) z2j+g+QPcA9VEFc0k;H(hSNOpp$I+!$ z&d&W6kBM9+c{X%vr_X0}tdB5dvEDyk5H2*T(QW8Yz-#tjvF?up=^Kfym``^!&O-X! z@HdfpHn;}_)y$Xjb-5cR$Q#-XdhKpmJG5pl>h*Q2(u*gt_4(>6?kG)%T3*&TT0qI( zL!aR~4HiJiaHlgdNcOQP6xx1f3AWx&8}(NEps|G!cO>J^rE2@&-t#_Jb7GYgnLnML~1ze1D$?~BwbgA^=pr55tC|d7w42vN11_8bS75u z_MRKqE7Xik8fk>6(VE5{qT}6rSzd|o}Zb>*aI*Bwg%ccE$_ytH;g2H z^i3qY!+aE*&s^BMH9TI6GLm&9c`D6)3{-+?2Pon+040Yuv$2(LqV*krKhTg5CHOj* zquacxc1&~=S(O@gR8aI#?R%)meONmw1rub9E2QzeM$pBBm2wbPNR3tab{op53<oFwaUbARdD5jSA_6zmKX7!VicEP1m)rYnk{P- zruRj;4c8S29Rd#Baf|fq_pA^r3K#qRHS;($XNoLI*`puZjM?bA0tH>FDiVc9qR*|3 zGn#nhqxkvqFwRfCB~2yA0pxWapfjCdAem$utuon-`*6}mUP?l%$CE(FjAwL%Oe7GQbu7*+&q>*(cAofJr^gg>xw>hx-SO7Lx2)I} zJ)tV1XKbkE4sS&La#-smSq>S9gBzGLH%v?KVezdGv%Xs}kDJZJi{lDl(FpLZupBta z3iDlkd6LlkRro}+El?GIObw06D%NTXpL{W}Ve*%u#{wTC=+VHS%o`sAez&cYz|Tn` zcK_~pvN%cd^8FlFypCjTjw9@ulLoJ^!QAK*++^wC2~}CFeoY;q6y~r&f^+0>LR6)n z$hSev@GzzGgDc>)#u5_;{T9^5y5I?m=z7=J!eVId8p6R5>NV8)h|bA}#3KUufq4CPGiWYvGj%0=H@Q66);F)#cDMND4 zX|?rg>Bb28q*a!_sgVF(A=OeC&je$C4>$0%yy;Fla-hl(|9Ww4!@Q#E2hpJMMxpQ2L+R;+ZMpS+|j*F`Fh}p)`a_*<`AaeFzNEq^- zlF$7BFKD%p@K+3$Vx%N{QOayKKWU#JOAwXiLO62cA6=|DiDG_Z=ef;f&gQ5-?+Pb+ z)4NsyEZXCdjq5tgDN39V9!6#w25+R1;PD7ss;hFvQn}Hnl3^3h<`ylzJdVEL>|Jj0 zg>=Pscwx&;pWEzMn`ld**$1F-nhqlMuX;G{lWrT<<4$7MZ^*4a2hAMf)3eYiT$lRz&9({j<=%DWIRpgu zoOns@gF}AQ_6Y5RhySg7yMtJcYQap6^hgy{`zX1Zv26q4<)g@t%aIi|-lmcySuRN8*5f*$aEFi8o#kMKRCMnrAY~l`= zez#50^@Qo+6r508>iKfAbbc3JwCnjnmw;~=mlMG`(H8EJz7W6mh@mdinO&)#zHX=| z&|fo@s`;njVkkCMczSnp+TnW8YPU4w2&QmzEh1}orF~KlT=V+`!!rH|PtULCcL!P*m0EaN0Ad2qBw%Gs40jfu=%`N*k@z2-p?&B?Yum-p+h?7(!D^ z&f2Bn_#t!4HM2y^*1GN;U+_x8T$Z2>U9Yx;p_9Qf=ww z2hxO^*{%p9-CwMKz}C4mTi8xvqhivltE|}Kgq5MK@f6tBT&`@RYzsFFi>*eMZ0Z6Y zKBl`GOh!U%C+PXJ|7PF)V*~#8eS80D@v-NL2U&;i62W}k+vJAC+7xF`eq%c0b?{PVTcqiDr%6jLBdkVcTwLJSd313SP)1r=;2`cORbMzrhqZxMWcTWru5-l_H8;f|?{^M%%7>sU zGx2{fX*t;7SewS|NvPR-6F5p(ji7d}CK#%7y}jsPkgj%F5cUbQ?b7uWpYks^|DL*n zau%X$^(%wXMS3c;C4=p*#q>ahmLH5woLsn-YcZP~mH-rGnRyl#KU4MsLu+G3z90+q zM$HCWgZYR`8_I%8)SYuBltP$sN`-6hcjnzhDsVl+Y}yqMN*4MWsJX_6R>Cyw8cHGQ z1>r%vkDxxc#ACA4+-ZO|QBMUz`YHrS{l-*$> zi(n_;4{Gn+d2gn)TA<9) zibWdKJv#s_f5K}vM=d0NaYrd;5A+Fy^=+WgKC`@bS>!P5@K4fzE#VYfMcNdbbvLPY zeR~!f3xU>|pfq-LOsoF=t94x%K!8>#8tR4KQ2G3Yr?Cb98^KL*+G8``rHMpNUN}-T z5HGAkiLh{WR;N$Nk3X_2^3pW=vOFTOb(LS0Wu)0)I{8sZj>}5ZGtD=va-72l&5`L= zhyzBWie2UrC|?(sTcuk$OwvV4oVlxc3ncXPj|cD%%*6(hoKMd5wzPQs^6g)B0xK#d zemOodB7D(!@v!|eYqMfx@M#b+D)PwAuvimOW#13i-xAR5)Ai; zXNX(A@M*y&+TVZI zGHo$F*Ipg~Rnp`KlMNAl2o86}r%Yv9#!O-oo`pe`880;-Y28tR)b4H%nqXXHxN9m0 zI&#!(XhT=T3$WS$)K4#Y=ceN`MsP0v1X{nIoQ14S2^--MnUp21=V3&Uv8|y}^}7Vl zI5tRbOp#?@ay6uncZFE0hg}kt(k%piw^M8;0yynsK_!l~uP??IqzmKJMUqAW^GG{~ z7Fg)Q&zBlp z%Tj8jOUpuR>YHP6zYsX?)aJ`)_pRwu+Tn8I;brOW_`v$u$`$9T)cO*O$j=?mg>dW$ zw=&3=v||fqCr`-$okN*$S9(Nyrs}+Lu#IwDg2xSBz_VfU*?A&26vwv>&>*U_TT7-7 zS~X}fT%9+q(Xvc0qzOG^8gmMcZE9izi5feqvY(aY=%reP+wVZ&cRd`^y6}-gJ&_6n zR%Wdl3vQ4DOt!X9ry7j%=+7pLPdus*@7dZMBo0_WKZPD1(o{=;D> zyc9_WFI3{URv=d6EXcnOG0$(J(R#8Oz$kmuSFQ{-Y20}1027!FkodTU!fouSybwqn zRO-$2BH(w4)$wiPo<1w-4*p=Q0@YKRm^cgiA>~ho)U8^e>SBk*!@xvr0CdvnLHS#CACVuQfgzF>8qV znqf{oO1}RWhiZ3g!Tx9sk!JfLqcP`>Ksx#vZuLg-DC6h4mT!vlU zqw0`0CzZgY!EN0*{sQnDNFn;T<+e_x$zY|n;p0@d^hK*n!S!=#^;P{*D^6~h!T7r6 zoiMxtovMo-dj*{qZPy*c3gaMBEDQDkINU%d8HeBZVlRuzkCId9rx{?L= z-dLlk$w&JX5wn+8`mtqCpKnx+w+$@6DEUI}8P%xN$MEsw%S1-$9PM6r^jP-@?cS<# zhg$wl0X=s3{8EZ2U9(};p{X_b1@jJuGgx`gDK{6MpF|XON_=Rv%-<Ee1cuuy?nl9xVDa~x=+8ppnOQ9 zN$53qi4QQ!co(;f!#YJ8(=Z>_9UF#(QOVjS7T!g2)*Oecrf-R^)tFugBkQsMVNua# zS;1V^#fJS{h+!O+FgS%0=Pd9;lMa0QHn?-n(<0b2$<|@r>fjiyw6u*UoGmU$ayJM@ zfp;c4@{$b*Z_v9?8ZEp{m6Q(mDHW<``n?jg-ZN)Hhvxn*l=O1f*K%{5s77WCt!ugS?*2oG5-Q)JEJd0+W5=doeD$Wh?U$ZRg)K$v8cmQ{hba9jw_mF&X zi-dV?WITgIz!!0uB~jE?(t`&qo{WGyUspX| zc6+F2K4l5$LqxERF#`I&k^^opVIMZjGhsJ^vI0c%kV+|&_k>~}ueTtj;^Dfb@xHs` z)-39elzVA~D~n_aoyBQ1>Qd2!;E!G*pZM&RX`r*y)b`yxvP2;#vM*;CQGPg|gni)} z47`Log3PUyVfdmJ2zvHBhg7T#D-H=myzkeUa$@);WC(yB4k^*$wda3=S-UH5Q1Hx6 zPcGxMP&kXBa+4$s#Sw3-V?mlHj^8&bLpIN~GkYj;!;M!$ZxvtQY4j&Ngz_mxuQRqx zYTbN6epx@-!0jRV5yiSIJ<^mCZ<|;&x2~a)t+(eAVB!1XpCZok*Z2C5P7&>z-Oy?t zf@F(_FLsSrfCus61+Vt~svP%(u<4pzT5{w*0XqfPV%~|=%aq^$=*U+_trGQaoUxbt zBV#Yqx+ULku8yPJs4gGcC?+3iRt_6)Oi0DNLxdb(!n!cup_XUZ3eDe(!DChZ!IG&L?_;T-1GB!R;;Sk;l3Y*JQ!I|l20_f}ZyC;4D7R@6F z>%z~wV;Bj1b(*kp26Ed!Y-OKxNbt3%t))xxOrazWsmwvW;uaSaJ0ou+{01vXvU>_V z6Ha@+;giVaiyg`J8ENQf)Pq>!Nf22>XFHnXTNk84&jp-^YwmlUqnOll8)5mzlO$o! z#fSMwH8Pn+Fy7O5M5#ZGr$cKfaGf8g;XN)<*TrQjMk<}_oRf&b6qZoR38Q{Zxo{V; zby+J_hCZT1>`4~jnQxo|ji%BQ0=BLzC6c!1=B(jS5+fcp%q)JI)=c3{D|=k5;0&c2 zrbRE|qxkNqah2nvextOvjYA{T43n1c6eO7B9DH)tLqB46E7;0xKM=%#wx-*-+*OY{ zQ#7gMStz%I&2&rbo>#T20OD_#g`WYbt9+!MC08%zSMhqMoRk)7VOk%~`sD%(U6zzO zdmSC9@x0GCv2_)umYc5@#%efP0_cu+=f^}k$H9$N_>piA_(5UM_o{++8+Yf8SJ)?C zDd3l=GGm3EEy;&Z6N=+XP@IM0L=uW^ooyYQYyx1vwFR?@U~BAtAqTu%Mi2 zTCQh$K=UZA{P`Cw0I$xAh_f?fq-Goe`7I38{3L8?K3`lRhSAyB)tHT@4c!Y;bJAAS z3u>Q7qx>9SJs4$EB=hxh)u`W5jp?>^g1s_MV7<1zN zXt{FSt?Mt&8aCy67<)b@eg@h0iCW@%+pF-V>p${fyEk6_Gvp|ms{Whi-9eNId?xzZ zm|MI>F;JSuaUnQp#|}k3o&ddCZEeTI608txuU4~7K(wg9 zg%+}(7h2@(%>LI1F*puF(h$ZD`Q+ar!VoVajPY0-XS$>6F_F?sc6Mr7>SL-&{pC;2 zKx@2{@ULz7RCpaKg$iu2rcY+y*~qaPo0}^7T1K$_(NPS<1;V zTj8-xC%WvgDI_YYEG{bySvyO3M>XKY)oXgGG*eB{yDgNQ3s3)A~@n>!O#lNh0! z(-dqW#_z&mMfq#2+u61N`L^({4UoU8wE5`4c}{SGFzKb(BK8hM%cf_zj_HmC48)M& z398ICVJTGzBaz7K{L+Ew=;z^0xA``wbtPs`r+Wrb^_vzzhukq{;A`t&-ktzb zbqy`Z0#D6fdVAiodjF3J+qI*vu#=OCjiL4bIIXEf4?zmN7(H|+<+WfR7@7jrMx7FY z5*0X1enhay-q^M?j}3Pd^|U9(C3#CQU3=hlc~@y9@NQD{UZNfC^5?Cuuuu{ebn_<7 zEzudv*b@QP%)N^5jP;86nQGb<*SOytCM5wmf-=rH#K{Wd$2(X#S$jF}XIxZC1)zir zU2Wq>hIB44nCTqx2x<{_wiVzLSJR}L%P!Y|lFHtA_=bDj=OqvmmSZ}ffuqPge#V-f zZDk|XX0RK}=73LxL`H%OXxK*^I2!fp&kxatErK~&tM3@j1a(Yrq$z)R()i?}p|0^Y zhW&8!IpRA1jJ3e!p66ZY=eBmEA+$A`!%s+{Cz!s$IA`{_Dh0^jt!vn;+Nw}hx019Q z_Wg=#-G-~&@>l=&H~48$L8`LX)!Bcq%(DFa2Loc91u@WcwlHzJwo{cdur>bQ;{fr_ z`rC5QRQ_)`8EadJzz-{K&sUI~>NX>P|c4l)fKS0gkuGe_P ziaQy!%CK(CtAwj-J8&#kyU=G(k%3y`!gS9dU&1xIrGRL|!&aVMEaezUIpopoET~xE zp`%~`LZfn!Lu^+00?>v4UOfM!HeeQoLZP<#o`^9oi69|$0BM?n17R~tGpY)eJiv@$ zTV-~ZZ*}C1J{a}p`>l$Bx8qRBq91;dLdmp84auzmcd|XzJG%I|r z^E-8Tm~jRn_>as(R=@~z3I2E3<=#hXn>A=0`wfOGIxiP)N2%!cG?&^w=E#TR z`lSY@Mm36zu4p3}+S#67MpL$d{gf@dnP%*ZMW=gCXK-%0E(xAC!^+b7hCSMF$m;Rn zCTErbBK#;a)>kHX5}w6PRmnw(!Gy>m_g*2opfklHyx>eb1bu|_lwJdf!ogxhk}X^v zc+^L;F7ta!8+i%6?M}XvQn4b%aOSCpDW+4#JDDG(wvXC*9%9(XBhbv4LX3R5G&(+@ z)nbdivYRQ5pW;9~@YGf{h~Rm(@MfV8Tj&T@EejO6(C#(+z7FVNBR`@j!#wScHM5ki%j+^GykUJ2m zYgpwm;#Q)~LoozUSV($?r3vQ~#ZU_}ggl~J%z*1dYt_^4K6e7o&qs_ORz{km+D+^a zqDdUO)d}|)v9h(Zz3}#DLWyRVCY!=PMCO{=PA)Upb@)1j?c)||l{6&pI=;U#bS#Jk zOOiwVH3FM!SuJDIPnN$|ZKz5fQwHmzn8f^?B+T2ew%~PSE#X_jk`Wu;a{4}9%AHg7 zZm8^bAee$bdpwklIE`$fV15=pI+tgJpll4uQjIM;Q!gvISFc_{@=lUSc-lABE%U?+ zHW$;!NcH1&F;AS~7RH=n<=!NTKnm3t`B@YeL?8d2{WGrmSjG;yBbY*9$N&DT^e?l2 z|1A2482Or7n7KF_TpRn|nmqD}`-=?QJ0z5q$C9Td^sML&aN7OGi+W$uYjDXKJg+0W@S=FoQP2dBI=48|FH>p2mh zFrdu!AwoG$NkvnZp_KT8HEo=RNNJ4IxucGXLr2N*I5Ao>Efb+pNOm9Zw0_7_s|9ac zS6}W##>$W*cBmksip;43p#a4&iTpM)8(gRGekW+AKm5zb)xpUFT>~b+FOH`Zs!$RDgpSCE z>;CL8Uu|EWeR~TvgDX@K=mtReFed;FZ!M2SjzW35i;UqfyemM?rq5yZS#hK5Y~|wt z2#^`Q6$b~uGT_++C3+B~#(oFHdSL&hh`Z8{t5#=ZkoaWVJoLm)3vT_@5HOnZGa;s~ z;4=E`3Eo@=$BxFjS`Iu|8SALB`<#TPTeE%h(dol+#CzJ=Zb&EHpw*=0H*~8x6 z`G`b<@>L2(AS*J!NVp`DN{g!8R#h(~URslf zC8PwGM$5V}+$WcoT*C~*$WmCpS6Gis&sZo|9OfRiwjX$f*&25Gjv6$YPde1smwGw( zb@y=gbl1!8>hm-il3&~zFca0~aJN!?b97+$E>2$Gn$31OR&UnE=Tm= zH44$Dx2HNN1lrCGjfuwo@+(m2j85w-oxre9FopupEV+6HACFyTbt}s-`lCCJ8om5RIE~T#Yg_DWu1u zyAp%jp;3&%D4;CRaR6g=f*ZvPqw2BadP=*ZYy_~CV3@wFx5YA(E8)jfqx z8tjEkMf>msMqi)zaY2fWrMq`lZzZdiMcluc(@(yxK(4hPEFk0~HO3^CUZk3;?Tv3` ze-rjZ8@hBrVPzA$^4hW?<33{d2)h7Jw?$t%V6(C_m+bNhXl9vXCJcBWmMeQoLDm5b zt9|A5pDHY#Y@(rlEo_WzXila!uaZE*WVc`=IM)SSc`#liZ2Wt*~fHgm9uH^ISX2d@)XGZ)_$qnbx6?J<14_=SS(ITs#LPDk03a&%x;bAuGz=P ze^<4p@tD@J|M;88;~IsEOPpB+&3C4!3q;}Kk2tb*WuuE z2u(BE$1(2AwbbBrmU-YLI4>#K((6&QZ~m2Yp;I14x0N8hos}{uoQuMG)Wy?ogaNayqmc&`I=8y6&dPf{Fky#B7 z#F=Xy213s`NFxjKuMqH3+ibWsFRi=QtH*j$9^)Zy8F|^vSmgj~l5<04MiU;BNyAn) zlM+c20Y#%@>WgdY>5kx}H)7*!D~BZJdg8d5iHx|>(jj=!MEmr)-$kH8?A#;DyBone(uz;e^|=9nIwfuWY?yw; zC|H`;8#O$vTPm5AW1Gg-Up&#Ca$<@!JZkAUDbmd*?X}QSA5$(*c+FZ|l+}F%*L1OH z{ck}P=j@=7>6ga#cqzj|ODXHD>ckIBmOd9Fh=~>?C7$uII_3rEX%UKdywsInR~{t- zg|t`~l=L1P_QPkZN53Q>!^A*QDZ zK(f;%VVQo)n1bsy)LWL#?&|wN`hL~Rnxhd3d-bOvlRQAiybH&=i;SlnwP$3P-!%x3^o)t6aoT-zXU}ARq-l^bOW-zg$@b|19Aua zF+k$V!uO;fNwCUEi;6!|5?4_MKtTq}|C`2gXh8EhWP1bTgZ)DqHZ&-x|E2*6Ka!RZ zS5jsHN&IW7%g1yUln@bn$cO!hR2b+`P~1-3dFIx!6EltRa{a z6Z@Y$_ug)~d%u)K$+?LYfc<87}bupdiK(3|m%hiA$Pc>zKNP0hqBj{X*L0rm@j(0s(f>>t{1L0?w#rS+#E)IdBKcF5|Dq-S zZ*-X3x;NeSuOSxS<3Q%uy1zwQ+?Kj&)Ou~-|2+&J{Zi^T=lx9+&+B^K_lQ;hY2H6D zeZ9T!H&;?$+kt+MLCs%i{8QEVi8<(Pft!mFt`}r~k5Y%93jAjQ!fgoD?Zh|Vi~q5A z27G^+_!lc1Zfo3}625-J{(B@p`IW|R4(!c|yX*Pn?*SA0)3iUGUB11uH>ab1{F$$g z|7q4=O#$9cezU54J)`wKI1_%J{14{0Zj0P3wEcKU`%-=?@(1PW+Zs0qGuI`%??IID dD~*3C;60WFKt@K_BOwYX49GZ$DDV2e{|AYb(KrAA literal 0 HcmV?d00001 diff --git a/gradle/wrapper/gradle-wrapper.properties b/gradle/wrapper/gradle-wrapper.properties new file mode 100644 index 000000000..3e593191a --- /dev/null +++ b/gradle/wrapper/gradle-wrapper.properties @@ -0,0 +1,7 @@ +distributionBase=GRADLE_USER_HOME +distributionPath=wrapper/dists +distributionUrl=https\://services.gradle.org/distributions/gradle-7.6.4-bin.zip +networkTimeout=10000 +validateDistributionUrl=true +zipStoreBase=GRADLE_USER_HOME +zipStorePath=wrapper/dists diff --git a/gradlew b/gradlew new file mode 100755 index 000000000..adff685a0 --- /dev/null +++ b/gradlew @@ -0,0 +1,248 @@ +#!/bin/sh + +# +# Copyright © 2015 the original authors. +# +# Licensed under the Apache License, Version 2.0 (the "License"); +# you may not use this file except in compliance with the License. +# You may obtain a copy of the License at +# +# https://www.apache.org/licenses/LICENSE-2.0 +# +# Unless required by applicable law or agreed to in writing, software +# distributed under the License is distributed on an "AS IS" BASIS, +# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +# See the License for the specific language governing permissions and +# limitations under the License. +# +# SPDX-License-Identifier: Apache-2.0 +# + +############################################################################## +# +# Gradle start up script for POSIX generated by Gradle. +# +# Important for running: +# +# (1) You need a POSIX-compliant shell to run this script. If your /bin/sh is +# noncompliant, but you have some other compliant shell such as ksh or +# bash, then to run this script, type that shell name before the whole +# command line, like: +# +# ksh Gradle +# +# Busybox and similar reduced shells will NOT work, because this script +# requires all of these POSIX shell features: +# * functions; +# * expansions «$var», «${var}», «${var:-default}», «${var+SET}», +# «${var#prefix}», «${var%suffix}», and «$( cmd )»; +# * compound commands having a testable exit status, especially «case»; +# * various built-in commands including «command», «set», and «ulimit». +# +# Important for patching: +# +# (2) This script targets any POSIX shell, so it avoids extensions provided +# by Bash, Ksh, etc; in particular arrays are avoided. +# +# The "traditional" practice of packing multiple parameters into a +# space-separated string is a well documented source of bugs and security +# problems, so this is (mostly) avoided, by progressively accumulating +# options in "$@", and eventually passing that to Java. +# +# Where the inherited environment variables (DEFAULT_JVM_OPTS, JAVA_OPTS, +# and GRADLE_OPTS) rely on word-splitting, this is performed explicitly; +# see the in-line comments for details. +# +# There are tweaks for specific operating systems such as AIX, CygWin, +# Darwin, MinGW, and NonStop. +# +# (3) This script is generated from the Groovy template +# https://github.com/gradle/gradle/blob/HEAD/platforms/jvm/plugins-application/src/main/resources/org/gradle/api/internal/plugins/unixStartScript.txt +# within the Gradle project. +# +# You can find Gradle at https://github.com/gradle/gradle/. +# +############################################################################## + +# Attempt to set APP_HOME + +# Resolve links: $0 may be a link +app_path=$0 + +# Need this for daisy-chained symlinks. +while + APP_HOME=${app_path%"${app_path##*/}"} # leaves a trailing /; empty if no leading path + [ -h "$app_path" ] +do + ls=$( ls -ld "$app_path" ) + link=${ls#*' -> '} + case $link in #( + /*) app_path=$link ;; #( + *) app_path=$APP_HOME$link ;; + esac +done + +# This is normally unused +# shellcheck disable=SC2034 +APP_BASE_NAME=${0##*/} +# Discard cd standard output in case $CDPATH is set (https://github.com/gradle/gradle/issues/25036) +APP_HOME=$( cd -P "${APP_HOME:-./}" > /dev/null && printf '%s\n' "$PWD" ) || exit + +# Use the maximum available, or set MAX_FD != -1 to use that value. +MAX_FD=maximum + +warn () { + echo "$*" +} >&2 + +die () { + echo + echo "$*" + echo + exit 1 +} >&2 + +# OS specific support (must be 'true' or 'false'). +cygwin=false +msys=false +darwin=false +nonstop=false +case "$( uname )" in #( + CYGWIN* ) cygwin=true ;; #( + Darwin* ) darwin=true ;; #( + MSYS* | MINGW* ) msys=true ;; #( + NONSTOP* ) nonstop=true ;; +esac + + + +# Determine the Java command to use to start the JVM. +if [ -n "$JAVA_HOME" ] ; then + if [ -x "$JAVA_HOME/jre/sh/java" ] ; then + # IBM's JDK on AIX uses strange locations for the executables + JAVACMD=$JAVA_HOME/jre/sh/java + else + JAVACMD=$JAVA_HOME/bin/java + fi + if [ ! -x "$JAVACMD" ] ; then + die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME + +Please set the JAVA_HOME variable in your environment to match the +location of your Java installation." + fi +else + JAVACMD=java + if ! command -v java >/dev/null 2>&1 + then + die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH. + +Please set the JAVA_HOME variable in your environment to match the +location of your Java installation." + fi +fi + +# Increase the maximum file descriptors if we can. +if ! "$cygwin" && ! "$darwin" && ! "$nonstop" ; then + case $MAX_FD in #( + max*) + # In POSIX sh, ulimit -H is undefined. That's why the result is checked to see if it worked. + # shellcheck disable=SC2039,SC3045 + MAX_FD=$( ulimit -H -n ) || + warn "Could not query maximum file descriptor limit" + esac + case $MAX_FD in #( + '' | soft) :;; #( + *) + # In POSIX sh, ulimit -n is undefined. That's why the result is checked to see if it worked. + # shellcheck disable=SC2039,SC3045 + ulimit -n "$MAX_FD" || + warn "Could not set maximum file descriptor limit to $MAX_FD" + esac +fi + +# Collect all arguments for the java command, stacking in reverse order: +# * args from the command line +# * the main class name +# * -classpath +# * -D...appname settings +# * --module-path (only if needed) +# * DEFAULT_JVM_OPTS, JAVA_OPTS, and GRADLE_OPTS environment variables. + +# For Cygwin or MSYS, switch paths to Windows format before running java +if "$cygwin" || "$msys" ; then + APP_HOME=$( cygpath --path --mixed "$APP_HOME" ) + + JAVACMD=$( cygpath --unix "$JAVACMD" ) + + # Now convert the arguments - kludge to limit ourselves to /bin/sh + for arg do + if + case $arg in #( + -*) false ;; # don't mess with options #( + /?*) t=${arg#/} t=/${t%%/*} # looks like a POSIX filepath + [ -e "$t" ] ;; #( + *) false ;; + esac + then + arg=$( cygpath --path --ignore --mixed "$arg" ) + fi + # Roll the args list around exactly as many times as the number of + # args, so each arg winds up back in the position where it started, but + # possibly modified. + # + # NB: a `for` loop captures its iteration list before it begins, so + # changing the positional parameters here affects neither the number of + # iterations, nor the values presented in `arg`. + shift # remove old arg + set -- "$@" "$arg" # push replacement arg + done +fi + + +# Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script. +DEFAULT_JVM_OPTS='"-Xmx64m" "-Xms64m"' + +# Collect all arguments for the java command: +# * DEFAULT_JVM_OPTS, JAVA_OPTS, and optsEnvironmentVar are not allowed to contain shell fragments, +# and any embedded shellness will be escaped. +# * For example: A user cannot expect ${Hostname} to be expanded, as it is an environment variable and will be +# treated as '${Hostname}' itself on the command line. + +set -- \ + "-Dorg.gradle.appname=$APP_BASE_NAME" \ + -jar "$APP_HOME/gradle/wrapper/gradle-wrapper.jar" \ + "$@" + +# Stop when "xargs" is not available. +if ! command -v xargs >/dev/null 2>&1 +then + die "xargs is not available" +fi + +# Use "xargs" to parse quoted args. +# +# With -n1 it outputs one arg per line, with the quotes and backslashes removed. +# +# In Bash we could simply go: +# +# readarray ARGS < <( xargs -n1 <<<"$var" ) && +# set -- "${ARGS[@]}" "$@" +# +# but POSIX shell has neither arrays nor command substitution, so instead we +# post-process each arg (as a line of input to sed) to backslash-escape any +# character that might be a shell metacharacter, then use eval to reverse +# that process (while maintaining the separation between arguments), and wrap +# the whole thing up as a single "set" statement. +# +# This will of course break if any of these variables contains a newline or +# an unmatched quote. +# + +eval "set -- $( + printf '%s\n' "$DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS" | + xargs -n1 | + sed ' s~[^-[:alnum:]+,./:=@_]~\\&~g; ' | + tr '\n' ' ' + )" '"$@"' + +exec "$JAVACMD" "$@" diff --git a/gradlew.bat b/gradlew.bat new file mode 100644 index 000000000..e509b2dd8 --- /dev/null +++ b/gradlew.bat @@ -0,0 +1,93 @@ +@rem +@rem Copyright 2015 the original author or authors. +@rem +@rem Licensed under the Apache License, Version 2.0 (the "License"); +@rem you may not use this file except in compliance with the License. +@rem You may obtain a copy of the License at +@rem +@rem https://www.apache.org/licenses/LICENSE-2.0 +@rem +@rem Unless required by applicable law or agreed to in writing, software +@rem distributed under the License is distributed on an "AS IS" BASIS, +@rem WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +@rem See the License for the specific language governing permissions and +@rem limitations under the License. +@rem +@rem SPDX-License-Identifier: Apache-2.0 +@rem + +@if "%DEBUG%"=="" @echo off +@rem ########################################################################## +@rem +@rem Gradle startup script for Windows +@rem +@rem ########################################################################## + +@rem Set local scope for the variables with windows NT shell +if "%OS%"=="Windows_NT" setlocal + +set DIRNAME=%~dp0 +if "%DIRNAME%"=="" set DIRNAME=. +@rem This is normally unused +set APP_BASE_NAME=%~n0 +set APP_HOME=%DIRNAME% + +@rem Resolve any "." and ".." in APP_HOME to make it shorter. +for %%i in ("%APP_HOME%") do set APP_HOME=%%~fi + +@rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script. +set DEFAULT_JVM_OPTS="-Xmx64m" "-Xms64m" + +@rem Find java.exe +if defined JAVA_HOME goto findJavaFromJavaHome + +set JAVA_EXE=java.exe +%JAVA_EXE% -version >NUL 2>&1 +if %ERRORLEVEL% equ 0 goto execute + +echo. 1>&2 +echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH. 1>&2 +echo. 1>&2 +echo Please set the JAVA_HOME variable in your environment to match the 1>&2 +echo location of your Java installation. 1>&2 + +goto fail + +:findJavaFromJavaHome +set JAVA_HOME=%JAVA_HOME:"=% +set JAVA_EXE=%JAVA_HOME%/bin/java.exe + +if exist "%JAVA_EXE%" goto execute + +echo. 1>&2 +echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME% 1>&2 +echo. 1>&2 +echo Please set the JAVA_HOME variable in your environment to match the 1>&2 +echo location of your Java installation. 1>&2 + +goto fail + +:execute +@rem Setup the command line + + + +@rem Execute Gradle +"%JAVA_EXE%" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% "-Dorg.gradle.appname=%APP_BASE_NAME%" -jar "%APP_HOME%\gradle\wrapper\gradle-wrapper.jar" %* + +:end +@rem End local scope for the variables with windows NT shell +if %ERRORLEVEL% equ 0 goto mainEnd + +:fail +rem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of +rem the _cmd.exe /c_ return code! +set EXIT_CODE=%ERRORLEVEL% +if %EXIT_CODE% equ 0 set EXIT_CODE=1 +if not ""=="%GRADLE_EXIT_CONSOLE%" exit %EXIT_CODE% +exit /b %EXIT_CODE% + +:mainEnd +if "%OS%"=="Windows_NT" endlocal + +:omega diff --git a/src/main/java/exchange/core2/collections/art/ArtNode16.java b/src/main/java/exchange/core2/collections/art/ArtNode16.java new file mode 100644 index 000000000..d2e31c5c5 --- /dev/null +++ b/src/main/java/exchange/core2/collections/art/ArtNode16.java @@ -0,0 +1,470 @@ +/* + * Copyright 2019-2020 Maksim Zheravin + * + * Licensed under the Apache License, Version 2.0 (the "License"); + * you may not use this file except in compliance with the License. + * You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, software + * distributed under the License is distributed on an "AS IS" BASIS, + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + * See the License for the specific language governing permissions and + * limitations under the License. + */ +package exchange.core2.collections.art; + +import exchange.core2.collections.objpool.ObjectsPool; + +import java.util.ArrayList; +import java.util.Arrays; +import java.util.List; +import java.util.Map; + +/** + * This node type is used for storing between 5 and + * 16 child pointers. Like the Node4, the keys and pointers + * are stored in separate arrays at corresponding positions, but + * both arrays have space for 16 entries. A key can be found + * efficiently with binary search or, on modern hardware, with + * parallel comparisons using SIMD instructions. + */ +public final class ArtNode16 implements IArtNode { + + private static final int NODE4_SWITCH_THRESHOLD = 3; + + // keys are ordered + final short[] keys = new short[16]; + final Object[] nodes = new Object[16]; + + long nodeKey; + int nodeLevel; + + byte numChildren; + + private final ObjectsPool objectsPool; + + public ArtNode16(ObjectsPool objectsPool) { + this.objectsPool = objectsPool; + } + + void initFromNode4(ArtNode4 node4, short subKey, Object newElement) { + + final byte sourceSize = node4.numChildren; + this.nodeLevel = node4.nodeLevel; + this.nodeKey = node4.nodeKey; + this.numChildren = (byte) (sourceSize + 1); + int inserted = 0; + for (int i = 0; i < sourceSize; i++) { + final int key = node4.keys[i]; + if (inserted == 0 && key > subKey) { + keys[i] = subKey; + nodes[i] = newElement; + inserted = 1; + } + keys[i + inserted] = node4.keys[i]; + nodes[i + inserted] = node4.nodes[i]; + } + if (inserted == 0) { + keys[sourceSize] = subKey; + nodes[sourceSize] = newElement; + } + + // put original node back into pool + Arrays.fill(node4.nodes, null); + objectsPool.put(ObjectsPool.ART_NODE_4, node4); + } + + void initFromNode48(ArtNode48 node48) { +// log.debug("48->16 nodeLevel={} (nodekey={})", node48.nodeLevel, node48.nodeKey); + this.numChildren = node48.numChildren; + this.nodeLevel = node48.nodeLevel; + this.nodeKey = node48.nodeKey; + byte idx = 0; + for (short i = 0; i < 256; i++) { + final byte j = node48.indexes[i]; + if (j != -1) { + this.keys[idx] = i; + this.nodes[idx] = node48.nodes[j]; + idx++; + } + if (idx == numChildren) { + break; + } + } + + Arrays.fill(node48.nodes, null); + Arrays.fill(node48.indexes, (byte) -1); + objectsPool.put(ObjectsPool.ART_NODE_48, node48); + } + + + @Override + @SuppressWarnings("unchecked") + public V getValue(final long key, final int level) { + if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { + return null; + } + final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); + for (int i = 0; i < numChildren; i++) { + final short index = keys[i]; + if (index == nodeIndex) { + final Object node = nodes[i]; + return nodeLevel == 0 + ? (V) node + : ((IArtNode) node).getValue(key, nodeLevel - 8); + } + if (nodeIndex < index) { + // can give up searching because keys are in sorted order + break; + } + } + return null; + } + + @Override + @SuppressWarnings("unchecked") + public IArtNode put(final long key, final int level, final V value) { + if (level != nodeLevel) { + final IArtNode branch = LongAdaptiveRadixTreeMap.branchIfRequired(key, value, nodeKey, nodeLevel, this); + if (branch != null) { + return branch; + } + } + final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); + int pos = 0; + while (pos < numChildren) { + if (nodeIndex == keys[pos]) { + // just update + if (nodeLevel == 0) { + nodes[pos] = value; + } else { + final IArtNode resizedNode = ((IArtNode) nodes[pos]).put(key, nodeLevel - 8, value); + if (resizedNode != null) { + // TODO put old into the pool + // update resized node if capacity has increased + nodes[pos] = resizedNode; + } + } + return null; + } + if (nodeIndex < keys[pos]) { + // can give up searching because keys are in sorted order + break; + } + pos++; + } + + // not found, put new element + if (numChildren != 16) { + // capacity less than 16 - can simply insert node + final int copyLength = numChildren - pos; + if (copyLength != 0) { + System.arraycopy(keys, pos, keys, pos + 1, copyLength); + System.arraycopy(nodes, pos, nodes, pos + 1, copyLength); + } + keys[pos] = nodeIndex; + if (nodeLevel == 0) { + nodes[pos] = value; + } else { + final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); + newSubNode.initFirstKey(key, value); + nodes[pos] = newSubNode; + newSubNode.put(key, nodeLevel - 8, value); + } + numChildren++; + return null; + } else { + // no space left, create a Node48 with new element + final Object newElement; + if (nodeLevel == 0) { + newElement = value; + } else { + final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); + newSubNode.initFirstKey(key, value); + newElement = newSubNode; + } + + ArtNode48 node48 = objectsPool.get(ObjectsPool.ART_NODE_48, ArtNode48::new); + node48.initFromNode16(this, nodeIndex, newElement); + + return node48; + } + } + + @Override + @SuppressWarnings("unchecked") + public IArtNode remove(long key, int level) { + if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { + return this; + } + final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); + Object node = null; + int pos = 0; + while (pos < numChildren) { + if (nodeIndex == keys[pos]) { + // found + node = nodes[pos]; + break; + } + if (nodeIndex < keys[pos]) { + // can give up searching because keys are in sorted order + return this; + } + pos++; + } + + if (node == null) { + // not found + return this; + } + + // removing + if (nodeLevel == 0) { + removeElementAtPos(pos); + } else { + final IArtNode resizedNode = ((IArtNode) node).remove(key, nodeLevel - 8); + if (resizedNode != node) { + // update resized node if capacity has decreased + nodes[pos] = resizedNode; + if (resizedNode == null) { + removeElementAtPos(pos); + } + } + } + + // switch to ArtNode4 if too small + if (numChildren == NODE4_SWITCH_THRESHOLD) { + final ArtNode4 newNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); + newNode.initFromNode16(this); + return newNode; + } else { + return this; + } + } + + @Override + @SuppressWarnings("unchecked") + public V getCeilingValue(long key, int level) { +// log.debug("key = {}", String.format("%Xh", key)); +// log.debug("level={} nodeLevel={} nodekey={} looking for key={} mask={}", +// level, nodeLevel, String.format("%Xh", nodeKey), String.format("%Xh", key), String.format("%Xh", mask)); +// +// log.debug("key & mask = {} > nodeKey & mask = {}", +// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); + + // special processing for compacted nodes + if ((level != nodeLevel)) { + // try first + final long mask = -1L << (nodeLevel + 8); + final long keyWithMask = key & mask; + final long nodeKeyWithMask = nodeKey & mask; + if (nodeKeyWithMask < keyWithMask) { + // compacted part is lower - no need to search for ceiling entry here + return null; + } else if (keyWithMask != nodeKeyWithMask) { + // can reset key, because compacted nodekey is higher + key = 0; + } + } + + final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); + + for (int i = 0; i < numChildren; i++) { + final short index = keys[i]; +// log.debug("try index={} (looking for {}) key={}", String.format("%X", index), String.format("%X", nodeIndex), String.format("%X", key)); + // any equal or higher is ok + if (index == nodeIndex) { + final V res = nodeLevel == 0 + ? (V) nodes[i] + : ((IArtNode) nodes[i]).getCeilingValue(key, nodeLevel - 8); + if (res != null) { + // return if found ceiling, otherwise will try next one + return res; + } + } + if (index > nodeIndex) { + // exploring first higher key + return nodeLevel == 0 + ? (V) nodes[i] + : ((IArtNode) nodes[i]).getCeilingValue(0, nodeLevel - 8); // take lowest existing key + } + } + return null; + } + + + @Override + @SuppressWarnings("unchecked") + public V getFloorValue(long key, int level) { + // log.debug("key = {}", String.format("%Xh", key)); +// log.debug("level={} nodeLevel={} nodekey={} looking for key={} mask={}", +// level, nodeLevel, String.format("%Xh", nodeKey), String.format("%Xh", key), String.format("%Xh", mask)); + + // special processing for compacted nodes + if ((level != nodeLevel)) { + // try first + final long mask = -1L << (nodeLevel + 8); +// log.debug("key & mask = {} > nodeKey & mask = {}", +// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); + final long keyWithMask = key & mask; + final long nodeKeyWithMask = nodeKey & mask; + if (nodeKeyWithMask > keyWithMask) { + // compacted part is higher - no need to search for floor entry here + return null; + } else if (keyWithMask != nodeKeyWithMask) { + // find highest value, because compacted nodekey is lower + key = Long.MAX_VALUE; + } + } + + final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); + + for (int i = numChildren - 1; i >= 0; i--) { + final short index = keys[i]; + if (index == nodeIndex) { + final V res = nodeLevel == 0 + ? (V) nodes[i] + : ((IArtNode) nodes[i]).getFloorValue(key, nodeLevel - 8); + if (res != null) { + // return if found ceiling, otherwise will try next one + return res; + } + } + if (index < nodeIndex) { + // exploring first lower key + return nodeLevel == 0 + ? (V) nodes[i] + : ((IArtNode) nodes[i]).getFloorValue(Long.MAX_VALUE, nodeLevel - 8); // take highest existing key + } + } + return null; + } + + @Override + @SuppressWarnings("unchecked") + public int forEach(LongObjConsumer consumer, int limit) { + if (nodeLevel == 0) { + final long keyBase = (nodeKey >>> 8) << 8; + final int n = Math.min(numChildren, limit); + for (int i = 0; i < n; i++) { + consumer.accept(keyBase + keys[i], (V) nodes[i]); + } + return n; + } else { + int numLeft = limit; + for (int i = 0; i < numChildren && numLeft > 0; i++) { + numLeft -= ((IArtNode) nodes[i]).forEach(consumer, numLeft); + } + return limit - numLeft; + } + } + + @Override + @SuppressWarnings("unchecked") + public int forEachDesc(LongObjConsumer consumer, int limit) { + if (nodeLevel == 0) { + final long keyBase = (nodeKey >>> 8) << 8; + int numFound = 0; + for (int i = numChildren - 1; i >= 0 && numFound < limit; i--) { + consumer.accept(keyBase + keys[i], (V) nodes[i]); + numFound++; + } + return numFound; + } else { + int numLeft = limit; + for (int i = numChildren - 1; i >= 0 && numLeft > 0; i--) { + numLeft -= ((IArtNode) nodes[i]).forEachDesc(consumer, numLeft); + } + return limit - numLeft; + } + } + + @Override + @SuppressWarnings("unchecked") + public int size(int limit) { + if (nodeLevel == 0) { + return numChildren; + } else { + int numLeft = limit; + for (int i = numChildren - 1; i >= 0 && numLeft > 0; i--) { + numLeft -= ((IArtNode) nodes[i]).size(numLeft); + } + return limit - numLeft; + } + } + + @Override + public void validateInternalState(int level) { + if (nodeLevel > level) throw new IllegalStateException("unexpected nodeLevel"); + if (numChildren > 16 || numChildren <= NODE4_SWITCH_THRESHOLD) + throw new IllegalStateException("unexpected numChildren"); + short last = -1; + for (int i = 0; i < 16; i++) { + Object node = nodes[i]; + if (i < numChildren) { + if (node == null) throw new IllegalStateException("null node"); + if (keys[i] < 0 || keys[i] >= 256) throw new IllegalStateException("key out of range"); + if (keys[i] == last) throw new IllegalStateException("duplicate key"); + if (keys[i] < last) throw new IllegalStateException("wrong key order"); + last = keys[i]; + if (node instanceof IArtNode) { + if (nodeLevel == 0) throw new IllegalStateException("unexpected node type"); + IArtNode artNode = (IArtNode) node; + artNode.validateInternalState(nodeLevel - 8); + } else { + if (nodeLevel != 0) throw new IllegalStateException("unexpected node type"); + } + + } else { + if (node != null) throw new IllegalStateException("not released node"); + } + } + } + + @Override + public String printDiagram(String prefix, int level) { + return LongAdaptiveRadixTreeMap.printDiagram(prefix, level, nodeLevel, nodeKey, numChildren, idx -> keys[idx], idx -> nodes[idx]); + } + + @Override + @SuppressWarnings("unchecked") + public List> entries() { + final long keyPrefix = nodeKey & (-1L << 8); + final List> list = new ArrayList<>(); + for (int i = 0; i < numChildren; i++) { + if (nodeLevel == 0) { + list.add(new LongAdaptiveRadixTreeMap.Entry<>(keyPrefix + keys[i], (V) nodes[i])); + } else { + list.addAll(((IArtNode) nodes[i]).entries()); + } + } + return list; + } + + private void removeElementAtPos(final int pos) { + final int ppos = pos + 1; + final int copyLength = numChildren - ppos; + if (copyLength != 0) { + System.arraycopy(keys, ppos, keys, pos, copyLength); + System.arraycopy(nodes, ppos, nodes, pos, copyLength); + } + numChildren--; + nodes[numChildren] = null; + } + + @Override + public ObjectsPool getObjectsPool() { + return objectsPool; + } + + @Override + public String toString() { + return "ArtNode16{" + + "nodeKey=" + nodeKey + + ", nodeLevel=" + nodeLevel + + ", numChildren=" + numChildren + + '}'; + } +} diff --git a/src/main/java/exchange/core2/collections/art/ArtNode256.java b/src/main/java/exchange/core2/collections/art/ArtNode256.java new file mode 100644 index 000000000..5b3325b58 --- /dev/null +++ b/src/main/java/exchange/core2/collections/art/ArtNode256.java @@ -0,0 +1,397 @@ +/* + * Copyright 2019-2020 Maksim Zheravin + * + * Licensed under the Apache License, Version 2.0 (the "License"); + * you may not use this file except in compliance with the License. + * You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, software + * distributed under the License is distributed on an "AS IS" BASIS, + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + * See the License for the specific language governing permissions and + * limitations under the License. + */ +package exchange.core2.collections.art; + +import exchange.core2.collections.objpool.ObjectsPool; + +import java.util.ArrayList; +import java.util.Arrays; +import java.util.List; +import java.util.Map; + + +/** + * The largest node type is simply an array of 256 + * pointers and is used for storing between 49 and 256 entries. + * With this representation, the next node can be found very + * efficiently using a single lookup of the key byte in that array. + * No additional indirection is necessary. If most entries are not + * null, this representation is also very space efficient because + * only pointers need to be stored. + */ +public final class ArtNode256 implements IArtNode { + + private static final int NODE48_SWITCH_THRESHOLD = 37; + + // direct addressing + final Object[] nodes = new Object[256]; + + long nodeKey; + int nodeLevel; + short numChildren; + + private final ObjectsPool objectsPool; + + public ArtNode256(ObjectsPool objectsPool) { + this.objectsPool = objectsPool; + } + + void initFromNode48(ArtNode48 artNode48, short subKey, Object newElement) { + + this.nodeLevel = artNode48.nodeLevel; + this.nodeKey = artNode48.nodeKey; + final int sourceSize = 48; + for (short i = 0; i < 256; i++) { + final byte index = artNode48.indexes[i]; + if (index != -1) { + this.nodes[i] = artNode48.nodes[index]; + } + } + this.nodes[subKey] = newElement; + this.numChildren = sourceSize + 1; + + Arrays.fill(artNode48.nodes, null); + Arrays.fill(artNode48.indexes, (byte) -1); + objectsPool.put(ObjectsPool.ART_NODE_48, artNode48); + } + + @Override + @SuppressWarnings("unchecked") + public V getValue(final long key, final int level) { + if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { + return null; + } + final short idx = (short) ((key >>> nodeLevel) & 0xFF); + final Object node = nodes[idx]; + if (node != null) { + return nodeLevel == 0 + ? (V) node + : ((IArtNode) node).getValue(key, nodeLevel - 8); + } + return null; + } + + @Override + @SuppressWarnings("unchecked") + public IArtNode put(final long key, final int level, final V value) { + if (level != nodeLevel) { + final IArtNode branch = LongAdaptiveRadixTreeMap.branchIfRequired(key, value, nodeKey, nodeLevel, this); + if (branch != null) { + return branch; + } + } + final short idx = (short) ((key >>> nodeLevel) & 0xFF); + if (nodes[idx] == null) { + // new object will be inserted + numChildren++; + } + + if (nodeLevel == 0) { + nodes[idx] = value; + } else { + IArtNode node = (IArtNode) nodes[idx]; + if (node != null) { + final IArtNode resizedNode = node.put(key, nodeLevel - 8, value); + if (resizedNode != null) { + // TODO put old into the pool + // update resized node if capacity has increased + nodes[idx] = resizedNode; + } + } else { + final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); + newSubNode.initFirstKey(key, value); + nodes[idx] = newSubNode; + } + } + + // never need to increase the size + return null; + } + + @Override + @SuppressWarnings("unchecked") + public IArtNode remove(long key, int level) { + if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { + return this; + } + final short idx = (short) ((key >>> nodeLevel) & 0xFF); + if (nodes[idx] == null) { + return this; + } + + if (nodeLevel == 0) { + nodes[idx] = null; + numChildren--; + } else { + final IArtNode node = (IArtNode) nodes[idx]; + final IArtNode resizedNode = node.remove(key, nodeLevel - 8); + if (resizedNode != node) { + // TODO put old into the pool + // update resized node if capacity has decreased + nodes[idx] = resizedNode; + if (resizedNode == null) { + numChildren--; + } + } + } + + if (numChildren == NODE48_SWITCH_THRESHOLD) { + final ArtNode48 newNode = objectsPool.get(ObjectsPool.ART_NODE_48, ArtNode48::new); + newNode.initFromNode256(this); + return newNode; + } else { + return this; + } + } + + @Override + @SuppressWarnings("unchecked") + public V getCeilingValue(long key, int level) { +// log.debug("key = {}", String.format("%Xh", key)); + // special processing for compacted nodes + if ((level != nodeLevel)) { + // try first + final long mask = -1L << (nodeLevel + 8); +// log.debug("key & mask = {} > nodeKey & mask = {}", String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); + final long keyWithMask = key & mask; + final long nodeKeyWithMask = nodeKey & mask; + if (nodeKeyWithMask < keyWithMask) { + // compacted part is lower - no need to search for ceiling entry here + return null; + } else if (keyWithMask != nodeKeyWithMask) { + // find first lowest key, because compacted nodekey is higher + key = 0; + } + } + + short idx = (short) ((key >>> nodeLevel) & 0xFF); + Object node = nodes[idx]; + if (node != null) { + // if exact key found + final V res = nodeLevel == 0 ? (V) node : ((IArtNode) node).getCeilingValue(key, nodeLevel - 8); + if (res != null) { + // return if found ceiling, otherwise will try next one + return res; + } + } + + // if exact key not found - searching for first higher key + while (++idx < 256) { +// log.debug("idx+ = {}", String.format("%Xh", idx)); + node = nodes[idx]; + if (node != null) { + return (nodeLevel == 0) + ? (V) node + : ((IArtNode) node).getCeilingValue(0, nodeLevel - 8);// find first lowest key + } + } + // no keys found + return null; + } + + @Override + @SuppressWarnings("unchecked") + public V getFloorValue(long key, int level) { + // log.debug("key = {}", String.format("%Xh", key)); + // special processing for compacted nodes + if ((level != nodeLevel)) { + // try first + final long mask = -1L << (nodeLevel + 8); +// log.debug("key & mask = {} > nodeKey & mask = {}", +// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); + final long keyWithMask = key & mask; + final long nodeKeyWithMask = nodeKey & mask; + if (nodeKeyWithMask > keyWithMask) { + // compacted part is higher - no need to search for floor entry here + return null; + } else if (keyWithMask != nodeKeyWithMask) { + // find highest value, because compacted nodekey is lower + key = Long.MAX_VALUE; + } + } + + short idx = (short) ((key >>> nodeLevel) & 0xFF); + Object node = nodes[idx]; + if (node != null) { + // if exact key found + final V res = nodeLevel == 0 ? (V) node : ((IArtNode) node).getFloorValue(key, nodeLevel - 8); + if (res != null) { + // return if found floor, otherwise will try prev one + return res; + } + } + + // if exact key not found - searching for first lower key + while (--idx >= 0) { +// log.debug("idx+ = {}", String.format("%Xh", idx)); + node = nodes[idx]; + if (node != null) { + return (nodeLevel == 0) + ? (V) node + : ((IArtNode) node).getFloorValue(Long.MAX_VALUE, nodeLevel - 8);// find first highest key + } + } + // no keys found + return null; + } + + @Override + @SuppressWarnings("unchecked") + public int forEach(LongObjConsumer consumer, int limit) { + if (nodeLevel == 0) { + final long keyBase = (nodeKey >>> 8) << 8; + int numFound = 0; + for (short i = 0; i < 256; i++) { + if (numFound == limit) { + return numFound; + } + final V node = (V) nodes[i]; + if (node != null) { + consumer.accept(keyBase + i, node); + numFound++; + } + } + return numFound; + } else { + int numLeft = limit; + for (short i = 0; i < 256 && numLeft > 0; i++) { + final IArtNode node = (IArtNode) nodes[i]; + if (node != null) { + numLeft -= node.forEach(consumer, numLeft); + } + } + return limit - numLeft; + } + } + + @Override + @SuppressWarnings("unchecked") + public int forEachDesc(LongObjConsumer consumer, int limit) { + if (nodeLevel == 0) { + final long keyBase = (nodeKey >>> 8) << 8; + int numFound = 0; + for (short i = 255; i >= 0; i--) { + if (numFound == limit) { + return numFound; + } + final V node = (V) nodes[i]; + if (node != null) { + consumer.accept(keyBase + i, node); + numFound++; + } + } + return numFound; + } else { + int numLeft = limit; + for (short i = 255; i >= 0 && numLeft > 0; i--) { + final IArtNode node = (IArtNode) nodes[i]; + if (node != null) { + numLeft -= node.forEachDesc(consumer, numLeft); + } + } + return limit - numLeft; + } + } + + @Override + @SuppressWarnings("unchecked") + public int size(int limit) { + if (nodeLevel == 0) { + return numChildren; + } else { + int numLeft = limit; + for (short i = 0; i < 256 && numLeft > 0; i++) { + final IArtNode node = (IArtNode) nodes[i]; + if (node != null) { + numLeft -= node.size(numLeft); + } + } + return limit - numLeft; + } + } + + @Override + public void validateInternalState(int level) { + if (nodeLevel > level) throw new IllegalStateException("unexpected nodeLevel"); + int found = 0; + for (int i = 0; i < 256; i++) { + Object node = nodes[i]; + if (node != null) { + if (node instanceof IArtNode) { + if (nodeLevel == 0) throw new IllegalStateException("unexpected node type"); + IArtNode artNode = (IArtNode) node; + artNode.validateInternalState(nodeLevel - 8); + } else { + if (nodeLevel != 0) throw new IllegalStateException("unexpected node type"); + } + found++; + } + } + if (found != numChildren) { + throw new IllegalStateException("wrong numChildren"); + } + if (numChildren <= NODE48_SWITCH_THRESHOLD || numChildren > 256) { + throw new IllegalStateException("unexpected numChildren"); + } + } + + @Override + @SuppressWarnings("unchecked") + public List> entries() { + final long keyPrefix = nodeKey & (-1L << 8); + final List> list = new ArrayList<>(); + final short[] keys = createKeysArray(); + for (int i = 0; i < numChildren; i++) { + if (nodeLevel == 0) { + list.add(new LongAdaptiveRadixTreeMap.Entry<>(keyPrefix + keys[i], (V) nodes[keys[i]])); + } else { + list.addAll(((IArtNode) nodes[keys[i]]).entries()); + } + } + return list; + } + + @Override + public String printDiagram(String prefix, int level) { + final short[] keys = createKeysArray(); + return LongAdaptiveRadixTreeMap.printDiagram(prefix, level, nodeLevel, nodeKey, numChildren, idx -> keys[idx], idx -> nodes[keys[idx]]); + } + + @Override + public ObjectsPool getObjectsPool() { + return objectsPool; + } + + @Override + public String toString() { + return "ArtNode256{" + + "nodeKey=" + nodeKey + + ", nodeLevel=" + nodeLevel + + ", numChildren=" + numChildren + + '}'; + } + + private short[] createKeysArray() { + short[] keys = new short[numChildren]; + int j = 0; + for (short i = 0; i < 256; i++) { + if (nodes[i] != null) { + keys[j++] = i; + } + } + return keys; + } +} \ No newline at end of file diff --git a/src/main/java/exchange/core2/collections/art/ArtNode4.java b/src/main/java/exchange/core2/collections/art/ArtNode4.java new file mode 100644 index 000000000..7ddc20da9 --- /dev/null +++ b/src/main/java/exchange/core2/collections/art/ArtNode4.java @@ -0,0 +1,492 @@ +/* + * Copyright 2019-2020 Maksim Zheravin + * + * Licensed under the Apache License, Version 2.0 (the "License"); + * you may not use this file except in compliance with the License. + * You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, software + * distributed under the License is distributed on an "AS IS" BASIS, + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + * See the License for the specific language governing permissions and + * limitations under the License. + */ +package exchange.core2.collections.art; + +import exchange.core2.collections.objpool.ObjectsPool; + +import java.util.ArrayList; +import java.util.Arrays; +import java.util.List; +import java.util.Map; + +/** + * The smallest node type can store up to 4 child + * pointers and uses an array of length 4 for keys and another + * array of the same length for pointers. The keys and pointers + * are stored at corresponding positions and the keys are sorted. + */ +public final class ArtNode4 implements IArtNode { + + // keys are ordered + final short[] keys = new short[4]; + final Object[] nodes = new Object[4]; + + private final ObjectsPool objectsPool; + + long nodeKey; + int nodeLevel; + + byte numChildren; + + public ArtNode4(ObjectsPool objectsPool) { + this.objectsPool = objectsPool; + } + + // terminal node has always nodeLevel=0 + void initFirstKey(final long key, final V value) { + // create compact node + this.numChildren = 1; + this.keys[0] = (short) (key & 0xFF); + //this.nodes[0] = (level == 0) ? value : new ArtNode4<>(key, level - 8, value); + this.nodes[0] = value; + this.nodeKey = key; + this.nodeLevel = 0; + } + + // split-compact operation constructor + void initTwoKeys(final long key1, final Object value1, final long key2, final Object value2, final int level) { +// log.debug("new level={} key1={} key2={}", level, key1, key2); + // create compact node + this.numChildren = 2; + final short idx1 = (short) ((key1 >> level) & 0xFF); + final short idx2 = (short) ((key2 >> level) & 0xFF); + // ! smallest key first + if (key1 < key2) { + this.keys[0] = idx1; + this.nodes[0] = value1; + this.keys[1] = idx2; + this.nodes[1] = value2; + } else { + this.keys[0] = idx2; + this.nodes[0] = value2; + this.keys[1] = idx1; + this.nodes[1] = value1; + } + this.nodeKey = key1; // leading part the same for both keys + this.nodeLevel = level; + } + + // downsize 16->4 + void initFromNode16(ArtNode16 artNode16) { + // put original node back into pool + objectsPool.put(ObjectsPool.ART_NODE_16, artNode16); + + this.numChildren = artNode16.numChildren; + System.arraycopy(artNode16.keys, 0, this.keys, 0, numChildren); + System.arraycopy(artNode16.nodes, 0, this.nodes, 0, numChildren); + this.nodeLevel = artNode16.nodeLevel; + this.nodeKey = artNode16.nodeKey; + + Arrays.fill(artNode16.nodes, null); + } + + @Override + @SuppressWarnings("unchecked") + public V getValue(final long key, final int level) { + + if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { + return null; + } + final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); + + for (int i = 0; i < numChildren; i++) { + final short index = keys[i]; + if (index == nodeIndex) { + final Object node = nodes[i]; + return nodeLevel == 0 + ? (V) node + : ((IArtNode) node).getValue(key, nodeLevel - 8); + } + if (nodeIndex < index) { + // can give up searching because keys are in sorted order + break; + } + } + return null; + } + + @Override + @SuppressWarnings("unchecked") + public IArtNode put(final long key, final int level, final V value) { + +// log.debug(" ------ PUT {}", String.format("%X", key)); +// log.debug("level={} nodeLevel={}", level, nodeLevel); +// log.debug("key={} nodeKey={}", key, nodeKey); + + if (level != nodeLevel) { + final IArtNode branch = LongAdaptiveRadixTreeMap.branchIfRequired(key, value, nodeKey, nodeLevel, this); + if (branch != null) { + return branch; + } + } + +// log.debug("PUT key:{} level:{} value:{}", key, level, value); + + final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); + int pos = 0; + while (pos < numChildren) { + if (nodeIndex == keys[pos]) { + // just update + if (nodeLevel == 0) { + nodes[pos] = value; + } else { + final IArtNode resizedNode = ((IArtNode) nodes[pos]).put(key, nodeLevel - 8, value); + if (resizedNode != null) { + // update resized node if capacity has increased + nodes[pos] = resizedNode; + } + } + return null; + } + if (nodeIndex < keys[pos]) { + // can give up searching because keys are in sorted order + break; + } + pos++; + } + +// log.debug("pos:{}", pos); + + // new element + if (numChildren != 4) { + // capacity less than 4 - can simply insert node + final int copyLength = numChildren - pos; + if (copyLength != 0) { + System.arraycopy(keys, pos, keys, pos + 1, copyLength); + System.arraycopy(nodes, pos, nodes, pos + 1, copyLength); + } + keys[pos] = nodeIndex; + if (nodeLevel == 0) { + nodes[pos] = value; + } else { + final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); + newSubNode.initFirstKey(key, value); + nodes[pos] = newSubNode; + } + numChildren++; + return null; + } else { + // no space left, create a Node16 with new item + final Object newElement; + if (nodeLevel == 0) { + newElement = value; + } else { + final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); + newSubNode.initFirstKey(key, value); + newElement = newSubNode; + } + + ArtNode16 node16 = objectsPool.get(ObjectsPool.ART_NODE_16, ArtNode16::new); + node16.initFromNode4(this, nodeIndex, newElement); + + return node16; + } + } + + @Override + public String toString() { + return "ArtNode4{" + + "nodeKey=" + nodeKey + + ", nodeLevel=" + nodeLevel + + ", numChildren=" + numChildren + + '}'; + } + + @Override + @SuppressWarnings("unchecked") + public IArtNode remove(long key, int level) { + +// String prefix = StringUtils.repeat(" ", (56 - level) / 4); +// log.debug(prefix + " ------ REMOVE {}", String.format("%X", key)); + // 56 48 40 32 24 16 8 0 + // rem key 00 00 11 22 33 44 55 66 + +// log.debug(prefix + "level={} nodeLevel={}", level, nodeLevel); +// log.debug(prefix + "key={} nodeKey={}", key, nodeKey); + + + if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { + return this; + } + final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); + Object node = null; + int pos = 0; + while (pos < numChildren) { + if (nodeIndex == keys[pos]) { + // found + node = nodes[pos]; + break; + } + pos++; + } + + if (node == null) { + // not found + return this; + } + + // removing + if (nodeLevel == 0) { + removeElementAtPos(pos); + } else { + final IArtNode resizedNode = ((IArtNode) node).remove(key, nodeLevel - 8); + if (resizedNode != node) { + // TODO put old into the pool + // update resized node if capacity has decreased + nodes[pos] = resizedNode; + if (resizedNode == null) { + removeElementAtPos(pos); + if (numChildren == 1) { +// log.debug(prefix + "CAN MERGE! nodeLevel={} level={}", nodeLevel, level); + // todo put 'this' into pul + IArtNode lastNode = (IArtNode) nodes[0]; + // lastNode.setNodeLevel(nodeLevel); + return lastNode; + } + } + } + } + + if (numChildren == 0) { + // indicate if removed last one + Arrays.fill(nodes, null); + objectsPool.put(ObjectsPool.ART_NODE_4, this); + return null; + } else { + return this; + } + } + + @Override + @SuppressWarnings("unchecked") + public V getCeilingValue(long key, int level) { +// log.debug("key = {}", String.format("%Xh", key)); +// log.debug("level={} nodeLevel={} nodekey={} looking for key={} mask={}", +// level, nodeLevel, String.format("%Xh", nodeKey), String.format("%Xh", key), String.format("%Xh", mask)); + + // special processing for compacted nodes + if ((level != nodeLevel)) { + // try first + final long mask = -1L << (nodeLevel + 8); +// log.debug("key & mask = {} > nodeKey & mask = {}", +// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); + final long keyWithMask = key & mask; + final long nodeKeyWithMask = nodeKey & mask; + if (nodeKeyWithMask < keyWithMask) { + // compacted part is lower - no need to search for ceiling entry here + return null; + } else if (keyWithMask != nodeKeyWithMask) { + // accept first existing entry, because compacted nodekey is higher + key = 0; + } + } + + final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); + + for (int i = 0; i < numChildren; i++) { + final short index = keys[i]; +// log.debug("try index={} (looking for {}) key={}", String.format("%X", index), String.format("%X", nodeIndex), String.format("%X", key)); + // any equal or higher is ok + if (index == nodeIndex) { + final V res = nodeLevel == 0 + ? (V) nodes[i] + : ((IArtNode) nodes[i]).getCeilingValue(key, nodeLevel - 8); + if (res != null) { + // return if found ceiling, otherwise will try next one + return res; + } + } + if (index > nodeIndex) { + // exploring first higher key + return nodeLevel == 0 + ? (V) nodes[i] + : ((IArtNode) nodes[i]).getCeilingValue(0, nodeLevel - 8); // take lowest existing key + } + } + return null; + } + + @Override + @SuppressWarnings("unchecked") + public V getFloorValue(long key, int level) { + // log.debug("key = {}", String.format("%Xh", key)); +// log.debug("level={} nodeLevel={} nodekey={} looking for key={} mask={}", +// level, nodeLevel, String.format("%Xh", nodeKey), String.format("%Xh", key), String.format("%Xh", mask)); + + // special processing for compacted nodes + if ((level != nodeLevel)) { + // try first + final long mask = -1L << (nodeLevel + 8); +// log.debug("key & mask = {} > nodeKey & mask = {}", +// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); + final long keyWithMask = key & mask; + final long nodeKeyWithMask = nodeKey & mask; + if (nodeKeyWithMask > keyWithMask) { + // compacted part is higher - no need to search for floor entry here + return null; + } else if (keyWithMask != nodeKeyWithMask) { + // find highest value, because compacted nodekey is lower + key = Long.MAX_VALUE; + } + } + + final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); + + for (int i = numChildren - 1; i >= 0; i--) { + final short index = keys[i]; + if (index == nodeIndex) { + final V res = nodeLevel == 0 + ? (V) nodes[i] + : ((IArtNode) nodes[i]).getFloorValue(key, nodeLevel - 8); + if (res != null) { + // return if found ceiling, otherwise will try next one + return res; + } + } + if (index < nodeIndex) { + // exploring first lower key + return nodeLevel == 0 + ? (V) nodes[i] + : ((IArtNode) nodes[i]).getFloorValue(Long.MAX_VALUE, nodeLevel - 8); // take highest existing key + } + } + return null; + } + + @Override + @SuppressWarnings("unchecked") + public int forEach(LongObjConsumer consumer, int limit) { + if (nodeLevel == 0) { + final long keyBase = (nodeKey >>> 8) << 8; + final int n = Math.min(numChildren, limit); + for (int i = 0; i < n; i++) { + consumer.accept(keyBase + keys[i], (V) nodes[i]); + } + return n; + } else { + int numLeft = limit; + for (int i = 0; i < numChildren && numLeft > 0; i++) { + numLeft -= ((IArtNode) nodes[i]).forEach(consumer, numLeft); + } + return limit - numLeft; + } + } + + @Override + @SuppressWarnings("unchecked") + public int forEachDesc(LongObjConsumer consumer, int limit) { + if (nodeLevel == 0) { + final long keyBase = (nodeKey >>> 8) << 8; + int numFound = 0; + for (int i = numChildren - 1; i >= 0 && numFound < limit; i--) { + consumer.accept(keyBase + keys[i], (V) nodes[i]); + numFound++; + } + return numFound; + } else { + int numLeft = limit; + for (int i = numChildren - 1; i >= 0 && numLeft > 0; i--) { + numLeft -= ((IArtNode) nodes[i]).forEachDesc(consumer, numLeft); + } + return limit - numLeft; + } + } + + @Override + @SuppressWarnings("unchecked") + public int size(int limit) { + if (nodeLevel == 0) { + return numChildren; + } else { + int numLeft = limit; + for (int i = numChildren - 1; i >= 0 && numLeft > 0; i--) { + numLeft -= ((IArtNode) nodes[i]).size(numLeft); + } + return limit - numLeft; + } + } + + private void removeElementAtPos(final int pos) { + final int ppos = pos + 1; + final int copyLength = numChildren - ppos; + if (copyLength != 0) { + System.arraycopy(keys, ppos, keys, pos, copyLength); + System.arraycopy(nodes, ppos, nodes, pos, copyLength); + } + numChildren--; + nodes[numChildren] = null; + } + + @Override + public void validateInternalState(int level) { + if (nodeLevel > level) throw new IllegalStateException("unexpected nodeLevel"); + if (numChildren > 4 || numChildren < 1) throw new IllegalStateException("unexpected numChildren"); + short last = -1; + for (int i = 0; i < 4; i++) { + Object node = nodes[i]; + if (i < numChildren) { + if (node == null) throw new IllegalStateException("null node"); + if (keys[i] < 0 || keys[i] >= 256) throw new IllegalStateException("key out of range"); + if (keys[i] == last) throw new IllegalStateException("duplicate key"); + if (keys[i] < last) throw new IllegalStateException("wrong key order"); + last = keys[i]; + if (node instanceof IArtNode) { + if (nodeLevel == 0) throw new IllegalStateException("unexpected node type"); + IArtNode artNode = (IArtNode) node; + artNode.validateInternalState(nodeLevel - 8); + } else { + if (nodeLevel != 0) throw new IllegalStateException("unexpected node type"); + } + + } else { + if (node != null) throw new IllegalStateException("not released node"); + } + + } + + } + + @Override + public String printDiagram(String prefix, int level) { +// log.debug(">>>> {} level={} nodelevel={} nodekey={}", prefix, level, nodeLevel, nodeKey); + + + return LongAdaptiveRadixTreeMap.printDiagram(prefix, level, nodeLevel, nodeKey, numChildren, + idx -> keys[idx], idx -> nodes[idx]); + } + + @Override + @SuppressWarnings("unchecked") + public List> entries() { + final long keyPrefix = nodeKey & (-1L << 8); + + final List> list = new ArrayList<>(); + for (int i = 0; i < numChildren; i++) { + if (nodeLevel == 0) { + list.add(new LongAdaptiveRadixTreeMap.Entry<>(keyPrefix + keys[i], (V) nodes[i])); + } else { + list.addAll(((IArtNode) nodes[i]).entries()); + } + } + return list; + } + + @Override + public ObjectsPool getObjectsPool() { + return objectsPool; + } + +} diff --git a/src/main/java/exchange/core2/collections/art/ArtNode48.java b/src/main/java/exchange/core2/collections/art/ArtNode48.java new file mode 100644 index 000000000..0b897928c --- /dev/null +++ b/src/main/java/exchange/core2/collections/art/ArtNode48.java @@ -0,0 +1,483 @@ +/* + * Copyright 2019-2020 Maksim Zheravin + * + * Licensed under the Apache License, Version 2.0 (the "License"); + * you may not use this file except in compliance with the License. + * You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, software + * distributed under the License is distributed on an "AS IS" BASIS, + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + * See the License for the specific language governing permissions and + * limitations under the License. + */ +package exchange.core2.collections.art; + +import exchange.core2.collections.objpool.ObjectsPool; + +import java.util.*; + +/** + * As the number of entries in a node increases, + * searching the key array becomes expensive. Therefore, nodes + * with more than 16 pointers do not store the keys explicitly. + * Instead, a 256-element array is used, which can be indexed + * with key bytes directly. If a node has between 17 and 48 child + * pointers, this array stores indexes into a second array which + * contains up to 48 pointers. This indirection saves space in + * comparison to 256 pointers of 8 bytes, because the indexes + * only require 6 bits (we use 1 byte for simplicity). + */ +public final class ArtNode48 implements IArtNode { + + private static final int NODE16_SWITCH_THRESHOLD = 12; + + // just keep indexes + final byte[] indexes = new byte[256]; + final Object[] nodes = new Object[48]; + private long freeBitMask; + + long nodeKey; + int nodeLevel; + + byte numChildren; + + private final ObjectsPool objectsPool; + + public ArtNode48(ObjectsPool objectsPool) { + this.objectsPool = objectsPool; + } + + void initFromNode16(ArtNode16 node16, short subKey, Object newElement) { + + final byte sourceSize = 16; + Arrays.fill(this.indexes, (byte) -1); + this.numChildren = sourceSize + 1; + this.nodeLevel = node16.nodeLevel; + this.nodeKey = node16.nodeKey; + + for (byte i = 0; i < sourceSize; i++) { + this.indexes[node16.keys[i]] = i; + this.nodes[i] = node16.nodes[i]; + } + + this.indexes[subKey] = sourceSize; + this.nodes[sourceSize] = newElement; + this.freeBitMask = (1L << (sourceSize + 1)) - 1; + + Arrays.fill(node16.nodes, null); + objectsPool.put(ObjectsPool.ART_NODE_16, node16); + } + + void initFromNode256(ArtNode256 node256) { + Arrays.fill(this.indexes, (byte) -1); + this.numChildren = (byte) node256.numChildren; + this.nodeLevel = node256.nodeLevel; + this.nodeKey = node256.nodeKey; + byte idx = 0; + for (int i = 0; i < 256; i++) { + Object node = node256.nodes[i]; + if (node != null) { + this.indexes[i] = idx; + this.nodes[idx] = node; + idx++; + if (idx == numChildren) { + break; + } + } + } + this.freeBitMask = (1L << (numChildren)) - 1; + + Arrays.fill(node256.nodes, null); + objectsPool.put(ObjectsPool.ART_NODE_256, node256); + } + + @Override + @SuppressWarnings("unchecked") + public V getValue(final long key, final int level) { + if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { + return null; + } + final short idx = (short) ((key >>> nodeLevel) & 0xFF); + final byte nodeIndex = indexes[idx]; + if (nodeIndex != -1) { + final Object node = nodes[nodeIndex]; + return nodeLevel == 0 + ? (V) node + : ((IArtNode) node).getValue(key, nodeLevel - 8); + } + return null; + } + + @Override + @SuppressWarnings("unchecked") + public IArtNode put(final long key, final int level, final V value) { + if (level != nodeLevel) { + final IArtNode branch = LongAdaptiveRadixTreeMap.branchIfRequired(key, value, nodeKey, nodeLevel, this); + if (branch != null) { + return branch; + } + } + final short idx = (short) ((key >>> nodeLevel) & 0xFF); + final byte nodeIndex = indexes[idx]; + if (nodeIndex != -1) { + // found + if (nodeLevel == 0) { + nodes[nodeIndex] = value; + } else { + final IArtNode resizedNode = ((IArtNode) nodes[nodeIndex]).put(key, nodeLevel - 8, value); + if (resizedNode != null) { + // update resized node if capacity has increased + // TODO put old into the pool + nodes[nodeIndex] = resizedNode; + } + } + return null; + } + + // not found, put new element + + if (numChildren != 48) { + // capacity less than 48 - can simply insert node + final byte freePosition = (byte) Long.numberOfTrailingZeros(~freeBitMask); + indexes[idx] = freePosition; + + if (nodeLevel == 0) { + nodes[freePosition] = value; + } else { + final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); + newSubNode.initFirstKey(key, value); + nodes[freePosition] = newSubNode; + } + numChildren++; + freeBitMask = freeBitMask ^ (1L << freePosition); + return null; + + } else { + // no space left, create a ArtNode256 containing a new item + final Object newElement; + if (nodeLevel == 0) { + newElement = value; + } else { + final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); + newSubNode.initFirstKey(key, value); + newElement = newSubNode; + } + + ArtNode256 node256 = objectsPool.get(ObjectsPool.ART_NODE_256, ArtNode256::new); + node256.initFromNode48(this, idx, newElement); + + return node256; + } + } + + @Override + @SuppressWarnings("unchecked") + public IArtNode remove(long key, int level) { + if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { + return this; + } + final short idx = (short) ((key >>> nodeLevel) & 0xFF); + final byte nodeIndex = indexes[idx]; + if (nodeIndex == -1) { + return this; + } + + if (nodeLevel == 0) { + nodes[nodeIndex] = null; + indexes[idx] = -1; + numChildren--; + freeBitMask = freeBitMask ^ (1L << nodeIndex); + } else { + final IArtNode node = (IArtNode) nodes[nodeIndex]; + final IArtNode resizedNode = node.remove(key, nodeLevel - 8); + if (resizedNode != node) { + // TODO put old into the pool + // update resized node if capacity has decreased + nodes[nodeIndex] = resizedNode; + if (resizedNode == null) { + numChildren--; + indexes[idx] = -1; + freeBitMask = freeBitMask ^ (1L << nodeIndex); + } + } + } + + if (numChildren == NODE16_SWITCH_THRESHOLD) { + final ArtNode16 newNode = objectsPool.get(ObjectsPool.ART_NODE_16, ArtNode16::new); + newNode.initFromNode48(this); + return newNode; + } else { + return this; + } + } + + @Override + @SuppressWarnings("unchecked") + public V getCeilingValue(long key, int level) { +// log.debug("key = {}", String.format("%Xh", key)); + // special processing for compacted nodes + if ((level != nodeLevel)) { + // try first + final long mask = -1L << (nodeLevel + 8); +// log.debug("key & mask = {} > nodeKey & mask = {}", String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); + final long keyWithMask = key & mask; + final long nodeKeyWithMask = nodeKey & mask; + if (nodeKeyWithMask < keyWithMask) { + // compacted part is lower - no need to search for ceiling entry here + return null; + } else if (keyWithMask != nodeKeyWithMask) { + // can reset key, because compacted nodekey is higher + key = 0; + } + } + + short idx = (short) ((key >>> nodeLevel) & 0xFF); + + byte index = indexes[idx]; + if (index != -1) { + // if exact key found + final V res = nodeLevel == 0 ? (V) nodes[index] : ((IArtNode) nodes[index]).getCeilingValue(key, nodeLevel - 8); + if (res != null) { + // return if found ceiling, otherwise will try next one + return res; + } + } + + // if exact key not found - searching for first higher key + while (++idx < 256) { + index = indexes[idx]; + if (index != -1) { + if (nodeLevel == 0) { + // found + return (V) nodes[index]; + } else { + // find first lowest key + return ((IArtNode) nodes[index]).getCeilingValue(0, nodeLevel - 8); + } + } + } + + // no keys found + return null; + } + + @Override + @SuppressWarnings("unchecked") + public V getFloorValue(long key, int level) { + // log.debug("key = {}", String.format("%Xh", key)); + // special processing for compacted nodes + if ((level != nodeLevel)) { + // try first + final long mask = -1L << (nodeLevel + 8); +// log.debug("key & mask = {} > nodeKey & mask = {}", +// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); + final long keyWithMask = key & mask; + final long nodeKeyWithMask = nodeKey & mask; + if (nodeKeyWithMask > keyWithMask) { + // compacted part is higher - no need to search for floor entry here + return null; + } else if (keyWithMask != nodeKeyWithMask) { + // find highest value, because compacted nodekey is lower + key = Long.MAX_VALUE; + } + } + + short idx = (short) ((key >>> nodeLevel) & 0xFF); + + byte index = indexes[idx]; + if (index != -1) { + // if exact key found + final V res = nodeLevel == 0 ? (V) nodes[index] : ((IArtNode) nodes[index]).getFloorValue(key, nodeLevel - 8); + if (res != null) { + // return if found ceiling, otherwise will try prev one + return res; + } + } + + // if exact key not found - searching for first lower key + while (--idx >= 0) { + index = indexes[idx]; + if (index != -1) { + if (nodeLevel == 0) { + // found + return (V) nodes[index]; + } else { + // find first highest key + return ((IArtNode) nodes[index]).getFloorValue(Long.MAX_VALUE, nodeLevel - 8); + } + } + } + + // no keys found + return null; + } + + @Override + @SuppressWarnings("unchecked") + public int forEach(LongObjConsumer consumer, int limit) { + if (nodeLevel == 0) { + final long keyBase = (nodeKey >>> 8) << 8; + int numFound = 0; + for (short i = 0; i < 256; i++) { + if (numFound == limit) { + return numFound; + } + final byte index = indexes[i]; + if (index != -1) { + consumer.accept(keyBase + i, (V) nodes[index]); + numFound++; + } + } + return numFound; + } else { + int numLeft = limit; + for (short i = 0; i < 256 && numLeft > 0; i++) { + final byte index = indexes[i]; + if (index != -1) { + numLeft -= ((IArtNode) nodes[index]).forEach(consumer, numLeft); + } + } + return limit - numLeft; + } + } + + @Override + @SuppressWarnings("unchecked") + public int forEachDesc(LongObjConsumer consumer, int limit) { + if (nodeLevel == 0) { + final long keyBase = (nodeKey >>> 8) << 8; + int numFound = 0; + for (short i = 255; i >= 0; i--) { + if (numFound == limit) { + return numFound; + } + final byte index = indexes[i]; + if (index != -1) { + consumer.accept(keyBase + i, (V) nodes[index]); + numFound++; + } + } + return numFound; + } else { + int numLeft = limit; + for (short i = 255; i >= 0 && numLeft > 0; i--) { + final byte index = indexes[i]; + if (index != -1) { + numLeft -= ((IArtNode) nodes[index]).forEachDesc(consumer, numLeft); + } + } + return limit - numLeft; + } + } + + @Override + @SuppressWarnings("unchecked") + public int size(int limit) { + if (nodeLevel == 0) { + return numChildren; + } else { + int numLeft = limit; + for (short i = 0; i < 256 && numLeft > 0; i++) { + final byte index = indexes[i]; + if (index != -1) { + numLeft -= ((IArtNode) nodes[index]).size(numLeft); + } + } + return limit - numLeft; + } + } + + + @Override + public void validateInternalState(int level) { + if (nodeLevel > level) throw new IllegalStateException("unexpected nodeLevel"); + int found = 0; + final Set keysSet = new HashSet<>(); + long expectedBitMask = 0; + for (int i = 0; i < 256; i++) { + byte idx = indexes[i]; + if (idx != -1) { + if (idx > 47 || idx < -1) throw new IllegalStateException("wrong index"); + keysSet.add((int) idx); + found++; + if (nodes[idx] == null) throw new IllegalStateException("null node"); + expectedBitMask ^= (1L << idx); + } + } + if (freeBitMask != expectedBitMask) throw new IllegalStateException("freeBitMask is wrong"); + if (found != numChildren) throw new IllegalStateException("wrong numChildren"); + if (keysSet.size() != numChildren) { + throw new IllegalStateException("duplicate keys keysSet=" + keysSet + " numChildren=" + numChildren); + } + if (numChildren > 48 || numChildren <= NODE16_SWITCH_THRESHOLD) + throw new IllegalStateException("unexpected numChildren"); + for (int i = 0; i < 48; i++) { + Object node = nodes[i]; + if (keysSet.contains(i)) { + if (node == null) { + throw new IllegalStateException("null node"); + } else { + if (node instanceof IArtNode) { + if (nodeLevel == 0) throw new IllegalStateException("unexpected node type"); + IArtNode artNode = (IArtNode) node; + artNode.validateInternalState(nodeLevel - 8); + } else { + if (nodeLevel != 0) throw new IllegalStateException("unexpected node type"); + } + } + } else { + if (node != null) throw new IllegalStateException("not released node"); + } + } + } + + @Override + @SuppressWarnings("unchecked") + public List> entries() { + final long keyPrefix = nodeKey & (-1L << 8); + final List> list = new ArrayList<>(); + short[] keys = createKeysArray(); + for (int i = 0; i < numChildren; i++) { + if (nodeLevel == 0) { + list.add(new LongAdaptiveRadixTreeMap.Entry<>(keyPrefix + keys[i], (V) nodes[indexes[keys[i]]])); + } else { + list.addAll(((IArtNode) nodes[indexes[keys[i]]]).entries()); + } + } + return list; + } + + @Override + public String printDiagram(String prefix, int level) { + final short[] keys = createKeysArray(); + return LongAdaptiveRadixTreeMap.printDiagram(prefix, level, nodeLevel, nodeKey, numChildren, idx -> keys[idx], idx -> nodes[indexes[keys[idx]]]); + } + + @Override + public ObjectsPool getObjectsPool() { + return objectsPool; + } + + @Override + public String toString() { + return "ArtNode48{" + + "nodeKey=" + nodeKey + + ", nodeLevel=" + nodeLevel + + ", numChildren=" + numChildren + + '}'; + } + + private short[] createKeysArray() { + short[] keys = new short[numChildren]; + int j = 0; + for (short i = 0; i < 256; i++) { + if (indexes[i] != -1) { + keys[j++] = i; + } + } + return keys; + } +} diff --git a/src/main/java/exchange/core2/collections/art/IArtNode.java b/src/main/java/exchange/core2/collections/art/IArtNode.java new file mode 100644 index 000000000..caa25f39b --- /dev/null +++ b/src/main/java/exchange/core2/collections/art/IArtNode.java @@ -0,0 +1,74 @@ +/* + * Copyright 2019-2020 Maksim Zheravin + * + * Licensed under the Apache License, Version 2.0 (the "License"); + * you may not use this file except in compliance with the License. + * You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, software + * distributed under the License is distributed on an "AS IS" BASIS, + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + * See the License for the specific language governing permissions and + * limitations under the License. + */ +package exchange.core2.collections.art; + + +import exchange.core2.collections.objpool.ObjectsPool; + +import java.util.List; +import java.util.Map; + +public interface IArtNode { + + V getValue(long key, int level); + + IArtNode put(long key, int level, V value); + + IArtNode remove(long key, int level); + + V getCeilingValue(long key, int level); + + V getFloorValue(long key, int level); + + int forEach(LongObjConsumer consumer, int limit); + + int forEachDesc(LongObjConsumer consumer, int limit); + + /** + * Get number of elements + * Slow operation - O(n) complexity + * + * @param limit - can provide value to operation increase performance + * @return if returned value less than limit - it is precise size of the node + */ + int size(int limit); + + /** + * For testing only + * + * @param level level + */ + void validateInternalState(int level); + + /** + * For testing only + * + * @param prefix prefix + * @param level level + * @return internal diagram part + */ + String printDiagram(String prefix, int level); + + /** + * For testing only + * + * @return list of entries + */ + List> entries(); + + + ObjectsPool getObjectsPool(); +} diff --git a/src/main/java/exchange/core2/collections/art/LongAdaptiveRadixTreeMap.java b/src/main/java/exchange/core2/collections/art/LongAdaptiveRadixTreeMap.java new file mode 100644 index 000000000..e571b2568 --- /dev/null +++ b/src/main/java/exchange/core2/collections/art/LongAdaptiveRadixTreeMap.java @@ -0,0 +1,308 @@ +/* + * Copyright 2019-2020 Maksim Zheravin + * + * Licensed under the Apache License, Version 2.0 (the "License"); + * you may not use this file except in compliance with the License. + * You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, software + * distributed under the License is distributed on an "AS IS" BASIS, + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + * See the License for the specific language governing permissions and + * limitations under the License. + */ +package exchange.core2.collections.art; + +import exchange.core2.collections.objpool.ObjectsPool; + +import java.util.Collections; +import java.util.List; +import java.util.Map; +import java.util.function.Function; +import java.util.function.Supplier; + +/** + * Adaptive Radix Tree (ART) Java implementation + *

+ * based on original paper: + *

+ * The Adaptive Radix Tree: + * ARTful Indexing for Main-Memory Databases + *

+ * Viktor Leis, Alfons Kemper, Thomas Neumann + * Fakultat fur Informatik + * Technische Universitat Munchen + * Boltzmannstrae 3, D-85748 Garching + *

+ * https://db.in.tum.de/~leis/papers/ART.pdf + *

+ * Target operations: + * - GET or (PUT + GET_LOWER/HIGHER) - placing/moving/bulkload order - often GET, more rare PUT ??cache + * - REMOVE - cancel or move - last order in the bucket + * - TRAVERSE from LOWER - filling L2 market data, in hot area (Node256 or Node48). + * - REMOVE price during matching - !! can use RANGE removal operation - rare, but latency critical + * - GET or PUT if not exists - inserting back own orders, very rare + */ +public final class LongAdaptiveRadixTreeMap { + + private static final int INITIAL_LEVEL = 56; + + private IArtNode root = null; + + private final ObjectsPool objectsPool; + + public LongAdaptiveRadixTreeMap(ObjectsPool objectsPool) { + this.objectsPool = objectsPool; + } + + public LongAdaptiveRadixTreeMap() { + objectsPool = ObjectsPool.createDefaultTestPool(); + } + + public V get(final long key) { + return root != null + ? root.getValue(key, INITIAL_LEVEL) + : null; + } + + public void put(final long key, final V value) { + if (root == null) { + final ArtNode4 node = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); + node.initFirstKey(key, value); + root = node; + } else { + + final IArtNode upSizedNode = root.put(key, INITIAL_LEVEL, value); + if (upSizedNode != null) { + // TODO put old into the pool + root = upSizedNode; + } + } + } + + public V getOrInsert(final long key, Supplier supplier) { + // TODO implement + return null; + } + + public void getOrInsertFromNode(final IArtNode node, Supplier supplier) { + // TODO implement + } + + public void remove(final long key) { + if (root != null) { + final IArtNode downSizeNode = root.remove(key, INITIAL_LEVEL); + // ignore null because can not remove root + if (downSizeNode != root) { + // TODO put old into the pool + root = downSizeNode; + } + } + } + + public void clear() { + // produces garbage + root = null; + } + + /** + * remove keys range + * + * @param keyFromInclusive from key inclusive + * @param keyToExclusive to key exclusive + */ + public void removeRange(final long keyFromInclusive, final long keyToExclusive) { + // TODO + throw new UnsupportedOperationException(); + } + + + // TODO putAndGetHigherValue + // TODO putAndGetLowerValue + + // TODO moveToAnotherKey(long oldKey, long newKey) - throw exception if not found + + public V getHigherValue(long key) { + if (root != null && key != Long.MAX_VALUE) { + return root.getCeilingValue(key + 1, INITIAL_LEVEL); + } else { + return null; + } + } + + public V getLowerValue(long key) { + if (root != null && key != 0) { + return root.getFloorValue(key - 1, INITIAL_LEVEL); + } else { + return null; + } + } + + public int forEach(LongObjConsumer consumer, int limit) { + if (root != null) { + return root.forEach(consumer, limit); + } else { + return 0; + } + } + + public int forEachDesc(LongObjConsumer consumer, int limit) { + if (root != null) { + return root.forEachDesc(consumer, limit); + } else { + return 0; + } + } + + public int size(int limit) { + if (root != null) { + return Math.min(root.size(limit), limit); + } else { + return 0; + } + } + + public List> entriesList() { + if (root != null) { + return root.entries(); + } else { + return Collections.emptyList(); + } + } + + public void validateInternalState() { + if (root != null) { + // TODO initial level + root.validateInternalState(INITIAL_LEVEL); + } + } + + public String printDiagram() { + if (root != null) { + return root.printDiagram("", INITIAL_LEVEL); + } else { + return ""; + } + } + + + static IArtNode branchIfRequired(final long key, final V value, final long nodeKey, final int nodeLevel, final IArtNode caller) { + + final long keyDiff = key ^ nodeKey; + + // check if there is common part + if ((keyDiff & (-1L << nodeLevel)) == 0) { + return null; + } + + // on which level + final int newLevel = (63 - Long.numberOfLeadingZeros(keyDiff)) & 0xF8; + if (newLevel == nodeLevel) { + return null; + } + + final ObjectsPool objectsPool = caller.getObjectsPool(); + final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); + newSubNode.initFirstKey(key, value); + + final ArtNode4 newNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); + newNode.initTwoKeys(nodeKey, caller, key, newSubNode, newLevel); + + return newNode; + } + +// static boolean keyNotMatches(long key, int level, long nodeKey, int nodeLevel) { +// return (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0); +// } + // TODO remove based on leaf (having reference) ? + + static String printDiagram(String prefix, + int level, + int nodeLevel, + long nodeKey, + short numChildren, + Function subKeys, + Function nodes) { + + final String baseKeyPrefix; + final String baseKeyPrefix1; + final int lvlDiff = level - nodeLevel; +// log.debug("nodeKey={} level={} nodeLevel={} lvlDiff={}", String.format("%X", nodeKey), level, nodeLevel, lvlDiff); + + if (lvlDiff != 0) { + int chars = lvlDiff >> 2; +// baseKeyPrefix = String.format("[%0" + chars + "X]", nodeKey & ((1L << lvlDiff) - 1L) << nodeLevel); + long mask = ((1L << lvlDiff) - 1L); +// log.debug(" mask={}", String.format("%X", mask)); +// log.debug(" nodeKey >> level = {}", String.format("%X", nodeKey >> (nodeLevel + 8))); +// log.debug(" nodeKey >> level & mask= {}", String.format("%X", (nodeKey >> (nodeLevel + 8)) & mask)); + baseKeyPrefix = charRepeat('─', chars - 2) + String.format("[%0" + chars + "X]", (nodeKey >> (nodeLevel + 8)) & mask); + baseKeyPrefix1 = charRepeat(' ', chars * 2); + } else { + baseKeyPrefix = ""; + baseKeyPrefix1 = ""; + } + // log.debug("baseKeyPrefix={}", baseKeyPrefix); + + + StringBuilder sb = new StringBuilder(); + for (short i = 0; i < numChildren; i++) { + Object node = nodes.apply(i); + String key = String.format("%s%02X", baseKeyPrefix, subKeys.apply(i)); + String x = (i == 0 ? (numChildren == 1 ? "──" : "┬─") : (i + 1 == numChildren ? (prefix + "└─") : (prefix + "├─"))); + + if (nodeLevel == 0) { + sb.append(x + key + " = " + node); + } else { + sb.append(x + key + "" + (((IArtNode) node).printDiagram(prefix + (i + 1 == numChildren ? " " : "│ ") + baseKeyPrefix1, nodeLevel - 8))); + } + if (i < numChildren - 1) { + sb.append("\n"); + } else if (nodeLevel == 0) { + sb.append("\n" + prefix); + } + } + return sb.toString(); + } + + private static String charRepeat(char x, int n) { + StringBuilder sb = new StringBuilder(); + for (int i = 0; i < n; i++) { + sb.append(x); + } + return sb.toString(); + } + + + public static final class Entry implements Map.Entry { + + final long key; + + V value; + + public Entry(long key, V value) { + this.key = key; + this.value = value; + } + + @Override + public Long getKey() { + return key; + } + + @Override + public V getValue() { + return value; + } + + @Override + public V setValue(V value) { + final V v = this.value; + this.value = value; + return v; + } + } + +} diff --git a/src/main/java/exchange/core2/collections/art/LongObjConsumer.java b/src/main/java/exchange/core2/collections/art/LongObjConsumer.java new file mode 100644 index 000000000..8b12db5f3 --- /dev/null +++ b/src/main/java/exchange/core2/collections/art/LongObjConsumer.java @@ -0,0 +1,28 @@ +/* + * Copyright 2019-2020 Maksim Zheravin + * + * Licensed under the Apache License, Version 2.0 (the "License"); + * you may not use this file except in compliance with the License. + * You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, software + * distributed under the License is distributed on an "AS IS" BASIS, + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + * See the License for the specific language governing permissions and + * limitations under the License. + */ +package exchange.core2.collections.art; + +@FunctionalInterface +public interface LongObjConsumer { + + /** + * Performs this operation on the given arguments. + * + * @param a the first input argument + * @param b the second input argument + */ + void accept(long a, T b); +} diff --git a/src/main/java/exchange/core2/collections/objpool/ObjectsPool.java b/src/main/java/exchange/core2/collections/objpool/ObjectsPool.java new file mode 100644 index 000000000..6e6d65a0f --- /dev/null +++ b/src/main/java/exchange/core2/collections/objpool/ObjectsPool.java @@ -0,0 +1,117 @@ +/* + * Copyright 2019-2020 Maksim Zheravin + * + * Licensed under the Apache License, Version 2.0 (the "License"); + * you may not use this file except in compliance with the License. + * You may obtain a copy of the License at + * + * http://www.apache.org/licenses/LICENSE-2.0 + * + * Unless required by applicable law or agreed to in writing, software + * distributed under the License is distributed on an "AS IS" BASIS, + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + * See the License for the specific language governing permissions and + * limitations under the License. + */ +package exchange.core2.collections.objpool; + +import java.util.HashMap; +import java.util.Map; +import java.util.function.Function; +import java.util.function.Supplier; + +public final class ObjectsPool { + + public static final int ORDER = 0; + + public static final int DIRECT_ORDER = 1; + public static final int DIRECT_BUCKET = 2; + public static final int ART_NODE_4 = 8; + public static final int ART_NODE_16 = 9; + public static final int ART_NODE_48 = 10; + public static final int ART_NODE_256 = 11; + public static final int SYMBOL_POSITION_RECORD = 12; + + private final ArrayStack[] pools; + + + public static ObjectsPool createDefaultTestPool() { + + // initialize object pools + final HashMap objectsPoolConfig = new HashMap<>(); + objectsPoolConfig.put(ObjectsPool.DIRECT_ORDER, 512); + objectsPoolConfig.put(ObjectsPool.DIRECT_BUCKET, 256); + objectsPoolConfig.put(ObjectsPool.ART_NODE_4, 256); + objectsPoolConfig.put(ObjectsPool.ART_NODE_16, 128); + objectsPoolConfig.put(ObjectsPool.ART_NODE_48, 64); + objectsPoolConfig.put(ObjectsPool.ART_NODE_256, 32); + + return new ObjectsPool(objectsPoolConfig); + } + + public ObjectsPool(final Map sizesConfig) { + int maxStack = sizesConfig.keySet().stream().max(Integer::compareTo).orElse(0); + this.pools = new ArrayStack[maxStack + 1]; + sizesConfig.forEach((type, size) -> this.pools[type] = new ArrayStack(size)); + } + + @SuppressWarnings("unchecked") + public T get(final int type, final Supplier supplier) { + final T obj = (T) pools[type].pop(); // pollFirst is cheaper for empty pool + + if (obj == null) { +// log.debug("MISS {}", type); + return supplier.get(); + } else { +// log.debug("HIT {} (count={})", type, pools[type].count); + return obj; + } + } + + @SuppressWarnings("unchecked") + public T get(final int type, final Function constructor) { + final T obj = (T) pools[type].pop(); // pollFirst is cheaper for empty pool + + if (obj == null) { +// log.debug("MISS {}", type); + return constructor.apply(this); + } else { +// log.debug("HIT {} (count={})", type, pools[type].count); + return obj; + } + } + + public void put(final int type, Object object) { +// log.debug("RETURN {} (count={})", type, pools[type].count); + pools[type].add(object); + } + + private final static class ArrayStack { + private int count; + private Object[] objects; + + ArrayStack(int fixedSize) { + this.objects = new Object[fixedSize]; + this.count = 0; + } + + void add(Object element) { + if (count != objects.length) { + objects[count] = element; + count++; + } + } + + Object pop() { + if (count != 0) { + count--; + Object object = objects[count]; + objects[count] = null; + return object; + } + return null; + } + } + + +} From a6975f3d699688a1249a09d46100b3e5042aa840 Mon Sep 17 00:00:00 2001 From: Nazarii Zastavnyi Date: Thu, 6 Nov 2025 19:40:14 +0100 Subject: [PATCH 2/3] FCLIQU-1352: change java version --- .github/workflows/publish.yml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/.github/workflows/publish.yml b/.github/workflows/publish.yml index 6d8fa4e70..423bff329 100644 --- a/.github/workflows/publish.yml +++ b/.github/workflows/publish.yml @@ -17,7 +17,7 @@ jobs: - uses: actions/setup-java@v4 with: distribution: temurin - java-version: '17' + java-version: '8' - name: Publish env: GITHUB_ACTOR: ${{ github.actor }} From e6a413e5970bd227d321b716056d33e5b4eff69c Mon Sep 17 00:00:00 2001 From: Nazarii Zastavnyi Date: Thu, 6 Nov 2025 20:39:02 +0100 Subject: [PATCH 3/3] FCLIQU-1352: fix dependencies --- .gitignore | 2 +- build.gradle | 2 + .../core2/collections/art/ArtNode16.java | 470 ----------------- .../core2/collections/art/ArtNode256.java | 397 -------------- .../core2/collections/art/ArtNode4.java | 492 ------------------ .../core2/collections/art/ArtNode48.java | 483 ----------------- .../core2/collections/art/IArtNode.java | 74 --- .../art/LongAdaptiveRadixTreeMap.java | 308 ----------- .../collections/art/LongObjConsumer.java | 28 - .../collections/objpool/ObjectsPool.java | 117 ----- 10 files changed, 3 insertions(+), 2370 deletions(-) delete mode 100644 src/main/java/exchange/core2/collections/art/ArtNode16.java delete mode 100644 src/main/java/exchange/core2/collections/art/ArtNode256.java delete mode 100644 src/main/java/exchange/core2/collections/art/ArtNode4.java delete mode 100644 src/main/java/exchange/core2/collections/art/ArtNode48.java delete mode 100644 src/main/java/exchange/core2/collections/art/IArtNode.java delete mode 100644 src/main/java/exchange/core2/collections/art/LongAdaptiveRadixTreeMap.java delete mode 100644 src/main/java/exchange/core2/collections/art/LongObjConsumer.java delete mode 100644 src/main/java/exchange/core2/collections/objpool/ObjectsPool.java diff --git a/.gitignore b/.gitignore index 7509717d5..ae51257f4 100644 --- a/.gitignore +++ b/.gitignore @@ -18,4 +18,4 @@ build .gradle #DS -.DS_Store \ No newline at end of file +.DS_Store diff --git a/build.gradle b/build.gradle index 46dd428d4..1cfeb18e4 100644 --- a/build.gradle +++ b/build.gradle @@ -18,6 +18,8 @@ repositories { } dependencies { + implementation "exchange.core2:collections:0.5.1" + implementation "com.lmax:disruptor:3.4.4" // LZ4 diff --git a/src/main/java/exchange/core2/collections/art/ArtNode16.java b/src/main/java/exchange/core2/collections/art/ArtNode16.java deleted file mode 100644 index d2e31c5c5..000000000 --- a/src/main/java/exchange/core2/collections/art/ArtNode16.java +++ /dev/null @@ -1,470 +0,0 @@ -/* - * Copyright 2019-2020 Maksim Zheravin - * - * Licensed under the Apache License, Version 2.0 (the "License"); - * you may not use this file except in compliance with the License. - * You may obtain a copy of the License at - * - * http://www.apache.org/licenses/LICENSE-2.0 - * - * Unless required by applicable law or agreed to in writing, software - * distributed under the License is distributed on an "AS IS" BASIS, - * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. - * See the License for the specific language governing permissions and - * limitations under the License. - */ -package exchange.core2.collections.art; - -import exchange.core2.collections.objpool.ObjectsPool; - -import java.util.ArrayList; -import java.util.Arrays; -import java.util.List; -import java.util.Map; - -/** - * This node type is used for storing between 5 and - * 16 child pointers. Like the Node4, the keys and pointers - * are stored in separate arrays at corresponding positions, but - * both arrays have space for 16 entries. A key can be found - * efficiently with binary search or, on modern hardware, with - * parallel comparisons using SIMD instructions. - */ -public final class ArtNode16 implements IArtNode { - - private static final int NODE4_SWITCH_THRESHOLD = 3; - - // keys are ordered - final short[] keys = new short[16]; - final Object[] nodes = new Object[16]; - - long nodeKey; - int nodeLevel; - - byte numChildren; - - private final ObjectsPool objectsPool; - - public ArtNode16(ObjectsPool objectsPool) { - this.objectsPool = objectsPool; - } - - void initFromNode4(ArtNode4 node4, short subKey, Object newElement) { - - final byte sourceSize = node4.numChildren; - this.nodeLevel = node4.nodeLevel; - this.nodeKey = node4.nodeKey; - this.numChildren = (byte) (sourceSize + 1); - int inserted = 0; - for (int i = 0; i < sourceSize; i++) { - final int key = node4.keys[i]; - if (inserted == 0 && key > subKey) { - keys[i] = subKey; - nodes[i] = newElement; - inserted = 1; - } - keys[i + inserted] = node4.keys[i]; - nodes[i + inserted] = node4.nodes[i]; - } - if (inserted == 0) { - keys[sourceSize] = subKey; - nodes[sourceSize] = newElement; - } - - // put original node back into pool - Arrays.fill(node4.nodes, null); - objectsPool.put(ObjectsPool.ART_NODE_4, node4); - } - - void initFromNode48(ArtNode48 node48) { -// log.debug("48->16 nodeLevel={} (nodekey={})", node48.nodeLevel, node48.nodeKey); - this.numChildren = node48.numChildren; - this.nodeLevel = node48.nodeLevel; - this.nodeKey = node48.nodeKey; - byte idx = 0; - for (short i = 0; i < 256; i++) { - final byte j = node48.indexes[i]; - if (j != -1) { - this.keys[idx] = i; - this.nodes[idx] = node48.nodes[j]; - idx++; - } - if (idx == numChildren) { - break; - } - } - - Arrays.fill(node48.nodes, null); - Arrays.fill(node48.indexes, (byte) -1); - objectsPool.put(ObjectsPool.ART_NODE_48, node48); - } - - - @Override - @SuppressWarnings("unchecked") - public V getValue(final long key, final int level) { - if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { - return null; - } - final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); - for (int i = 0; i < numChildren; i++) { - final short index = keys[i]; - if (index == nodeIndex) { - final Object node = nodes[i]; - return nodeLevel == 0 - ? (V) node - : ((IArtNode) node).getValue(key, nodeLevel - 8); - } - if (nodeIndex < index) { - // can give up searching because keys are in sorted order - break; - } - } - return null; - } - - @Override - @SuppressWarnings("unchecked") - public IArtNode put(final long key, final int level, final V value) { - if (level != nodeLevel) { - final IArtNode branch = LongAdaptiveRadixTreeMap.branchIfRequired(key, value, nodeKey, nodeLevel, this); - if (branch != null) { - return branch; - } - } - final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); - int pos = 0; - while (pos < numChildren) { - if (nodeIndex == keys[pos]) { - // just update - if (nodeLevel == 0) { - nodes[pos] = value; - } else { - final IArtNode resizedNode = ((IArtNode) nodes[pos]).put(key, nodeLevel - 8, value); - if (resizedNode != null) { - // TODO put old into the pool - // update resized node if capacity has increased - nodes[pos] = resizedNode; - } - } - return null; - } - if (nodeIndex < keys[pos]) { - // can give up searching because keys are in sorted order - break; - } - pos++; - } - - // not found, put new element - if (numChildren != 16) { - // capacity less than 16 - can simply insert node - final int copyLength = numChildren - pos; - if (copyLength != 0) { - System.arraycopy(keys, pos, keys, pos + 1, copyLength); - System.arraycopy(nodes, pos, nodes, pos + 1, copyLength); - } - keys[pos] = nodeIndex; - if (nodeLevel == 0) { - nodes[pos] = value; - } else { - final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); - newSubNode.initFirstKey(key, value); - nodes[pos] = newSubNode; - newSubNode.put(key, nodeLevel - 8, value); - } - numChildren++; - return null; - } else { - // no space left, create a Node48 with new element - final Object newElement; - if (nodeLevel == 0) { - newElement = value; - } else { - final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); - newSubNode.initFirstKey(key, value); - newElement = newSubNode; - } - - ArtNode48 node48 = objectsPool.get(ObjectsPool.ART_NODE_48, ArtNode48::new); - node48.initFromNode16(this, nodeIndex, newElement); - - return node48; - } - } - - @Override - @SuppressWarnings("unchecked") - public IArtNode remove(long key, int level) { - if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { - return this; - } - final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); - Object node = null; - int pos = 0; - while (pos < numChildren) { - if (nodeIndex == keys[pos]) { - // found - node = nodes[pos]; - break; - } - if (nodeIndex < keys[pos]) { - // can give up searching because keys are in sorted order - return this; - } - pos++; - } - - if (node == null) { - // not found - return this; - } - - // removing - if (nodeLevel == 0) { - removeElementAtPos(pos); - } else { - final IArtNode resizedNode = ((IArtNode) node).remove(key, nodeLevel - 8); - if (resizedNode != node) { - // update resized node if capacity has decreased - nodes[pos] = resizedNode; - if (resizedNode == null) { - removeElementAtPos(pos); - } - } - } - - // switch to ArtNode4 if too small - if (numChildren == NODE4_SWITCH_THRESHOLD) { - final ArtNode4 newNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); - newNode.initFromNode16(this); - return newNode; - } else { - return this; - } - } - - @Override - @SuppressWarnings("unchecked") - public V getCeilingValue(long key, int level) { -// log.debug("key = {}", String.format("%Xh", key)); -// log.debug("level={} nodeLevel={} nodekey={} looking for key={} mask={}", -// level, nodeLevel, String.format("%Xh", nodeKey), String.format("%Xh", key), String.format("%Xh", mask)); -// -// log.debug("key & mask = {} > nodeKey & mask = {}", -// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); - - // special processing for compacted nodes - if ((level != nodeLevel)) { - // try first - final long mask = -1L << (nodeLevel + 8); - final long keyWithMask = key & mask; - final long nodeKeyWithMask = nodeKey & mask; - if (nodeKeyWithMask < keyWithMask) { - // compacted part is lower - no need to search for ceiling entry here - return null; - } else if (keyWithMask != nodeKeyWithMask) { - // can reset key, because compacted nodekey is higher - key = 0; - } - } - - final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); - - for (int i = 0; i < numChildren; i++) { - final short index = keys[i]; -// log.debug("try index={} (looking for {}) key={}", String.format("%X", index), String.format("%X", nodeIndex), String.format("%X", key)); - // any equal or higher is ok - if (index == nodeIndex) { - final V res = nodeLevel == 0 - ? (V) nodes[i] - : ((IArtNode) nodes[i]).getCeilingValue(key, nodeLevel - 8); - if (res != null) { - // return if found ceiling, otherwise will try next one - return res; - } - } - if (index > nodeIndex) { - // exploring first higher key - return nodeLevel == 0 - ? (V) nodes[i] - : ((IArtNode) nodes[i]).getCeilingValue(0, nodeLevel - 8); // take lowest existing key - } - } - return null; - } - - - @Override - @SuppressWarnings("unchecked") - public V getFloorValue(long key, int level) { - // log.debug("key = {}", String.format("%Xh", key)); -// log.debug("level={} nodeLevel={} nodekey={} looking for key={} mask={}", -// level, nodeLevel, String.format("%Xh", nodeKey), String.format("%Xh", key), String.format("%Xh", mask)); - - // special processing for compacted nodes - if ((level != nodeLevel)) { - // try first - final long mask = -1L << (nodeLevel + 8); -// log.debug("key & mask = {} > nodeKey & mask = {}", -// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); - final long keyWithMask = key & mask; - final long nodeKeyWithMask = nodeKey & mask; - if (nodeKeyWithMask > keyWithMask) { - // compacted part is higher - no need to search for floor entry here - return null; - } else if (keyWithMask != nodeKeyWithMask) { - // find highest value, because compacted nodekey is lower - key = Long.MAX_VALUE; - } - } - - final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); - - for (int i = numChildren - 1; i >= 0; i--) { - final short index = keys[i]; - if (index == nodeIndex) { - final V res = nodeLevel == 0 - ? (V) nodes[i] - : ((IArtNode) nodes[i]).getFloorValue(key, nodeLevel - 8); - if (res != null) { - // return if found ceiling, otherwise will try next one - return res; - } - } - if (index < nodeIndex) { - // exploring first lower key - return nodeLevel == 0 - ? (V) nodes[i] - : ((IArtNode) nodes[i]).getFloorValue(Long.MAX_VALUE, nodeLevel - 8); // take highest existing key - } - } - return null; - } - - @Override - @SuppressWarnings("unchecked") - public int forEach(LongObjConsumer consumer, int limit) { - if (nodeLevel == 0) { - final long keyBase = (nodeKey >>> 8) << 8; - final int n = Math.min(numChildren, limit); - for (int i = 0; i < n; i++) { - consumer.accept(keyBase + keys[i], (V) nodes[i]); - } - return n; - } else { - int numLeft = limit; - for (int i = 0; i < numChildren && numLeft > 0; i++) { - numLeft -= ((IArtNode) nodes[i]).forEach(consumer, numLeft); - } - return limit - numLeft; - } - } - - @Override - @SuppressWarnings("unchecked") - public int forEachDesc(LongObjConsumer consumer, int limit) { - if (nodeLevel == 0) { - final long keyBase = (nodeKey >>> 8) << 8; - int numFound = 0; - for (int i = numChildren - 1; i >= 0 && numFound < limit; i--) { - consumer.accept(keyBase + keys[i], (V) nodes[i]); - numFound++; - } - return numFound; - } else { - int numLeft = limit; - for (int i = numChildren - 1; i >= 0 && numLeft > 0; i--) { - numLeft -= ((IArtNode) nodes[i]).forEachDesc(consumer, numLeft); - } - return limit - numLeft; - } - } - - @Override - @SuppressWarnings("unchecked") - public int size(int limit) { - if (nodeLevel == 0) { - return numChildren; - } else { - int numLeft = limit; - for (int i = numChildren - 1; i >= 0 && numLeft > 0; i--) { - numLeft -= ((IArtNode) nodes[i]).size(numLeft); - } - return limit - numLeft; - } - } - - @Override - public void validateInternalState(int level) { - if (nodeLevel > level) throw new IllegalStateException("unexpected nodeLevel"); - if (numChildren > 16 || numChildren <= NODE4_SWITCH_THRESHOLD) - throw new IllegalStateException("unexpected numChildren"); - short last = -1; - for (int i = 0; i < 16; i++) { - Object node = nodes[i]; - if (i < numChildren) { - if (node == null) throw new IllegalStateException("null node"); - if (keys[i] < 0 || keys[i] >= 256) throw new IllegalStateException("key out of range"); - if (keys[i] == last) throw new IllegalStateException("duplicate key"); - if (keys[i] < last) throw new IllegalStateException("wrong key order"); - last = keys[i]; - if (node instanceof IArtNode) { - if (nodeLevel == 0) throw new IllegalStateException("unexpected node type"); - IArtNode artNode = (IArtNode) node; - artNode.validateInternalState(nodeLevel - 8); - } else { - if (nodeLevel != 0) throw new IllegalStateException("unexpected node type"); - } - - } else { - if (node != null) throw new IllegalStateException("not released node"); - } - } - } - - @Override - public String printDiagram(String prefix, int level) { - return LongAdaptiveRadixTreeMap.printDiagram(prefix, level, nodeLevel, nodeKey, numChildren, idx -> keys[idx], idx -> nodes[idx]); - } - - @Override - @SuppressWarnings("unchecked") - public List> entries() { - final long keyPrefix = nodeKey & (-1L << 8); - final List> list = new ArrayList<>(); - for (int i = 0; i < numChildren; i++) { - if (nodeLevel == 0) { - list.add(new LongAdaptiveRadixTreeMap.Entry<>(keyPrefix + keys[i], (V) nodes[i])); - } else { - list.addAll(((IArtNode) nodes[i]).entries()); - } - } - return list; - } - - private void removeElementAtPos(final int pos) { - final int ppos = pos + 1; - final int copyLength = numChildren - ppos; - if (copyLength != 0) { - System.arraycopy(keys, ppos, keys, pos, copyLength); - System.arraycopy(nodes, ppos, nodes, pos, copyLength); - } - numChildren--; - nodes[numChildren] = null; - } - - @Override - public ObjectsPool getObjectsPool() { - return objectsPool; - } - - @Override - public String toString() { - return "ArtNode16{" + - "nodeKey=" + nodeKey + - ", nodeLevel=" + nodeLevel + - ", numChildren=" + numChildren + - '}'; - } -} diff --git a/src/main/java/exchange/core2/collections/art/ArtNode256.java b/src/main/java/exchange/core2/collections/art/ArtNode256.java deleted file mode 100644 index 5b3325b58..000000000 --- a/src/main/java/exchange/core2/collections/art/ArtNode256.java +++ /dev/null @@ -1,397 +0,0 @@ -/* - * Copyright 2019-2020 Maksim Zheravin - * - * Licensed under the Apache License, Version 2.0 (the "License"); - * you may not use this file except in compliance with the License. - * You may obtain a copy of the License at - * - * http://www.apache.org/licenses/LICENSE-2.0 - * - * Unless required by applicable law or agreed to in writing, software - * distributed under the License is distributed on an "AS IS" BASIS, - * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. - * See the License for the specific language governing permissions and - * limitations under the License. - */ -package exchange.core2.collections.art; - -import exchange.core2.collections.objpool.ObjectsPool; - -import java.util.ArrayList; -import java.util.Arrays; -import java.util.List; -import java.util.Map; - - -/** - * The largest node type is simply an array of 256 - * pointers and is used for storing between 49 and 256 entries. - * With this representation, the next node can be found very - * efficiently using a single lookup of the key byte in that array. - * No additional indirection is necessary. If most entries are not - * null, this representation is also very space efficient because - * only pointers need to be stored. - */ -public final class ArtNode256 implements IArtNode { - - private static final int NODE48_SWITCH_THRESHOLD = 37; - - // direct addressing - final Object[] nodes = new Object[256]; - - long nodeKey; - int nodeLevel; - short numChildren; - - private final ObjectsPool objectsPool; - - public ArtNode256(ObjectsPool objectsPool) { - this.objectsPool = objectsPool; - } - - void initFromNode48(ArtNode48 artNode48, short subKey, Object newElement) { - - this.nodeLevel = artNode48.nodeLevel; - this.nodeKey = artNode48.nodeKey; - final int sourceSize = 48; - for (short i = 0; i < 256; i++) { - final byte index = artNode48.indexes[i]; - if (index != -1) { - this.nodes[i] = artNode48.nodes[index]; - } - } - this.nodes[subKey] = newElement; - this.numChildren = sourceSize + 1; - - Arrays.fill(artNode48.nodes, null); - Arrays.fill(artNode48.indexes, (byte) -1); - objectsPool.put(ObjectsPool.ART_NODE_48, artNode48); - } - - @Override - @SuppressWarnings("unchecked") - public V getValue(final long key, final int level) { - if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { - return null; - } - final short idx = (short) ((key >>> nodeLevel) & 0xFF); - final Object node = nodes[idx]; - if (node != null) { - return nodeLevel == 0 - ? (V) node - : ((IArtNode) node).getValue(key, nodeLevel - 8); - } - return null; - } - - @Override - @SuppressWarnings("unchecked") - public IArtNode put(final long key, final int level, final V value) { - if (level != nodeLevel) { - final IArtNode branch = LongAdaptiveRadixTreeMap.branchIfRequired(key, value, nodeKey, nodeLevel, this); - if (branch != null) { - return branch; - } - } - final short idx = (short) ((key >>> nodeLevel) & 0xFF); - if (nodes[idx] == null) { - // new object will be inserted - numChildren++; - } - - if (nodeLevel == 0) { - nodes[idx] = value; - } else { - IArtNode node = (IArtNode) nodes[idx]; - if (node != null) { - final IArtNode resizedNode = node.put(key, nodeLevel - 8, value); - if (resizedNode != null) { - // TODO put old into the pool - // update resized node if capacity has increased - nodes[idx] = resizedNode; - } - } else { - final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); - newSubNode.initFirstKey(key, value); - nodes[idx] = newSubNode; - } - } - - // never need to increase the size - return null; - } - - @Override - @SuppressWarnings("unchecked") - public IArtNode remove(long key, int level) { - if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { - return this; - } - final short idx = (short) ((key >>> nodeLevel) & 0xFF); - if (nodes[idx] == null) { - return this; - } - - if (nodeLevel == 0) { - nodes[idx] = null; - numChildren--; - } else { - final IArtNode node = (IArtNode) nodes[idx]; - final IArtNode resizedNode = node.remove(key, nodeLevel - 8); - if (resizedNode != node) { - // TODO put old into the pool - // update resized node if capacity has decreased - nodes[idx] = resizedNode; - if (resizedNode == null) { - numChildren--; - } - } - } - - if (numChildren == NODE48_SWITCH_THRESHOLD) { - final ArtNode48 newNode = objectsPool.get(ObjectsPool.ART_NODE_48, ArtNode48::new); - newNode.initFromNode256(this); - return newNode; - } else { - return this; - } - } - - @Override - @SuppressWarnings("unchecked") - public V getCeilingValue(long key, int level) { -// log.debug("key = {}", String.format("%Xh", key)); - // special processing for compacted nodes - if ((level != nodeLevel)) { - // try first - final long mask = -1L << (nodeLevel + 8); -// log.debug("key & mask = {} > nodeKey & mask = {}", String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); - final long keyWithMask = key & mask; - final long nodeKeyWithMask = nodeKey & mask; - if (nodeKeyWithMask < keyWithMask) { - // compacted part is lower - no need to search for ceiling entry here - return null; - } else if (keyWithMask != nodeKeyWithMask) { - // find first lowest key, because compacted nodekey is higher - key = 0; - } - } - - short idx = (short) ((key >>> nodeLevel) & 0xFF); - Object node = nodes[idx]; - if (node != null) { - // if exact key found - final V res = nodeLevel == 0 ? (V) node : ((IArtNode) node).getCeilingValue(key, nodeLevel - 8); - if (res != null) { - // return if found ceiling, otherwise will try next one - return res; - } - } - - // if exact key not found - searching for first higher key - while (++idx < 256) { -// log.debug("idx+ = {}", String.format("%Xh", idx)); - node = nodes[idx]; - if (node != null) { - return (nodeLevel == 0) - ? (V) node - : ((IArtNode) node).getCeilingValue(0, nodeLevel - 8);// find first lowest key - } - } - // no keys found - return null; - } - - @Override - @SuppressWarnings("unchecked") - public V getFloorValue(long key, int level) { - // log.debug("key = {}", String.format("%Xh", key)); - // special processing for compacted nodes - if ((level != nodeLevel)) { - // try first - final long mask = -1L << (nodeLevel + 8); -// log.debug("key & mask = {} > nodeKey & mask = {}", -// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); - final long keyWithMask = key & mask; - final long nodeKeyWithMask = nodeKey & mask; - if (nodeKeyWithMask > keyWithMask) { - // compacted part is higher - no need to search for floor entry here - return null; - } else if (keyWithMask != nodeKeyWithMask) { - // find highest value, because compacted nodekey is lower - key = Long.MAX_VALUE; - } - } - - short idx = (short) ((key >>> nodeLevel) & 0xFF); - Object node = nodes[idx]; - if (node != null) { - // if exact key found - final V res = nodeLevel == 0 ? (V) node : ((IArtNode) node).getFloorValue(key, nodeLevel - 8); - if (res != null) { - // return if found floor, otherwise will try prev one - return res; - } - } - - // if exact key not found - searching for first lower key - while (--idx >= 0) { -// log.debug("idx+ = {}", String.format("%Xh", idx)); - node = nodes[idx]; - if (node != null) { - return (nodeLevel == 0) - ? (V) node - : ((IArtNode) node).getFloorValue(Long.MAX_VALUE, nodeLevel - 8);// find first highest key - } - } - // no keys found - return null; - } - - @Override - @SuppressWarnings("unchecked") - public int forEach(LongObjConsumer consumer, int limit) { - if (nodeLevel == 0) { - final long keyBase = (nodeKey >>> 8) << 8; - int numFound = 0; - for (short i = 0; i < 256; i++) { - if (numFound == limit) { - return numFound; - } - final V node = (V) nodes[i]; - if (node != null) { - consumer.accept(keyBase + i, node); - numFound++; - } - } - return numFound; - } else { - int numLeft = limit; - for (short i = 0; i < 256 && numLeft > 0; i++) { - final IArtNode node = (IArtNode) nodes[i]; - if (node != null) { - numLeft -= node.forEach(consumer, numLeft); - } - } - return limit - numLeft; - } - } - - @Override - @SuppressWarnings("unchecked") - public int forEachDesc(LongObjConsumer consumer, int limit) { - if (nodeLevel == 0) { - final long keyBase = (nodeKey >>> 8) << 8; - int numFound = 0; - for (short i = 255; i >= 0; i--) { - if (numFound == limit) { - return numFound; - } - final V node = (V) nodes[i]; - if (node != null) { - consumer.accept(keyBase + i, node); - numFound++; - } - } - return numFound; - } else { - int numLeft = limit; - for (short i = 255; i >= 0 && numLeft > 0; i--) { - final IArtNode node = (IArtNode) nodes[i]; - if (node != null) { - numLeft -= node.forEachDesc(consumer, numLeft); - } - } - return limit - numLeft; - } - } - - @Override - @SuppressWarnings("unchecked") - public int size(int limit) { - if (nodeLevel == 0) { - return numChildren; - } else { - int numLeft = limit; - for (short i = 0; i < 256 && numLeft > 0; i++) { - final IArtNode node = (IArtNode) nodes[i]; - if (node != null) { - numLeft -= node.size(numLeft); - } - } - return limit - numLeft; - } - } - - @Override - public void validateInternalState(int level) { - if (nodeLevel > level) throw new IllegalStateException("unexpected nodeLevel"); - int found = 0; - for (int i = 0; i < 256; i++) { - Object node = nodes[i]; - if (node != null) { - if (node instanceof IArtNode) { - if (nodeLevel == 0) throw new IllegalStateException("unexpected node type"); - IArtNode artNode = (IArtNode) node; - artNode.validateInternalState(nodeLevel - 8); - } else { - if (nodeLevel != 0) throw new IllegalStateException("unexpected node type"); - } - found++; - } - } - if (found != numChildren) { - throw new IllegalStateException("wrong numChildren"); - } - if (numChildren <= NODE48_SWITCH_THRESHOLD || numChildren > 256) { - throw new IllegalStateException("unexpected numChildren"); - } - } - - @Override - @SuppressWarnings("unchecked") - public List> entries() { - final long keyPrefix = nodeKey & (-1L << 8); - final List> list = new ArrayList<>(); - final short[] keys = createKeysArray(); - for (int i = 0; i < numChildren; i++) { - if (nodeLevel == 0) { - list.add(new LongAdaptiveRadixTreeMap.Entry<>(keyPrefix + keys[i], (V) nodes[keys[i]])); - } else { - list.addAll(((IArtNode) nodes[keys[i]]).entries()); - } - } - return list; - } - - @Override - public String printDiagram(String prefix, int level) { - final short[] keys = createKeysArray(); - return LongAdaptiveRadixTreeMap.printDiagram(prefix, level, nodeLevel, nodeKey, numChildren, idx -> keys[idx], idx -> nodes[keys[idx]]); - } - - @Override - public ObjectsPool getObjectsPool() { - return objectsPool; - } - - @Override - public String toString() { - return "ArtNode256{" + - "nodeKey=" + nodeKey + - ", nodeLevel=" + nodeLevel + - ", numChildren=" + numChildren + - '}'; - } - - private short[] createKeysArray() { - short[] keys = new short[numChildren]; - int j = 0; - for (short i = 0; i < 256; i++) { - if (nodes[i] != null) { - keys[j++] = i; - } - } - return keys; - } -} \ No newline at end of file diff --git a/src/main/java/exchange/core2/collections/art/ArtNode4.java b/src/main/java/exchange/core2/collections/art/ArtNode4.java deleted file mode 100644 index 7ddc20da9..000000000 --- a/src/main/java/exchange/core2/collections/art/ArtNode4.java +++ /dev/null @@ -1,492 +0,0 @@ -/* - * Copyright 2019-2020 Maksim Zheravin - * - * Licensed under the Apache License, Version 2.0 (the "License"); - * you may not use this file except in compliance with the License. - * You may obtain a copy of the License at - * - * http://www.apache.org/licenses/LICENSE-2.0 - * - * Unless required by applicable law or agreed to in writing, software - * distributed under the License is distributed on an "AS IS" BASIS, - * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. - * See the License for the specific language governing permissions and - * limitations under the License. - */ -package exchange.core2.collections.art; - -import exchange.core2.collections.objpool.ObjectsPool; - -import java.util.ArrayList; -import java.util.Arrays; -import java.util.List; -import java.util.Map; - -/** - * The smallest node type can store up to 4 child - * pointers and uses an array of length 4 for keys and another - * array of the same length for pointers. The keys and pointers - * are stored at corresponding positions and the keys are sorted. - */ -public final class ArtNode4 implements IArtNode { - - // keys are ordered - final short[] keys = new short[4]; - final Object[] nodes = new Object[4]; - - private final ObjectsPool objectsPool; - - long nodeKey; - int nodeLevel; - - byte numChildren; - - public ArtNode4(ObjectsPool objectsPool) { - this.objectsPool = objectsPool; - } - - // terminal node has always nodeLevel=0 - void initFirstKey(final long key, final V value) { - // create compact node - this.numChildren = 1; - this.keys[0] = (short) (key & 0xFF); - //this.nodes[0] = (level == 0) ? value : new ArtNode4<>(key, level - 8, value); - this.nodes[0] = value; - this.nodeKey = key; - this.nodeLevel = 0; - } - - // split-compact operation constructor - void initTwoKeys(final long key1, final Object value1, final long key2, final Object value2, final int level) { -// log.debug("new level={} key1={} key2={}", level, key1, key2); - // create compact node - this.numChildren = 2; - final short idx1 = (short) ((key1 >> level) & 0xFF); - final short idx2 = (short) ((key2 >> level) & 0xFF); - // ! smallest key first - if (key1 < key2) { - this.keys[0] = idx1; - this.nodes[0] = value1; - this.keys[1] = idx2; - this.nodes[1] = value2; - } else { - this.keys[0] = idx2; - this.nodes[0] = value2; - this.keys[1] = idx1; - this.nodes[1] = value1; - } - this.nodeKey = key1; // leading part the same for both keys - this.nodeLevel = level; - } - - // downsize 16->4 - void initFromNode16(ArtNode16 artNode16) { - // put original node back into pool - objectsPool.put(ObjectsPool.ART_NODE_16, artNode16); - - this.numChildren = artNode16.numChildren; - System.arraycopy(artNode16.keys, 0, this.keys, 0, numChildren); - System.arraycopy(artNode16.nodes, 0, this.nodes, 0, numChildren); - this.nodeLevel = artNode16.nodeLevel; - this.nodeKey = artNode16.nodeKey; - - Arrays.fill(artNode16.nodes, null); - } - - @Override - @SuppressWarnings("unchecked") - public V getValue(final long key, final int level) { - - if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { - return null; - } - final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); - - for (int i = 0; i < numChildren; i++) { - final short index = keys[i]; - if (index == nodeIndex) { - final Object node = nodes[i]; - return nodeLevel == 0 - ? (V) node - : ((IArtNode) node).getValue(key, nodeLevel - 8); - } - if (nodeIndex < index) { - // can give up searching because keys are in sorted order - break; - } - } - return null; - } - - @Override - @SuppressWarnings("unchecked") - public IArtNode put(final long key, final int level, final V value) { - -// log.debug(" ------ PUT {}", String.format("%X", key)); -// log.debug("level={} nodeLevel={}", level, nodeLevel); -// log.debug("key={} nodeKey={}", key, nodeKey); - - if (level != nodeLevel) { - final IArtNode branch = LongAdaptiveRadixTreeMap.branchIfRequired(key, value, nodeKey, nodeLevel, this); - if (branch != null) { - return branch; - } - } - -// log.debug("PUT key:{} level:{} value:{}", key, level, value); - - final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); - int pos = 0; - while (pos < numChildren) { - if (nodeIndex == keys[pos]) { - // just update - if (nodeLevel == 0) { - nodes[pos] = value; - } else { - final IArtNode resizedNode = ((IArtNode) nodes[pos]).put(key, nodeLevel - 8, value); - if (resizedNode != null) { - // update resized node if capacity has increased - nodes[pos] = resizedNode; - } - } - return null; - } - if (nodeIndex < keys[pos]) { - // can give up searching because keys are in sorted order - break; - } - pos++; - } - -// log.debug("pos:{}", pos); - - // new element - if (numChildren != 4) { - // capacity less than 4 - can simply insert node - final int copyLength = numChildren - pos; - if (copyLength != 0) { - System.arraycopy(keys, pos, keys, pos + 1, copyLength); - System.arraycopy(nodes, pos, nodes, pos + 1, copyLength); - } - keys[pos] = nodeIndex; - if (nodeLevel == 0) { - nodes[pos] = value; - } else { - final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); - newSubNode.initFirstKey(key, value); - nodes[pos] = newSubNode; - } - numChildren++; - return null; - } else { - // no space left, create a Node16 with new item - final Object newElement; - if (nodeLevel == 0) { - newElement = value; - } else { - final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); - newSubNode.initFirstKey(key, value); - newElement = newSubNode; - } - - ArtNode16 node16 = objectsPool.get(ObjectsPool.ART_NODE_16, ArtNode16::new); - node16.initFromNode4(this, nodeIndex, newElement); - - return node16; - } - } - - @Override - public String toString() { - return "ArtNode4{" + - "nodeKey=" + nodeKey + - ", nodeLevel=" + nodeLevel + - ", numChildren=" + numChildren + - '}'; - } - - @Override - @SuppressWarnings("unchecked") - public IArtNode remove(long key, int level) { - -// String prefix = StringUtils.repeat(" ", (56 - level) / 4); -// log.debug(prefix + " ------ REMOVE {}", String.format("%X", key)); - // 56 48 40 32 24 16 8 0 - // rem key 00 00 11 22 33 44 55 66 - -// log.debug(prefix + "level={} nodeLevel={}", level, nodeLevel); -// log.debug(prefix + "key={} nodeKey={}", key, nodeKey); - - - if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { - return this; - } - final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); - Object node = null; - int pos = 0; - while (pos < numChildren) { - if (nodeIndex == keys[pos]) { - // found - node = nodes[pos]; - break; - } - pos++; - } - - if (node == null) { - // not found - return this; - } - - // removing - if (nodeLevel == 0) { - removeElementAtPos(pos); - } else { - final IArtNode resizedNode = ((IArtNode) node).remove(key, nodeLevel - 8); - if (resizedNode != node) { - // TODO put old into the pool - // update resized node if capacity has decreased - nodes[pos] = resizedNode; - if (resizedNode == null) { - removeElementAtPos(pos); - if (numChildren == 1) { -// log.debug(prefix + "CAN MERGE! nodeLevel={} level={}", nodeLevel, level); - // todo put 'this' into pul - IArtNode lastNode = (IArtNode) nodes[0]; - // lastNode.setNodeLevel(nodeLevel); - return lastNode; - } - } - } - } - - if (numChildren == 0) { - // indicate if removed last one - Arrays.fill(nodes, null); - objectsPool.put(ObjectsPool.ART_NODE_4, this); - return null; - } else { - return this; - } - } - - @Override - @SuppressWarnings("unchecked") - public V getCeilingValue(long key, int level) { -// log.debug("key = {}", String.format("%Xh", key)); -// log.debug("level={} nodeLevel={} nodekey={} looking for key={} mask={}", -// level, nodeLevel, String.format("%Xh", nodeKey), String.format("%Xh", key), String.format("%Xh", mask)); - - // special processing for compacted nodes - if ((level != nodeLevel)) { - // try first - final long mask = -1L << (nodeLevel + 8); -// log.debug("key & mask = {} > nodeKey & mask = {}", -// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); - final long keyWithMask = key & mask; - final long nodeKeyWithMask = nodeKey & mask; - if (nodeKeyWithMask < keyWithMask) { - // compacted part is lower - no need to search for ceiling entry here - return null; - } else if (keyWithMask != nodeKeyWithMask) { - // accept first existing entry, because compacted nodekey is higher - key = 0; - } - } - - final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); - - for (int i = 0; i < numChildren; i++) { - final short index = keys[i]; -// log.debug("try index={} (looking for {}) key={}", String.format("%X", index), String.format("%X", nodeIndex), String.format("%X", key)); - // any equal or higher is ok - if (index == nodeIndex) { - final V res = nodeLevel == 0 - ? (V) nodes[i] - : ((IArtNode) nodes[i]).getCeilingValue(key, nodeLevel - 8); - if (res != null) { - // return if found ceiling, otherwise will try next one - return res; - } - } - if (index > nodeIndex) { - // exploring first higher key - return nodeLevel == 0 - ? (V) nodes[i] - : ((IArtNode) nodes[i]).getCeilingValue(0, nodeLevel - 8); // take lowest existing key - } - } - return null; - } - - @Override - @SuppressWarnings("unchecked") - public V getFloorValue(long key, int level) { - // log.debug("key = {}", String.format("%Xh", key)); -// log.debug("level={} nodeLevel={} nodekey={} looking for key={} mask={}", -// level, nodeLevel, String.format("%Xh", nodeKey), String.format("%Xh", key), String.format("%Xh", mask)); - - // special processing for compacted nodes - if ((level != nodeLevel)) { - // try first - final long mask = -1L << (nodeLevel + 8); -// log.debug("key & mask = {} > nodeKey & mask = {}", -// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); - final long keyWithMask = key & mask; - final long nodeKeyWithMask = nodeKey & mask; - if (nodeKeyWithMask > keyWithMask) { - // compacted part is higher - no need to search for floor entry here - return null; - } else if (keyWithMask != nodeKeyWithMask) { - // find highest value, because compacted nodekey is lower - key = Long.MAX_VALUE; - } - } - - final short nodeIndex = (short) ((key >>> nodeLevel) & 0xFF); - - for (int i = numChildren - 1; i >= 0; i--) { - final short index = keys[i]; - if (index == nodeIndex) { - final V res = nodeLevel == 0 - ? (V) nodes[i] - : ((IArtNode) nodes[i]).getFloorValue(key, nodeLevel - 8); - if (res != null) { - // return if found ceiling, otherwise will try next one - return res; - } - } - if (index < nodeIndex) { - // exploring first lower key - return nodeLevel == 0 - ? (V) nodes[i] - : ((IArtNode) nodes[i]).getFloorValue(Long.MAX_VALUE, nodeLevel - 8); // take highest existing key - } - } - return null; - } - - @Override - @SuppressWarnings("unchecked") - public int forEach(LongObjConsumer consumer, int limit) { - if (nodeLevel == 0) { - final long keyBase = (nodeKey >>> 8) << 8; - final int n = Math.min(numChildren, limit); - for (int i = 0; i < n; i++) { - consumer.accept(keyBase + keys[i], (V) nodes[i]); - } - return n; - } else { - int numLeft = limit; - for (int i = 0; i < numChildren && numLeft > 0; i++) { - numLeft -= ((IArtNode) nodes[i]).forEach(consumer, numLeft); - } - return limit - numLeft; - } - } - - @Override - @SuppressWarnings("unchecked") - public int forEachDesc(LongObjConsumer consumer, int limit) { - if (nodeLevel == 0) { - final long keyBase = (nodeKey >>> 8) << 8; - int numFound = 0; - for (int i = numChildren - 1; i >= 0 && numFound < limit; i--) { - consumer.accept(keyBase + keys[i], (V) nodes[i]); - numFound++; - } - return numFound; - } else { - int numLeft = limit; - for (int i = numChildren - 1; i >= 0 && numLeft > 0; i--) { - numLeft -= ((IArtNode) nodes[i]).forEachDesc(consumer, numLeft); - } - return limit - numLeft; - } - } - - @Override - @SuppressWarnings("unchecked") - public int size(int limit) { - if (nodeLevel == 0) { - return numChildren; - } else { - int numLeft = limit; - for (int i = numChildren - 1; i >= 0 && numLeft > 0; i--) { - numLeft -= ((IArtNode) nodes[i]).size(numLeft); - } - return limit - numLeft; - } - } - - private void removeElementAtPos(final int pos) { - final int ppos = pos + 1; - final int copyLength = numChildren - ppos; - if (copyLength != 0) { - System.arraycopy(keys, ppos, keys, pos, copyLength); - System.arraycopy(nodes, ppos, nodes, pos, copyLength); - } - numChildren--; - nodes[numChildren] = null; - } - - @Override - public void validateInternalState(int level) { - if (nodeLevel > level) throw new IllegalStateException("unexpected nodeLevel"); - if (numChildren > 4 || numChildren < 1) throw new IllegalStateException("unexpected numChildren"); - short last = -1; - for (int i = 0; i < 4; i++) { - Object node = nodes[i]; - if (i < numChildren) { - if (node == null) throw new IllegalStateException("null node"); - if (keys[i] < 0 || keys[i] >= 256) throw new IllegalStateException("key out of range"); - if (keys[i] == last) throw new IllegalStateException("duplicate key"); - if (keys[i] < last) throw new IllegalStateException("wrong key order"); - last = keys[i]; - if (node instanceof IArtNode) { - if (nodeLevel == 0) throw new IllegalStateException("unexpected node type"); - IArtNode artNode = (IArtNode) node; - artNode.validateInternalState(nodeLevel - 8); - } else { - if (nodeLevel != 0) throw new IllegalStateException("unexpected node type"); - } - - } else { - if (node != null) throw new IllegalStateException("not released node"); - } - - } - - } - - @Override - public String printDiagram(String prefix, int level) { -// log.debug(">>>> {} level={} nodelevel={} nodekey={}", prefix, level, nodeLevel, nodeKey); - - - return LongAdaptiveRadixTreeMap.printDiagram(prefix, level, nodeLevel, nodeKey, numChildren, - idx -> keys[idx], idx -> nodes[idx]); - } - - @Override - @SuppressWarnings("unchecked") - public List> entries() { - final long keyPrefix = nodeKey & (-1L << 8); - - final List> list = new ArrayList<>(); - for (int i = 0; i < numChildren; i++) { - if (nodeLevel == 0) { - list.add(new LongAdaptiveRadixTreeMap.Entry<>(keyPrefix + keys[i], (V) nodes[i])); - } else { - list.addAll(((IArtNode) nodes[i]).entries()); - } - } - return list; - } - - @Override - public ObjectsPool getObjectsPool() { - return objectsPool; - } - -} diff --git a/src/main/java/exchange/core2/collections/art/ArtNode48.java b/src/main/java/exchange/core2/collections/art/ArtNode48.java deleted file mode 100644 index 0b897928c..000000000 --- a/src/main/java/exchange/core2/collections/art/ArtNode48.java +++ /dev/null @@ -1,483 +0,0 @@ -/* - * Copyright 2019-2020 Maksim Zheravin - * - * Licensed under the Apache License, Version 2.0 (the "License"); - * you may not use this file except in compliance with the License. - * You may obtain a copy of the License at - * - * http://www.apache.org/licenses/LICENSE-2.0 - * - * Unless required by applicable law or agreed to in writing, software - * distributed under the License is distributed on an "AS IS" BASIS, - * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. - * See the License for the specific language governing permissions and - * limitations under the License. - */ -package exchange.core2.collections.art; - -import exchange.core2.collections.objpool.ObjectsPool; - -import java.util.*; - -/** - * As the number of entries in a node increases, - * searching the key array becomes expensive. Therefore, nodes - * with more than 16 pointers do not store the keys explicitly. - * Instead, a 256-element array is used, which can be indexed - * with key bytes directly. If a node has between 17 and 48 child - * pointers, this array stores indexes into a second array which - * contains up to 48 pointers. This indirection saves space in - * comparison to 256 pointers of 8 bytes, because the indexes - * only require 6 bits (we use 1 byte for simplicity). - */ -public final class ArtNode48 implements IArtNode { - - private static final int NODE16_SWITCH_THRESHOLD = 12; - - // just keep indexes - final byte[] indexes = new byte[256]; - final Object[] nodes = new Object[48]; - private long freeBitMask; - - long nodeKey; - int nodeLevel; - - byte numChildren; - - private final ObjectsPool objectsPool; - - public ArtNode48(ObjectsPool objectsPool) { - this.objectsPool = objectsPool; - } - - void initFromNode16(ArtNode16 node16, short subKey, Object newElement) { - - final byte sourceSize = 16; - Arrays.fill(this.indexes, (byte) -1); - this.numChildren = sourceSize + 1; - this.nodeLevel = node16.nodeLevel; - this.nodeKey = node16.nodeKey; - - for (byte i = 0; i < sourceSize; i++) { - this.indexes[node16.keys[i]] = i; - this.nodes[i] = node16.nodes[i]; - } - - this.indexes[subKey] = sourceSize; - this.nodes[sourceSize] = newElement; - this.freeBitMask = (1L << (sourceSize + 1)) - 1; - - Arrays.fill(node16.nodes, null); - objectsPool.put(ObjectsPool.ART_NODE_16, node16); - } - - void initFromNode256(ArtNode256 node256) { - Arrays.fill(this.indexes, (byte) -1); - this.numChildren = (byte) node256.numChildren; - this.nodeLevel = node256.nodeLevel; - this.nodeKey = node256.nodeKey; - byte idx = 0; - for (int i = 0; i < 256; i++) { - Object node = node256.nodes[i]; - if (node != null) { - this.indexes[i] = idx; - this.nodes[idx] = node; - idx++; - if (idx == numChildren) { - break; - } - } - } - this.freeBitMask = (1L << (numChildren)) - 1; - - Arrays.fill(node256.nodes, null); - objectsPool.put(ObjectsPool.ART_NODE_256, node256); - } - - @Override - @SuppressWarnings("unchecked") - public V getValue(final long key, final int level) { - if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { - return null; - } - final short idx = (short) ((key >>> nodeLevel) & 0xFF); - final byte nodeIndex = indexes[idx]; - if (nodeIndex != -1) { - final Object node = nodes[nodeIndex]; - return nodeLevel == 0 - ? (V) node - : ((IArtNode) node).getValue(key, nodeLevel - 8); - } - return null; - } - - @Override - @SuppressWarnings("unchecked") - public IArtNode put(final long key, final int level, final V value) { - if (level != nodeLevel) { - final IArtNode branch = LongAdaptiveRadixTreeMap.branchIfRequired(key, value, nodeKey, nodeLevel, this); - if (branch != null) { - return branch; - } - } - final short idx = (short) ((key >>> nodeLevel) & 0xFF); - final byte nodeIndex = indexes[idx]; - if (nodeIndex != -1) { - // found - if (nodeLevel == 0) { - nodes[nodeIndex] = value; - } else { - final IArtNode resizedNode = ((IArtNode) nodes[nodeIndex]).put(key, nodeLevel - 8, value); - if (resizedNode != null) { - // update resized node if capacity has increased - // TODO put old into the pool - nodes[nodeIndex] = resizedNode; - } - } - return null; - } - - // not found, put new element - - if (numChildren != 48) { - // capacity less than 48 - can simply insert node - final byte freePosition = (byte) Long.numberOfTrailingZeros(~freeBitMask); - indexes[idx] = freePosition; - - if (nodeLevel == 0) { - nodes[freePosition] = value; - } else { - final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); - newSubNode.initFirstKey(key, value); - nodes[freePosition] = newSubNode; - } - numChildren++; - freeBitMask = freeBitMask ^ (1L << freePosition); - return null; - - } else { - // no space left, create a ArtNode256 containing a new item - final Object newElement; - if (nodeLevel == 0) { - newElement = value; - } else { - final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); - newSubNode.initFirstKey(key, value); - newElement = newSubNode; - } - - ArtNode256 node256 = objectsPool.get(ObjectsPool.ART_NODE_256, ArtNode256::new); - node256.initFromNode48(this, idx, newElement); - - return node256; - } - } - - @Override - @SuppressWarnings("unchecked") - public IArtNode remove(long key, int level) { - if (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0) { - return this; - } - final short idx = (short) ((key >>> nodeLevel) & 0xFF); - final byte nodeIndex = indexes[idx]; - if (nodeIndex == -1) { - return this; - } - - if (nodeLevel == 0) { - nodes[nodeIndex] = null; - indexes[idx] = -1; - numChildren--; - freeBitMask = freeBitMask ^ (1L << nodeIndex); - } else { - final IArtNode node = (IArtNode) nodes[nodeIndex]; - final IArtNode resizedNode = node.remove(key, nodeLevel - 8); - if (resizedNode != node) { - // TODO put old into the pool - // update resized node if capacity has decreased - nodes[nodeIndex] = resizedNode; - if (resizedNode == null) { - numChildren--; - indexes[idx] = -1; - freeBitMask = freeBitMask ^ (1L << nodeIndex); - } - } - } - - if (numChildren == NODE16_SWITCH_THRESHOLD) { - final ArtNode16 newNode = objectsPool.get(ObjectsPool.ART_NODE_16, ArtNode16::new); - newNode.initFromNode48(this); - return newNode; - } else { - return this; - } - } - - @Override - @SuppressWarnings("unchecked") - public V getCeilingValue(long key, int level) { -// log.debug("key = {}", String.format("%Xh", key)); - // special processing for compacted nodes - if ((level != nodeLevel)) { - // try first - final long mask = -1L << (nodeLevel + 8); -// log.debug("key & mask = {} > nodeKey & mask = {}", String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); - final long keyWithMask = key & mask; - final long nodeKeyWithMask = nodeKey & mask; - if (nodeKeyWithMask < keyWithMask) { - // compacted part is lower - no need to search for ceiling entry here - return null; - } else if (keyWithMask != nodeKeyWithMask) { - // can reset key, because compacted nodekey is higher - key = 0; - } - } - - short idx = (short) ((key >>> nodeLevel) & 0xFF); - - byte index = indexes[idx]; - if (index != -1) { - // if exact key found - final V res = nodeLevel == 0 ? (V) nodes[index] : ((IArtNode) nodes[index]).getCeilingValue(key, nodeLevel - 8); - if (res != null) { - // return if found ceiling, otherwise will try next one - return res; - } - } - - // if exact key not found - searching for first higher key - while (++idx < 256) { - index = indexes[idx]; - if (index != -1) { - if (nodeLevel == 0) { - // found - return (V) nodes[index]; - } else { - // find first lowest key - return ((IArtNode) nodes[index]).getCeilingValue(0, nodeLevel - 8); - } - } - } - - // no keys found - return null; - } - - @Override - @SuppressWarnings("unchecked") - public V getFloorValue(long key, int level) { - // log.debug("key = {}", String.format("%Xh", key)); - // special processing for compacted nodes - if ((level != nodeLevel)) { - // try first - final long mask = -1L << (nodeLevel + 8); -// log.debug("key & mask = {} > nodeKey & mask = {}", -// String.format("%Xh", key & mask), String.format("%Xh", nodeKey & mask)); - final long keyWithMask = key & mask; - final long nodeKeyWithMask = nodeKey & mask; - if (nodeKeyWithMask > keyWithMask) { - // compacted part is higher - no need to search for floor entry here - return null; - } else if (keyWithMask != nodeKeyWithMask) { - // find highest value, because compacted nodekey is lower - key = Long.MAX_VALUE; - } - } - - short idx = (short) ((key >>> nodeLevel) & 0xFF); - - byte index = indexes[idx]; - if (index != -1) { - // if exact key found - final V res = nodeLevel == 0 ? (V) nodes[index] : ((IArtNode) nodes[index]).getFloorValue(key, nodeLevel - 8); - if (res != null) { - // return if found ceiling, otherwise will try prev one - return res; - } - } - - // if exact key not found - searching for first lower key - while (--idx >= 0) { - index = indexes[idx]; - if (index != -1) { - if (nodeLevel == 0) { - // found - return (V) nodes[index]; - } else { - // find first highest key - return ((IArtNode) nodes[index]).getFloorValue(Long.MAX_VALUE, nodeLevel - 8); - } - } - } - - // no keys found - return null; - } - - @Override - @SuppressWarnings("unchecked") - public int forEach(LongObjConsumer consumer, int limit) { - if (nodeLevel == 0) { - final long keyBase = (nodeKey >>> 8) << 8; - int numFound = 0; - for (short i = 0; i < 256; i++) { - if (numFound == limit) { - return numFound; - } - final byte index = indexes[i]; - if (index != -1) { - consumer.accept(keyBase + i, (V) nodes[index]); - numFound++; - } - } - return numFound; - } else { - int numLeft = limit; - for (short i = 0; i < 256 && numLeft > 0; i++) { - final byte index = indexes[i]; - if (index != -1) { - numLeft -= ((IArtNode) nodes[index]).forEach(consumer, numLeft); - } - } - return limit - numLeft; - } - } - - @Override - @SuppressWarnings("unchecked") - public int forEachDesc(LongObjConsumer consumer, int limit) { - if (nodeLevel == 0) { - final long keyBase = (nodeKey >>> 8) << 8; - int numFound = 0; - for (short i = 255; i >= 0; i--) { - if (numFound == limit) { - return numFound; - } - final byte index = indexes[i]; - if (index != -1) { - consumer.accept(keyBase + i, (V) nodes[index]); - numFound++; - } - } - return numFound; - } else { - int numLeft = limit; - for (short i = 255; i >= 0 && numLeft > 0; i--) { - final byte index = indexes[i]; - if (index != -1) { - numLeft -= ((IArtNode) nodes[index]).forEachDesc(consumer, numLeft); - } - } - return limit - numLeft; - } - } - - @Override - @SuppressWarnings("unchecked") - public int size(int limit) { - if (nodeLevel == 0) { - return numChildren; - } else { - int numLeft = limit; - for (short i = 0; i < 256 && numLeft > 0; i++) { - final byte index = indexes[i]; - if (index != -1) { - numLeft -= ((IArtNode) nodes[index]).size(numLeft); - } - } - return limit - numLeft; - } - } - - - @Override - public void validateInternalState(int level) { - if (nodeLevel > level) throw new IllegalStateException("unexpected nodeLevel"); - int found = 0; - final Set keysSet = new HashSet<>(); - long expectedBitMask = 0; - for (int i = 0; i < 256; i++) { - byte idx = indexes[i]; - if (idx != -1) { - if (idx > 47 || idx < -1) throw new IllegalStateException("wrong index"); - keysSet.add((int) idx); - found++; - if (nodes[idx] == null) throw new IllegalStateException("null node"); - expectedBitMask ^= (1L << idx); - } - } - if (freeBitMask != expectedBitMask) throw new IllegalStateException("freeBitMask is wrong"); - if (found != numChildren) throw new IllegalStateException("wrong numChildren"); - if (keysSet.size() != numChildren) { - throw new IllegalStateException("duplicate keys keysSet=" + keysSet + " numChildren=" + numChildren); - } - if (numChildren > 48 || numChildren <= NODE16_SWITCH_THRESHOLD) - throw new IllegalStateException("unexpected numChildren"); - for (int i = 0; i < 48; i++) { - Object node = nodes[i]; - if (keysSet.contains(i)) { - if (node == null) { - throw new IllegalStateException("null node"); - } else { - if (node instanceof IArtNode) { - if (nodeLevel == 0) throw new IllegalStateException("unexpected node type"); - IArtNode artNode = (IArtNode) node; - artNode.validateInternalState(nodeLevel - 8); - } else { - if (nodeLevel != 0) throw new IllegalStateException("unexpected node type"); - } - } - } else { - if (node != null) throw new IllegalStateException("not released node"); - } - } - } - - @Override - @SuppressWarnings("unchecked") - public List> entries() { - final long keyPrefix = nodeKey & (-1L << 8); - final List> list = new ArrayList<>(); - short[] keys = createKeysArray(); - for (int i = 0; i < numChildren; i++) { - if (nodeLevel == 0) { - list.add(new LongAdaptiveRadixTreeMap.Entry<>(keyPrefix + keys[i], (V) nodes[indexes[keys[i]]])); - } else { - list.addAll(((IArtNode) nodes[indexes[keys[i]]]).entries()); - } - } - return list; - } - - @Override - public String printDiagram(String prefix, int level) { - final short[] keys = createKeysArray(); - return LongAdaptiveRadixTreeMap.printDiagram(prefix, level, nodeLevel, nodeKey, numChildren, idx -> keys[idx], idx -> nodes[indexes[keys[idx]]]); - } - - @Override - public ObjectsPool getObjectsPool() { - return objectsPool; - } - - @Override - public String toString() { - return "ArtNode48{" + - "nodeKey=" + nodeKey + - ", nodeLevel=" + nodeLevel + - ", numChildren=" + numChildren + - '}'; - } - - private short[] createKeysArray() { - short[] keys = new short[numChildren]; - int j = 0; - for (short i = 0; i < 256; i++) { - if (indexes[i] != -1) { - keys[j++] = i; - } - } - return keys; - } -} diff --git a/src/main/java/exchange/core2/collections/art/IArtNode.java b/src/main/java/exchange/core2/collections/art/IArtNode.java deleted file mode 100644 index caa25f39b..000000000 --- a/src/main/java/exchange/core2/collections/art/IArtNode.java +++ /dev/null @@ -1,74 +0,0 @@ -/* - * Copyright 2019-2020 Maksim Zheravin - * - * Licensed under the Apache License, Version 2.0 (the "License"); - * you may not use this file except in compliance with the License. - * You may obtain a copy of the License at - * - * http://www.apache.org/licenses/LICENSE-2.0 - * - * Unless required by applicable law or agreed to in writing, software - * distributed under the License is distributed on an "AS IS" BASIS, - * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. - * See the License for the specific language governing permissions and - * limitations under the License. - */ -package exchange.core2.collections.art; - - -import exchange.core2.collections.objpool.ObjectsPool; - -import java.util.List; -import java.util.Map; - -public interface IArtNode { - - V getValue(long key, int level); - - IArtNode put(long key, int level, V value); - - IArtNode remove(long key, int level); - - V getCeilingValue(long key, int level); - - V getFloorValue(long key, int level); - - int forEach(LongObjConsumer consumer, int limit); - - int forEachDesc(LongObjConsumer consumer, int limit); - - /** - * Get number of elements - * Slow operation - O(n) complexity - * - * @param limit - can provide value to operation increase performance - * @return if returned value less than limit - it is precise size of the node - */ - int size(int limit); - - /** - * For testing only - * - * @param level level - */ - void validateInternalState(int level); - - /** - * For testing only - * - * @param prefix prefix - * @param level level - * @return internal diagram part - */ - String printDiagram(String prefix, int level); - - /** - * For testing only - * - * @return list of entries - */ - List> entries(); - - - ObjectsPool getObjectsPool(); -} diff --git a/src/main/java/exchange/core2/collections/art/LongAdaptiveRadixTreeMap.java b/src/main/java/exchange/core2/collections/art/LongAdaptiveRadixTreeMap.java deleted file mode 100644 index e571b2568..000000000 --- a/src/main/java/exchange/core2/collections/art/LongAdaptiveRadixTreeMap.java +++ /dev/null @@ -1,308 +0,0 @@ -/* - * Copyright 2019-2020 Maksim Zheravin - * - * Licensed under the Apache License, Version 2.0 (the "License"); - * you may not use this file except in compliance with the License. - * You may obtain a copy of the License at - * - * http://www.apache.org/licenses/LICENSE-2.0 - * - * Unless required by applicable law or agreed to in writing, software - * distributed under the License is distributed on an "AS IS" BASIS, - * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. - * See the License for the specific language governing permissions and - * limitations under the License. - */ -package exchange.core2.collections.art; - -import exchange.core2.collections.objpool.ObjectsPool; - -import java.util.Collections; -import java.util.List; -import java.util.Map; -import java.util.function.Function; -import java.util.function.Supplier; - -/** - * Adaptive Radix Tree (ART) Java implementation - *

- * based on original paper: - *

- * The Adaptive Radix Tree: - * ARTful Indexing for Main-Memory Databases - *

- * Viktor Leis, Alfons Kemper, Thomas Neumann - * Fakultat fur Informatik - * Technische Universitat Munchen - * Boltzmannstrae 3, D-85748 Garching - *

- * https://db.in.tum.de/~leis/papers/ART.pdf - *

- * Target operations: - * - GET or (PUT + GET_LOWER/HIGHER) - placing/moving/bulkload order - often GET, more rare PUT ??cache - * - REMOVE - cancel or move - last order in the bucket - * - TRAVERSE from LOWER - filling L2 market data, in hot area (Node256 or Node48). - * - REMOVE price during matching - !! can use RANGE removal operation - rare, but latency critical - * - GET or PUT if not exists - inserting back own orders, very rare - */ -public final class LongAdaptiveRadixTreeMap { - - private static final int INITIAL_LEVEL = 56; - - private IArtNode root = null; - - private final ObjectsPool objectsPool; - - public LongAdaptiveRadixTreeMap(ObjectsPool objectsPool) { - this.objectsPool = objectsPool; - } - - public LongAdaptiveRadixTreeMap() { - objectsPool = ObjectsPool.createDefaultTestPool(); - } - - public V get(final long key) { - return root != null - ? root.getValue(key, INITIAL_LEVEL) - : null; - } - - public void put(final long key, final V value) { - if (root == null) { - final ArtNode4 node = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); - node.initFirstKey(key, value); - root = node; - } else { - - final IArtNode upSizedNode = root.put(key, INITIAL_LEVEL, value); - if (upSizedNode != null) { - // TODO put old into the pool - root = upSizedNode; - } - } - } - - public V getOrInsert(final long key, Supplier supplier) { - // TODO implement - return null; - } - - public void getOrInsertFromNode(final IArtNode node, Supplier supplier) { - // TODO implement - } - - public void remove(final long key) { - if (root != null) { - final IArtNode downSizeNode = root.remove(key, INITIAL_LEVEL); - // ignore null because can not remove root - if (downSizeNode != root) { - // TODO put old into the pool - root = downSizeNode; - } - } - } - - public void clear() { - // produces garbage - root = null; - } - - /** - * remove keys range - * - * @param keyFromInclusive from key inclusive - * @param keyToExclusive to key exclusive - */ - public void removeRange(final long keyFromInclusive, final long keyToExclusive) { - // TODO - throw new UnsupportedOperationException(); - } - - - // TODO putAndGetHigherValue - // TODO putAndGetLowerValue - - // TODO moveToAnotherKey(long oldKey, long newKey) - throw exception if not found - - public V getHigherValue(long key) { - if (root != null && key != Long.MAX_VALUE) { - return root.getCeilingValue(key + 1, INITIAL_LEVEL); - } else { - return null; - } - } - - public V getLowerValue(long key) { - if (root != null && key != 0) { - return root.getFloorValue(key - 1, INITIAL_LEVEL); - } else { - return null; - } - } - - public int forEach(LongObjConsumer consumer, int limit) { - if (root != null) { - return root.forEach(consumer, limit); - } else { - return 0; - } - } - - public int forEachDesc(LongObjConsumer consumer, int limit) { - if (root != null) { - return root.forEachDesc(consumer, limit); - } else { - return 0; - } - } - - public int size(int limit) { - if (root != null) { - return Math.min(root.size(limit), limit); - } else { - return 0; - } - } - - public List> entriesList() { - if (root != null) { - return root.entries(); - } else { - return Collections.emptyList(); - } - } - - public void validateInternalState() { - if (root != null) { - // TODO initial level - root.validateInternalState(INITIAL_LEVEL); - } - } - - public String printDiagram() { - if (root != null) { - return root.printDiagram("", INITIAL_LEVEL); - } else { - return ""; - } - } - - - static IArtNode branchIfRequired(final long key, final V value, final long nodeKey, final int nodeLevel, final IArtNode caller) { - - final long keyDiff = key ^ nodeKey; - - // check if there is common part - if ((keyDiff & (-1L << nodeLevel)) == 0) { - return null; - } - - // on which level - final int newLevel = (63 - Long.numberOfLeadingZeros(keyDiff)) & 0xF8; - if (newLevel == nodeLevel) { - return null; - } - - final ObjectsPool objectsPool = caller.getObjectsPool(); - final ArtNode4 newSubNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); - newSubNode.initFirstKey(key, value); - - final ArtNode4 newNode = objectsPool.get(ObjectsPool.ART_NODE_4, ArtNode4::new); - newNode.initTwoKeys(nodeKey, caller, key, newSubNode, newLevel); - - return newNode; - } - -// static boolean keyNotMatches(long key, int level, long nodeKey, int nodeLevel) { -// return (level != nodeLevel && ((key ^ nodeKey) & (-1L << (nodeLevel + 8))) != 0); -// } - // TODO remove based on leaf (having reference) ? - - static String printDiagram(String prefix, - int level, - int nodeLevel, - long nodeKey, - short numChildren, - Function subKeys, - Function nodes) { - - final String baseKeyPrefix; - final String baseKeyPrefix1; - final int lvlDiff = level - nodeLevel; -// log.debug("nodeKey={} level={} nodeLevel={} lvlDiff={}", String.format("%X", nodeKey), level, nodeLevel, lvlDiff); - - if (lvlDiff != 0) { - int chars = lvlDiff >> 2; -// baseKeyPrefix = String.format("[%0" + chars + "X]", nodeKey & ((1L << lvlDiff) - 1L) << nodeLevel); - long mask = ((1L << lvlDiff) - 1L); -// log.debug(" mask={}", String.format("%X", mask)); -// log.debug(" nodeKey >> level = {}", String.format("%X", nodeKey >> (nodeLevel + 8))); -// log.debug(" nodeKey >> level & mask= {}", String.format("%X", (nodeKey >> (nodeLevel + 8)) & mask)); - baseKeyPrefix = charRepeat('─', chars - 2) + String.format("[%0" + chars + "X]", (nodeKey >> (nodeLevel + 8)) & mask); - baseKeyPrefix1 = charRepeat(' ', chars * 2); - } else { - baseKeyPrefix = ""; - baseKeyPrefix1 = ""; - } - // log.debug("baseKeyPrefix={}", baseKeyPrefix); - - - StringBuilder sb = new StringBuilder(); - for (short i = 0; i < numChildren; i++) { - Object node = nodes.apply(i); - String key = String.format("%s%02X", baseKeyPrefix, subKeys.apply(i)); - String x = (i == 0 ? (numChildren == 1 ? "──" : "┬─") : (i + 1 == numChildren ? (prefix + "└─") : (prefix + "├─"))); - - if (nodeLevel == 0) { - sb.append(x + key + " = " + node); - } else { - sb.append(x + key + "" + (((IArtNode) node).printDiagram(prefix + (i + 1 == numChildren ? " " : "│ ") + baseKeyPrefix1, nodeLevel - 8))); - } - if (i < numChildren - 1) { - sb.append("\n"); - } else if (nodeLevel == 0) { - sb.append("\n" + prefix); - } - } - return sb.toString(); - } - - private static String charRepeat(char x, int n) { - StringBuilder sb = new StringBuilder(); - for (int i = 0; i < n; i++) { - sb.append(x); - } - return sb.toString(); - } - - - public static final class Entry implements Map.Entry { - - final long key; - - V value; - - public Entry(long key, V value) { - this.key = key; - this.value = value; - } - - @Override - public Long getKey() { - return key; - } - - @Override - public V getValue() { - return value; - } - - @Override - public V setValue(V value) { - final V v = this.value; - this.value = value; - return v; - } - } - -} diff --git a/src/main/java/exchange/core2/collections/art/LongObjConsumer.java b/src/main/java/exchange/core2/collections/art/LongObjConsumer.java deleted file mode 100644 index 8b12db5f3..000000000 --- a/src/main/java/exchange/core2/collections/art/LongObjConsumer.java +++ /dev/null @@ -1,28 +0,0 @@ -/* - * Copyright 2019-2020 Maksim Zheravin - * - * Licensed under the Apache License, Version 2.0 (the "License"); - * you may not use this file except in compliance with the License. - * You may obtain a copy of the License at - * - * http://www.apache.org/licenses/LICENSE-2.0 - * - * Unless required by applicable law or agreed to in writing, software - * distributed under the License is distributed on an "AS IS" BASIS, - * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. - * See the License for the specific language governing permissions and - * limitations under the License. - */ -package exchange.core2.collections.art; - -@FunctionalInterface -public interface LongObjConsumer { - - /** - * Performs this operation on the given arguments. - * - * @param a the first input argument - * @param b the second input argument - */ - void accept(long a, T b); -} diff --git a/src/main/java/exchange/core2/collections/objpool/ObjectsPool.java b/src/main/java/exchange/core2/collections/objpool/ObjectsPool.java deleted file mode 100644 index 6e6d65a0f..000000000 --- a/src/main/java/exchange/core2/collections/objpool/ObjectsPool.java +++ /dev/null @@ -1,117 +0,0 @@ -/* - * Copyright 2019-2020 Maksim Zheravin - * - * Licensed under the Apache License, Version 2.0 (the "License"); - * you may not use this file except in compliance with the License. - * You may obtain a copy of the License at - * - * http://www.apache.org/licenses/LICENSE-2.0 - * - * Unless required by applicable law or agreed to in writing, software - * distributed under the License is distributed on an "AS IS" BASIS, - * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. - * See the License for the specific language governing permissions and - * limitations under the License. - */ -package exchange.core2.collections.objpool; - -import java.util.HashMap; -import java.util.Map; -import java.util.function.Function; -import java.util.function.Supplier; - -public final class ObjectsPool { - - public static final int ORDER = 0; - - public static final int DIRECT_ORDER = 1; - public static final int DIRECT_BUCKET = 2; - public static final int ART_NODE_4 = 8; - public static final int ART_NODE_16 = 9; - public static final int ART_NODE_48 = 10; - public static final int ART_NODE_256 = 11; - public static final int SYMBOL_POSITION_RECORD = 12; - - private final ArrayStack[] pools; - - - public static ObjectsPool createDefaultTestPool() { - - // initialize object pools - final HashMap objectsPoolConfig = new HashMap<>(); - objectsPoolConfig.put(ObjectsPool.DIRECT_ORDER, 512); - objectsPoolConfig.put(ObjectsPool.DIRECT_BUCKET, 256); - objectsPoolConfig.put(ObjectsPool.ART_NODE_4, 256); - objectsPoolConfig.put(ObjectsPool.ART_NODE_16, 128); - objectsPoolConfig.put(ObjectsPool.ART_NODE_48, 64); - objectsPoolConfig.put(ObjectsPool.ART_NODE_256, 32); - - return new ObjectsPool(objectsPoolConfig); - } - - public ObjectsPool(final Map sizesConfig) { - int maxStack = sizesConfig.keySet().stream().max(Integer::compareTo).orElse(0); - this.pools = new ArrayStack[maxStack + 1]; - sizesConfig.forEach((type, size) -> this.pools[type] = new ArrayStack(size)); - } - - @SuppressWarnings("unchecked") - public T get(final int type, final Supplier supplier) { - final T obj = (T) pools[type].pop(); // pollFirst is cheaper for empty pool - - if (obj == null) { -// log.debug("MISS {}", type); - return supplier.get(); - } else { -// log.debug("HIT {} (count={})", type, pools[type].count); - return obj; - } - } - - @SuppressWarnings("unchecked") - public T get(final int type, final Function constructor) { - final T obj = (T) pools[type].pop(); // pollFirst is cheaper for empty pool - - if (obj == null) { -// log.debug("MISS {}", type); - return constructor.apply(this); - } else { -// log.debug("HIT {} (count={})", type, pools[type].count); - return obj; - } - } - - public void put(final int type, Object object) { -// log.debug("RETURN {} (count={})", type, pools[type].count); - pools[type].add(object); - } - - private final static class ArrayStack { - private int count; - private Object[] objects; - - ArrayStack(int fixedSize) { - this.objects = new Object[fixedSize]; - this.count = 0; - } - - void add(Object element) { - if (count != objects.length) { - objects[count] = element; - count++; - } - } - - Object pop() { - if (count != 0) { - count--; - Object object = objects[count]; - objects[count] = null; - return object; - } - return null; - } - } - - -}