blob: 69345386ac837a026a486679aa03448d69dfb119 [file] [log] [blame]
<!DOCTYPE html><html lang="en"><head><meta charset="utf-8"><meta name="viewport" content="width=device-width, initial-scale=1.0"><meta name="generator" content="rustdoc"><meta name="description" content="Source of the Rust file `arrow-data/src/data.rs`."><title>data.rs - source</title><script>if(window.location.protocol!=="file:")document.head.insertAdjacentHTML("beforeend","SourceSerif4-Regular-46f98efaafac5295.ttf.woff2,FiraSans-Regular-018c141bf0843ffd.woff2,FiraSans-Medium-8f9a781e4970d388.woff2,SourceCodePro-Regular-562dcc5011b6de7d.ttf.woff2,SourceCodePro-Semibold-d899c5a5c4aeb14a.ttf.woff2".split(",").map(f=>`<link rel="preload" as="font" type="font/woff2" crossorigin href="../../static.files/${f}">`).join(""))</script><link rel="stylesheet" href="../../static.files/normalize-76eba96aa4d2e634.css"><link rel="stylesheet" href="../../static.files/rustdoc-dd39b87e5fcfba68.css"><meta name="rustdoc-vars" data-root-path="../../" data-static-root-path="../../static.files/" data-current-crate="arrow_data" data-themes="" data-resource-suffix="" data-rustdoc-version="1.80.0-nightly (8c127df75 2024-05-16)" data-channel="nightly" data-search-js="search-d52510db62a78183.js" data-settings-js="settings-4313503d2e1961c2.js" ><script src="../../static.files/storage-118b08c4c78b968e.js"></script><script defer src="../../static.files/src-script-e66d777a5a92e9b2.js"></script><script defer src="../../src-files.js"></script><script defer src="../../static.files/main-20a3ad099b048cf2.js"></script><noscript><link rel="stylesheet" href="../../static.files/noscript-df360f571f6edeae.css"></noscript><link rel="alternate icon" type="image/png" href="../../static.files/favicon-32x32-422f7d1d52889060.png"><link rel="icon" type="image/svg+xml" href="../../static.files/favicon-2c020d218678b618.svg"></head><body class="rustdoc src"><!--[if lte IE 11]><div class="warning">This old browser is unsupported and will most likely display funky things.</div><![endif]--><nav class="sidebar"><div class="src-sidebar-title"><h2>Files</h2></div></nav><div class="sidebar-resizer"></div><main><rustdoc-search></rustdoc-search><section id="main-content" class="content"><div class="example-wrap"><div data-nosnippet><pre class="src-line-numbers"><a href="#1" id="1">1</a>
<a href="#2" id="2">2</a>
<a href="#3" id="3">3</a>
<a href="#4" id="4">4</a>
<a href="#5" id="5">5</a>
<a href="#6" id="6">6</a>
<a href="#7" id="7">7</a>
<a href="#8" id="8">8</a>
<a href="#9" id="9">9</a>
<a href="#10" id="10">10</a>
<a href="#11" id="11">11</a>
<a href="#12" id="12">12</a>
<a href="#13" id="13">13</a>
<a href="#14" id="14">14</a>
<a href="#15" id="15">15</a>
<a href="#16" id="16">16</a>
<a href="#17" id="17">17</a>
<a href="#18" id="18">18</a>
<a href="#19" id="19">19</a>
<a href="#20" id="20">20</a>
<a href="#21" id="21">21</a>
<a href="#22" id="22">22</a>
<a href="#23" id="23">23</a>
<a href="#24" id="24">24</a>
<a href="#25" id="25">25</a>
<a href="#26" id="26">26</a>
<a href="#27" id="27">27</a>
<a href="#28" id="28">28</a>
<a href="#29" id="29">29</a>
<a href="#30" id="30">30</a>
<a href="#31" id="31">31</a>
<a href="#32" id="32">32</a>
<a href="#33" id="33">33</a>
<a href="#34" id="34">34</a>
<a href="#35" id="35">35</a>
<a href="#36" id="36">36</a>
<a href="#37" id="37">37</a>
<a href="#38" id="38">38</a>
<a href="#39" id="39">39</a>
<a href="#40" id="40">40</a>
<a href="#41" id="41">41</a>
<a href="#42" id="42">42</a>
<a href="#43" id="43">43</a>
<a href="#44" id="44">44</a>
<a href="#45" id="45">45</a>
<a href="#46" id="46">46</a>
<a href="#47" id="47">47</a>
<a href="#48" id="48">48</a>
<a href="#49" id="49">49</a>
<a href="#50" id="50">50</a>
<a href="#51" id="51">51</a>
<a href="#52" id="52">52</a>
<a href="#53" id="53">53</a>
<a href="#54" id="54">54</a>
<a href="#55" id="55">55</a>
<a href="#56" id="56">56</a>
<a href="#57" id="57">57</a>
<a href="#58" id="58">58</a>
<a href="#59" id="59">59</a>
<a href="#60" id="60">60</a>
<a href="#61" id="61">61</a>
<a href="#62" id="62">62</a>
<a href="#63" id="63">63</a>
<a href="#64" id="64">64</a>
<a href="#65" id="65">65</a>
<a href="#66" id="66">66</a>
<a href="#67" id="67">67</a>
<a href="#68" id="68">68</a>
<a href="#69" id="69">69</a>
<a href="#70" id="70">70</a>
<a href="#71" id="71">71</a>
<a href="#72" id="72">72</a>
<a href="#73" id="73">73</a>
<a href="#74" id="74">74</a>
<a href="#75" id="75">75</a>
<a href="#76" id="76">76</a>
<a href="#77" id="77">77</a>
<a href="#78" id="78">78</a>
<a href="#79" id="79">79</a>
<a href="#80" id="80">80</a>
<a href="#81" id="81">81</a>
<a href="#82" id="82">82</a>
<a href="#83" id="83">83</a>
<a href="#84" id="84">84</a>
<a href="#85" id="85">85</a>
<a href="#86" id="86">86</a>
<a href="#87" id="87">87</a>
<a href="#88" id="88">88</a>
<a href="#89" id="89">89</a>
<a href="#90" id="90">90</a>
<a href="#91" id="91">91</a>
<a href="#92" id="92">92</a>
<a href="#93" id="93">93</a>
<a href="#94" id="94">94</a>
<a href="#95" id="95">95</a>
<a href="#96" id="96">96</a>
<a href="#97" id="97">97</a>
<a href="#98" id="98">98</a>
<a href="#99" id="99">99</a>
<a href="#100" id="100">100</a>
<a href="#101" id="101">101</a>
<a href="#102" id="102">102</a>
<a href="#103" id="103">103</a>
<a href="#104" id="104">104</a>
<a href="#105" id="105">105</a>
<a href="#106" id="106">106</a>
<a href="#107" id="107">107</a>
<a href="#108" id="108">108</a>
<a href="#109" id="109">109</a>
<a href="#110" id="110">110</a>
<a href="#111" id="111">111</a>
<a href="#112" id="112">112</a>
<a href="#113" id="113">113</a>
<a href="#114" id="114">114</a>
<a href="#115" id="115">115</a>
<a href="#116" id="116">116</a>
<a href="#117" id="117">117</a>
<a href="#118" id="118">118</a>
<a href="#119" id="119">119</a>
<a href="#120" id="120">120</a>
<a href="#121" id="121">121</a>
<a href="#122" id="122">122</a>
<a href="#123" id="123">123</a>
<a href="#124" id="124">124</a>
<a href="#125" id="125">125</a>
<a href="#126" id="126">126</a>
<a href="#127" id="127">127</a>
<a href="#128" id="128">128</a>
<a href="#129" id="129">129</a>
<a href="#130" id="130">130</a>
<a href="#131" id="131">131</a>
<a href="#132" id="132">132</a>
<a href="#133" id="133">133</a>
<a href="#134" id="134">134</a>
<a href="#135" id="135">135</a>
<a href="#136" id="136">136</a>
<a href="#137" id="137">137</a>
<a href="#138" id="138">138</a>
<a href="#139" id="139">139</a>
<a href="#140" id="140">140</a>
<a href="#141" id="141">141</a>
<a href="#142" id="142">142</a>
<a href="#143" id="143">143</a>
<a href="#144" id="144">144</a>
<a href="#145" id="145">145</a>
<a href="#146" id="146">146</a>
<a href="#147" id="147">147</a>
<a href="#148" id="148">148</a>
<a href="#149" id="149">149</a>
<a href="#150" id="150">150</a>
<a href="#151" id="151">151</a>
<a href="#152" id="152">152</a>
<a href="#153" id="153">153</a>
<a href="#154" id="154">154</a>
<a href="#155" id="155">155</a>
<a href="#156" id="156">156</a>
<a href="#157" id="157">157</a>
<a href="#158" id="158">158</a>
<a href="#159" id="159">159</a>
<a href="#160" id="160">160</a>
<a href="#161" id="161">161</a>
<a href="#162" id="162">162</a>
<a href="#163" id="163">163</a>
<a href="#164" id="164">164</a>
<a href="#165" id="165">165</a>
<a href="#166" id="166">166</a>
<a href="#167" id="167">167</a>
<a href="#168" id="168">168</a>
<a href="#169" id="169">169</a>
<a href="#170" id="170">170</a>
<a href="#171" id="171">171</a>
<a href="#172" id="172">172</a>
<a href="#173" id="173">173</a>
<a href="#174" id="174">174</a>
<a href="#175" id="175">175</a>
<a href="#176" id="176">176</a>
<a href="#177" id="177">177</a>
<a href="#178" id="178">178</a>
<a href="#179" id="179">179</a>
<a href="#180" id="180">180</a>
<a href="#181" id="181">181</a>
<a href="#182" id="182">182</a>
<a href="#183" id="183">183</a>
<a href="#184" id="184">184</a>
<a href="#185" id="185">185</a>
<a href="#186" id="186">186</a>
<a href="#187" id="187">187</a>
<a href="#188" id="188">188</a>
<a href="#189" id="189">189</a>
<a href="#190" id="190">190</a>
<a href="#191" id="191">191</a>
<a href="#192" id="192">192</a>
<a href="#193" id="193">193</a>
<a href="#194" id="194">194</a>
<a href="#195" id="195">195</a>
<a href="#196" id="196">196</a>
<a href="#197" id="197">197</a>
<a href="#198" id="198">198</a>
<a href="#199" id="199">199</a>
<a href="#200" id="200">200</a>
<a href="#201" id="201">201</a>
<a href="#202" id="202">202</a>
<a href="#203" id="203">203</a>
<a href="#204" id="204">204</a>
<a href="#205" id="205">205</a>
<a href="#206" id="206">206</a>
<a href="#207" id="207">207</a>
<a href="#208" id="208">208</a>
<a href="#209" id="209">209</a>
<a href="#210" id="210">210</a>
<a href="#211" id="211">211</a>
<a href="#212" id="212">212</a>
<a href="#213" id="213">213</a>
<a href="#214" id="214">214</a>
<a href="#215" id="215">215</a>
<a href="#216" id="216">216</a>
<a href="#217" id="217">217</a>
<a href="#218" id="218">218</a>
<a href="#219" id="219">219</a>
<a href="#220" id="220">220</a>
<a href="#221" id="221">221</a>
<a href="#222" id="222">222</a>
<a href="#223" id="223">223</a>
<a href="#224" id="224">224</a>
<a href="#225" id="225">225</a>
<a href="#226" id="226">226</a>
<a href="#227" id="227">227</a>
<a href="#228" id="228">228</a>
<a href="#229" id="229">229</a>
<a href="#230" id="230">230</a>
<a href="#231" id="231">231</a>
<a href="#232" id="232">232</a>
<a href="#233" id="233">233</a>
<a href="#234" id="234">234</a>
<a href="#235" id="235">235</a>
<a href="#236" id="236">236</a>
<a href="#237" id="237">237</a>
<a href="#238" id="238">238</a>
<a href="#239" id="239">239</a>
<a href="#240" id="240">240</a>
<a href="#241" id="241">241</a>
<a href="#242" id="242">242</a>
<a href="#243" id="243">243</a>
<a href="#244" id="244">244</a>
<a href="#245" id="245">245</a>
<a href="#246" id="246">246</a>
<a href="#247" id="247">247</a>
<a href="#248" id="248">248</a>
<a href="#249" id="249">249</a>
<a href="#250" id="250">250</a>
<a href="#251" id="251">251</a>
<a href="#252" id="252">252</a>
<a href="#253" id="253">253</a>
<a href="#254" id="254">254</a>
<a href="#255" id="255">255</a>
<a href="#256" id="256">256</a>
<a href="#257" id="257">257</a>
<a href="#258" id="258">258</a>
<a href="#259" id="259">259</a>
<a href="#260" id="260">260</a>
<a href="#261" id="261">261</a>
<a href="#262" id="262">262</a>
<a href="#263" id="263">263</a>
<a href="#264" id="264">264</a>
<a href="#265" id="265">265</a>
<a href="#266" id="266">266</a>
<a href="#267" id="267">267</a>
<a href="#268" id="268">268</a>
<a href="#269" id="269">269</a>
<a href="#270" id="270">270</a>
<a href="#271" id="271">271</a>
<a href="#272" id="272">272</a>
<a href="#273" id="273">273</a>
<a href="#274" id="274">274</a>
<a href="#275" id="275">275</a>
<a href="#276" id="276">276</a>
<a href="#277" id="277">277</a>
<a href="#278" id="278">278</a>
<a href="#279" id="279">279</a>
<a href="#280" id="280">280</a>
<a href="#281" id="281">281</a>
<a href="#282" id="282">282</a>
<a href="#283" id="283">283</a>
<a href="#284" id="284">284</a>
<a href="#285" id="285">285</a>
<a href="#286" id="286">286</a>
<a href="#287" id="287">287</a>
<a href="#288" id="288">288</a>
<a href="#289" id="289">289</a>
<a href="#290" id="290">290</a>
<a href="#291" id="291">291</a>
<a href="#292" id="292">292</a>
<a href="#293" id="293">293</a>
<a href="#294" id="294">294</a>
<a href="#295" id="295">295</a>
<a href="#296" id="296">296</a>
<a href="#297" id="297">297</a>
<a href="#298" id="298">298</a>
<a href="#299" id="299">299</a>
<a href="#300" id="300">300</a>
<a href="#301" id="301">301</a>
<a href="#302" id="302">302</a>
<a href="#303" id="303">303</a>
<a href="#304" id="304">304</a>
<a href="#305" id="305">305</a>
<a href="#306" id="306">306</a>
<a href="#307" id="307">307</a>
<a href="#308" id="308">308</a>
<a href="#309" id="309">309</a>
<a href="#310" id="310">310</a>
<a href="#311" id="311">311</a>
<a href="#312" id="312">312</a>
<a href="#313" id="313">313</a>
<a href="#314" id="314">314</a>
<a href="#315" id="315">315</a>
<a href="#316" id="316">316</a>
<a href="#317" id="317">317</a>
<a href="#318" id="318">318</a>
<a href="#319" id="319">319</a>
<a href="#320" id="320">320</a>
<a href="#321" id="321">321</a>
<a href="#322" id="322">322</a>
<a href="#323" id="323">323</a>
<a href="#324" id="324">324</a>
<a href="#325" id="325">325</a>
<a href="#326" id="326">326</a>
<a href="#327" id="327">327</a>
<a href="#328" id="328">328</a>
<a href="#329" id="329">329</a>
<a href="#330" id="330">330</a>
<a href="#331" id="331">331</a>
<a href="#332" id="332">332</a>
<a href="#333" id="333">333</a>
<a href="#334" id="334">334</a>
<a href="#335" id="335">335</a>
<a href="#336" id="336">336</a>
<a href="#337" id="337">337</a>
<a href="#338" id="338">338</a>
<a href="#339" id="339">339</a>
<a href="#340" id="340">340</a>
<a href="#341" id="341">341</a>
<a href="#342" id="342">342</a>
<a href="#343" id="343">343</a>
<a href="#344" id="344">344</a>
<a href="#345" id="345">345</a>
<a href="#346" id="346">346</a>
<a href="#347" id="347">347</a>
<a href="#348" id="348">348</a>
<a href="#349" id="349">349</a>
<a href="#350" id="350">350</a>
<a href="#351" id="351">351</a>
<a href="#352" id="352">352</a>
<a href="#353" id="353">353</a>
<a href="#354" id="354">354</a>
<a href="#355" id="355">355</a>
<a href="#356" id="356">356</a>
<a href="#357" id="357">357</a>
<a href="#358" id="358">358</a>
<a href="#359" id="359">359</a>
<a href="#360" id="360">360</a>
<a href="#361" id="361">361</a>
<a href="#362" id="362">362</a>
<a href="#363" id="363">363</a>
<a href="#364" id="364">364</a>
<a href="#365" id="365">365</a>
<a href="#366" id="366">366</a>
<a href="#367" id="367">367</a>
<a href="#368" id="368">368</a>
<a href="#369" id="369">369</a>
<a href="#370" id="370">370</a>
<a href="#371" id="371">371</a>
<a href="#372" id="372">372</a>
<a href="#373" id="373">373</a>
<a href="#374" id="374">374</a>
<a href="#375" id="375">375</a>
<a href="#376" id="376">376</a>
<a href="#377" id="377">377</a>
<a href="#378" id="378">378</a>
<a href="#379" id="379">379</a>
<a href="#380" id="380">380</a>
<a href="#381" id="381">381</a>
<a href="#382" id="382">382</a>
<a href="#383" id="383">383</a>
<a href="#384" id="384">384</a>
<a href="#385" id="385">385</a>
<a href="#386" id="386">386</a>
<a href="#387" id="387">387</a>
<a href="#388" id="388">388</a>
<a href="#389" id="389">389</a>
<a href="#390" id="390">390</a>
<a href="#391" id="391">391</a>
<a href="#392" id="392">392</a>
<a href="#393" id="393">393</a>
<a href="#394" id="394">394</a>
<a href="#395" id="395">395</a>
<a href="#396" id="396">396</a>
<a href="#397" id="397">397</a>
<a href="#398" id="398">398</a>
<a href="#399" id="399">399</a>
<a href="#400" id="400">400</a>
<a href="#401" id="401">401</a>
<a href="#402" id="402">402</a>
<a href="#403" id="403">403</a>
<a href="#404" id="404">404</a>
<a href="#405" id="405">405</a>
<a href="#406" id="406">406</a>
<a href="#407" id="407">407</a>
<a href="#408" id="408">408</a>
<a href="#409" id="409">409</a>
<a href="#410" id="410">410</a>
<a href="#411" id="411">411</a>
<a href="#412" id="412">412</a>
<a href="#413" id="413">413</a>
<a href="#414" id="414">414</a>
<a href="#415" id="415">415</a>
<a href="#416" id="416">416</a>
<a href="#417" id="417">417</a>
<a href="#418" id="418">418</a>
<a href="#419" id="419">419</a>
<a href="#420" id="420">420</a>
<a href="#421" id="421">421</a>
<a href="#422" id="422">422</a>
<a href="#423" id="423">423</a>
<a href="#424" id="424">424</a>
<a href="#425" id="425">425</a>
<a href="#426" id="426">426</a>
<a href="#427" id="427">427</a>
<a href="#428" id="428">428</a>
<a href="#429" id="429">429</a>
<a href="#430" id="430">430</a>
<a href="#431" id="431">431</a>
<a href="#432" id="432">432</a>
<a href="#433" id="433">433</a>
<a href="#434" id="434">434</a>
<a href="#435" id="435">435</a>
<a href="#436" id="436">436</a>
<a href="#437" id="437">437</a>
<a href="#438" id="438">438</a>
<a href="#439" id="439">439</a>
<a href="#440" id="440">440</a>
<a href="#441" id="441">441</a>
<a href="#442" id="442">442</a>
<a href="#443" id="443">443</a>
<a href="#444" id="444">444</a>
<a href="#445" id="445">445</a>
<a href="#446" id="446">446</a>
<a href="#447" id="447">447</a>
<a href="#448" id="448">448</a>
<a href="#449" id="449">449</a>
<a href="#450" id="450">450</a>
<a href="#451" id="451">451</a>
<a href="#452" id="452">452</a>
<a href="#453" id="453">453</a>
<a href="#454" id="454">454</a>
<a href="#455" id="455">455</a>
<a href="#456" id="456">456</a>
<a href="#457" id="457">457</a>
<a href="#458" id="458">458</a>
<a href="#459" id="459">459</a>
<a href="#460" id="460">460</a>
<a href="#461" id="461">461</a>
<a href="#462" id="462">462</a>
<a href="#463" id="463">463</a>
<a href="#464" id="464">464</a>
<a href="#465" id="465">465</a>
<a href="#466" id="466">466</a>
<a href="#467" id="467">467</a>
<a href="#468" id="468">468</a>
<a href="#469" id="469">469</a>
<a href="#470" id="470">470</a>
<a href="#471" id="471">471</a>
<a href="#472" id="472">472</a>
<a href="#473" id="473">473</a>
<a href="#474" id="474">474</a>
<a href="#475" id="475">475</a>
<a href="#476" id="476">476</a>
<a href="#477" id="477">477</a>
<a href="#478" id="478">478</a>
<a href="#479" id="479">479</a>
<a href="#480" id="480">480</a>
<a href="#481" id="481">481</a>
<a href="#482" id="482">482</a>
<a href="#483" id="483">483</a>
<a href="#484" id="484">484</a>
<a href="#485" id="485">485</a>
<a href="#486" id="486">486</a>
<a href="#487" id="487">487</a>
<a href="#488" id="488">488</a>
<a href="#489" id="489">489</a>
<a href="#490" id="490">490</a>
<a href="#491" id="491">491</a>
<a href="#492" id="492">492</a>
<a href="#493" id="493">493</a>
<a href="#494" id="494">494</a>
<a href="#495" id="495">495</a>
<a href="#496" id="496">496</a>
<a href="#497" id="497">497</a>
<a href="#498" id="498">498</a>
<a href="#499" id="499">499</a>
<a href="#500" id="500">500</a>
<a href="#501" id="501">501</a>
<a href="#502" id="502">502</a>
<a href="#503" id="503">503</a>
<a href="#504" id="504">504</a>
<a href="#505" id="505">505</a>
<a href="#506" id="506">506</a>
<a href="#507" id="507">507</a>
<a href="#508" id="508">508</a>
<a href="#509" id="509">509</a>
<a href="#510" id="510">510</a>
<a href="#511" id="511">511</a>
<a href="#512" id="512">512</a>
<a href="#513" id="513">513</a>
<a href="#514" id="514">514</a>
<a href="#515" id="515">515</a>
<a href="#516" id="516">516</a>
<a href="#517" id="517">517</a>
<a href="#518" id="518">518</a>
<a href="#519" id="519">519</a>
<a href="#520" id="520">520</a>
<a href="#521" id="521">521</a>
<a href="#522" id="522">522</a>
<a href="#523" id="523">523</a>
<a href="#524" id="524">524</a>
<a href="#525" id="525">525</a>
<a href="#526" id="526">526</a>
<a href="#527" id="527">527</a>
<a href="#528" id="528">528</a>
<a href="#529" id="529">529</a>
<a href="#530" id="530">530</a>
<a href="#531" id="531">531</a>
<a href="#532" id="532">532</a>
<a href="#533" id="533">533</a>
<a href="#534" id="534">534</a>
<a href="#535" id="535">535</a>
<a href="#536" id="536">536</a>
<a href="#537" id="537">537</a>
<a href="#538" id="538">538</a>
<a href="#539" id="539">539</a>
<a href="#540" id="540">540</a>
<a href="#541" id="541">541</a>
<a href="#542" id="542">542</a>
<a href="#543" id="543">543</a>
<a href="#544" id="544">544</a>
<a href="#545" id="545">545</a>
<a href="#546" id="546">546</a>
<a href="#547" id="547">547</a>
<a href="#548" id="548">548</a>
<a href="#549" id="549">549</a>
<a href="#550" id="550">550</a>
<a href="#551" id="551">551</a>
<a href="#552" id="552">552</a>
<a href="#553" id="553">553</a>
<a href="#554" id="554">554</a>
<a href="#555" id="555">555</a>
<a href="#556" id="556">556</a>
<a href="#557" id="557">557</a>
<a href="#558" id="558">558</a>
<a href="#559" id="559">559</a>
<a href="#560" id="560">560</a>
<a href="#561" id="561">561</a>
<a href="#562" id="562">562</a>
<a href="#563" id="563">563</a>
<a href="#564" id="564">564</a>
<a href="#565" id="565">565</a>
<a href="#566" id="566">566</a>
<a href="#567" id="567">567</a>
<a href="#568" id="568">568</a>
<a href="#569" id="569">569</a>
<a href="#570" id="570">570</a>
<a href="#571" id="571">571</a>
<a href="#572" id="572">572</a>
<a href="#573" id="573">573</a>
<a href="#574" id="574">574</a>
<a href="#575" id="575">575</a>
<a href="#576" id="576">576</a>
<a href="#577" id="577">577</a>
<a href="#578" id="578">578</a>
<a href="#579" id="579">579</a>
<a href="#580" id="580">580</a>
<a href="#581" id="581">581</a>
<a href="#582" id="582">582</a>
<a href="#583" id="583">583</a>
<a href="#584" id="584">584</a>
<a href="#585" id="585">585</a>
<a href="#586" id="586">586</a>
<a href="#587" id="587">587</a>
<a href="#588" id="588">588</a>
<a href="#589" id="589">589</a>
<a href="#590" id="590">590</a>
<a href="#591" id="591">591</a>
<a href="#592" id="592">592</a>
<a href="#593" id="593">593</a>
<a href="#594" id="594">594</a>
<a href="#595" id="595">595</a>
<a href="#596" id="596">596</a>
<a href="#597" id="597">597</a>
<a href="#598" id="598">598</a>
<a href="#599" id="599">599</a>
<a href="#600" id="600">600</a>
<a href="#601" id="601">601</a>
<a href="#602" id="602">602</a>
<a href="#603" id="603">603</a>
<a href="#604" id="604">604</a>
<a href="#605" id="605">605</a>
<a href="#606" id="606">606</a>
<a href="#607" id="607">607</a>
<a href="#608" id="608">608</a>
<a href="#609" id="609">609</a>
<a href="#610" id="610">610</a>
<a href="#611" id="611">611</a>
<a href="#612" id="612">612</a>
<a href="#613" id="613">613</a>
<a href="#614" id="614">614</a>
<a href="#615" id="615">615</a>
<a href="#616" id="616">616</a>
<a href="#617" id="617">617</a>
<a href="#618" id="618">618</a>
<a href="#619" id="619">619</a>
<a href="#620" id="620">620</a>
<a href="#621" id="621">621</a>
<a href="#622" id="622">622</a>
<a href="#623" id="623">623</a>
<a href="#624" id="624">624</a>
<a href="#625" id="625">625</a>
<a href="#626" id="626">626</a>
<a href="#627" id="627">627</a>
<a href="#628" id="628">628</a>
<a href="#629" id="629">629</a>
<a href="#630" id="630">630</a>
<a href="#631" id="631">631</a>
<a href="#632" id="632">632</a>
<a href="#633" id="633">633</a>
<a href="#634" id="634">634</a>
<a href="#635" id="635">635</a>
<a href="#636" id="636">636</a>
<a href="#637" id="637">637</a>
<a href="#638" id="638">638</a>
<a href="#639" id="639">639</a>
<a href="#640" id="640">640</a>
<a href="#641" id="641">641</a>
<a href="#642" id="642">642</a>
<a href="#643" id="643">643</a>
<a href="#644" id="644">644</a>
<a href="#645" id="645">645</a>
<a href="#646" id="646">646</a>
<a href="#647" id="647">647</a>
<a href="#648" id="648">648</a>
<a href="#649" id="649">649</a>
<a href="#650" id="650">650</a>
<a href="#651" id="651">651</a>
<a href="#652" id="652">652</a>
<a href="#653" id="653">653</a>
<a href="#654" id="654">654</a>
<a href="#655" id="655">655</a>
<a href="#656" id="656">656</a>
<a href="#657" id="657">657</a>
<a href="#658" id="658">658</a>
<a href="#659" id="659">659</a>
<a href="#660" id="660">660</a>
<a href="#661" id="661">661</a>
<a href="#662" id="662">662</a>
<a href="#663" id="663">663</a>
<a href="#664" id="664">664</a>
<a href="#665" id="665">665</a>
<a href="#666" id="666">666</a>
<a href="#667" id="667">667</a>
<a href="#668" id="668">668</a>
<a href="#669" id="669">669</a>
<a href="#670" id="670">670</a>
<a href="#671" id="671">671</a>
<a href="#672" id="672">672</a>
<a href="#673" id="673">673</a>
<a href="#674" id="674">674</a>
<a href="#675" id="675">675</a>
<a href="#676" id="676">676</a>
<a href="#677" id="677">677</a>
<a href="#678" id="678">678</a>
<a href="#679" id="679">679</a>
<a href="#680" id="680">680</a>
<a href="#681" id="681">681</a>
<a href="#682" id="682">682</a>
<a href="#683" id="683">683</a>
<a href="#684" id="684">684</a>
<a href="#685" id="685">685</a>
<a href="#686" id="686">686</a>
<a href="#687" id="687">687</a>
<a href="#688" id="688">688</a>
<a href="#689" id="689">689</a>
<a href="#690" id="690">690</a>
<a href="#691" id="691">691</a>
<a href="#692" id="692">692</a>
<a href="#693" id="693">693</a>
<a href="#694" id="694">694</a>
<a href="#695" id="695">695</a>
<a href="#696" id="696">696</a>
<a href="#697" id="697">697</a>
<a href="#698" id="698">698</a>
<a href="#699" id="699">699</a>
<a href="#700" id="700">700</a>
<a href="#701" id="701">701</a>
<a href="#702" id="702">702</a>
<a href="#703" id="703">703</a>
<a href="#704" id="704">704</a>
<a href="#705" id="705">705</a>
<a href="#706" id="706">706</a>
<a href="#707" id="707">707</a>
<a href="#708" id="708">708</a>
<a href="#709" id="709">709</a>
<a href="#710" id="710">710</a>
<a href="#711" id="711">711</a>
<a href="#712" id="712">712</a>
<a href="#713" id="713">713</a>
<a href="#714" id="714">714</a>
<a href="#715" id="715">715</a>
<a href="#716" id="716">716</a>
<a href="#717" id="717">717</a>
<a href="#718" id="718">718</a>
<a href="#719" id="719">719</a>
<a href="#720" id="720">720</a>
<a href="#721" id="721">721</a>
<a href="#722" id="722">722</a>
<a href="#723" id="723">723</a>
<a href="#724" id="724">724</a>
<a href="#725" id="725">725</a>
<a href="#726" id="726">726</a>
<a href="#727" id="727">727</a>
<a href="#728" id="728">728</a>
<a href="#729" id="729">729</a>
<a href="#730" id="730">730</a>
<a href="#731" id="731">731</a>
<a href="#732" id="732">732</a>
<a href="#733" id="733">733</a>
<a href="#734" id="734">734</a>
<a href="#735" id="735">735</a>
<a href="#736" id="736">736</a>
<a href="#737" id="737">737</a>
<a href="#738" id="738">738</a>
<a href="#739" id="739">739</a>
<a href="#740" id="740">740</a>
<a href="#741" id="741">741</a>
<a href="#742" id="742">742</a>
<a href="#743" id="743">743</a>
<a href="#744" id="744">744</a>
<a href="#745" id="745">745</a>
<a href="#746" id="746">746</a>
<a href="#747" id="747">747</a>
<a href="#748" id="748">748</a>
<a href="#749" id="749">749</a>
<a href="#750" id="750">750</a>
<a href="#751" id="751">751</a>
<a href="#752" id="752">752</a>
<a href="#753" id="753">753</a>
<a href="#754" id="754">754</a>
<a href="#755" id="755">755</a>
<a href="#756" id="756">756</a>
<a href="#757" id="757">757</a>
<a href="#758" id="758">758</a>
<a href="#759" id="759">759</a>
<a href="#760" id="760">760</a>
<a href="#761" id="761">761</a>
<a href="#762" id="762">762</a>
<a href="#763" id="763">763</a>
<a href="#764" id="764">764</a>
<a href="#765" id="765">765</a>
<a href="#766" id="766">766</a>
<a href="#767" id="767">767</a>
<a href="#768" id="768">768</a>
<a href="#769" id="769">769</a>
<a href="#770" id="770">770</a>
<a href="#771" id="771">771</a>
<a href="#772" id="772">772</a>
<a href="#773" id="773">773</a>
<a href="#774" id="774">774</a>
<a href="#775" id="775">775</a>
<a href="#776" id="776">776</a>
<a href="#777" id="777">777</a>
<a href="#778" id="778">778</a>
<a href="#779" id="779">779</a>
<a href="#780" id="780">780</a>
<a href="#781" id="781">781</a>
<a href="#782" id="782">782</a>
<a href="#783" id="783">783</a>
<a href="#784" id="784">784</a>
<a href="#785" id="785">785</a>
<a href="#786" id="786">786</a>
<a href="#787" id="787">787</a>
<a href="#788" id="788">788</a>
<a href="#789" id="789">789</a>
<a href="#790" id="790">790</a>
<a href="#791" id="791">791</a>
<a href="#792" id="792">792</a>
<a href="#793" id="793">793</a>
<a href="#794" id="794">794</a>
<a href="#795" id="795">795</a>
<a href="#796" id="796">796</a>
<a href="#797" id="797">797</a>
<a href="#798" id="798">798</a>
<a href="#799" id="799">799</a>
<a href="#800" id="800">800</a>
<a href="#801" id="801">801</a>
<a href="#802" id="802">802</a>
<a href="#803" id="803">803</a>
<a href="#804" id="804">804</a>
<a href="#805" id="805">805</a>
<a href="#806" id="806">806</a>
<a href="#807" id="807">807</a>
<a href="#808" id="808">808</a>
<a href="#809" id="809">809</a>
<a href="#810" id="810">810</a>
<a href="#811" id="811">811</a>
<a href="#812" id="812">812</a>
<a href="#813" id="813">813</a>
<a href="#814" id="814">814</a>
<a href="#815" id="815">815</a>
<a href="#816" id="816">816</a>
<a href="#817" id="817">817</a>
<a href="#818" id="818">818</a>
<a href="#819" id="819">819</a>
<a href="#820" id="820">820</a>
<a href="#821" id="821">821</a>
<a href="#822" id="822">822</a>
<a href="#823" id="823">823</a>
<a href="#824" id="824">824</a>
<a href="#825" id="825">825</a>
<a href="#826" id="826">826</a>
<a href="#827" id="827">827</a>
<a href="#828" id="828">828</a>
<a href="#829" id="829">829</a>
<a href="#830" id="830">830</a>
<a href="#831" id="831">831</a>
<a href="#832" id="832">832</a>
<a href="#833" id="833">833</a>
<a href="#834" id="834">834</a>
<a href="#835" id="835">835</a>
<a href="#836" id="836">836</a>
<a href="#837" id="837">837</a>
<a href="#838" id="838">838</a>
<a href="#839" id="839">839</a>
<a href="#840" id="840">840</a>
<a href="#841" id="841">841</a>
<a href="#842" id="842">842</a>
<a href="#843" id="843">843</a>
<a href="#844" id="844">844</a>
<a href="#845" id="845">845</a>
<a href="#846" id="846">846</a>
<a href="#847" id="847">847</a>
<a href="#848" id="848">848</a>
<a href="#849" id="849">849</a>
<a href="#850" id="850">850</a>
<a href="#851" id="851">851</a>
<a href="#852" id="852">852</a>
<a href="#853" id="853">853</a>
<a href="#854" id="854">854</a>
<a href="#855" id="855">855</a>
<a href="#856" id="856">856</a>
<a href="#857" id="857">857</a>
<a href="#858" id="858">858</a>
<a href="#859" id="859">859</a>
<a href="#860" id="860">860</a>
<a href="#861" id="861">861</a>
<a href="#862" id="862">862</a>
<a href="#863" id="863">863</a>
<a href="#864" id="864">864</a>
<a href="#865" id="865">865</a>
<a href="#866" id="866">866</a>
<a href="#867" id="867">867</a>
<a href="#868" id="868">868</a>
<a href="#869" id="869">869</a>
<a href="#870" id="870">870</a>
<a href="#871" id="871">871</a>
<a href="#872" id="872">872</a>
<a href="#873" id="873">873</a>
<a href="#874" id="874">874</a>
<a href="#875" id="875">875</a>
<a href="#876" id="876">876</a>
<a href="#877" id="877">877</a>
<a href="#878" id="878">878</a>
<a href="#879" id="879">879</a>
<a href="#880" id="880">880</a>
<a href="#881" id="881">881</a>
<a href="#882" id="882">882</a>
<a href="#883" id="883">883</a>
<a href="#884" id="884">884</a>
<a href="#885" id="885">885</a>
<a href="#886" id="886">886</a>
<a href="#887" id="887">887</a>
<a href="#888" id="888">888</a>
<a href="#889" id="889">889</a>
<a href="#890" id="890">890</a>
<a href="#891" id="891">891</a>
<a href="#892" id="892">892</a>
<a href="#893" id="893">893</a>
<a href="#894" id="894">894</a>
<a href="#895" id="895">895</a>
<a href="#896" id="896">896</a>
<a href="#897" id="897">897</a>
<a href="#898" id="898">898</a>
<a href="#899" id="899">899</a>
<a href="#900" id="900">900</a>
<a href="#901" id="901">901</a>
<a href="#902" id="902">902</a>
<a href="#903" id="903">903</a>
<a href="#904" id="904">904</a>
<a href="#905" id="905">905</a>
<a href="#906" id="906">906</a>
<a href="#907" id="907">907</a>
<a href="#908" id="908">908</a>
<a href="#909" id="909">909</a>
<a href="#910" id="910">910</a>
<a href="#911" id="911">911</a>
<a href="#912" id="912">912</a>
<a href="#913" id="913">913</a>
<a href="#914" id="914">914</a>
<a href="#915" id="915">915</a>
<a href="#916" id="916">916</a>
<a href="#917" id="917">917</a>
<a href="#918" id="918">918</a>
<a href="#919" id="919">919</a>
<a href="#920" id="920">920</a>
<a href="#921" id="921">921</a>
<a href="#922" id="922">922</a>
<a href="#923" id="923">923</a>
<a href="#924" id="924">924</a>
<a href="#925" id="925">925</a>
<a href="#926" id="926">926</a>
<a href="#927" id="927">927</a>
<a href="#928" id="928">928</a>
<a href="#929" id="929">929</a>
<a href="#930" id="930">930</a>
<a href="#931" id="931">931</a>
<a href="#932" id="932">932</a>
<a href="#933" id="933">933</a>
<a href="#934" id="934">934</a>
<a href="#935" id="935">935</a>
<a href="#936" id="936">936</a>
<a href="#937" id="937">937</a>
<a href="#938" id="938">938</a>
<a href="#939" id="939">939</a>
<a href="#940" id="940">940</a>
<a href="#941" id="941">941</a>
<a href="#942" id="942">942</a>
<a href="#943" id="943">943</a>
<a href="#944" id="944">944</a>
<a href="#945" id="945">945</a>
<a href="#946" id="946">946</a>
<a href="#947" id="947">947</a>
<a href="#948" id="948">948</a>
<a href="#949" id="949">949</a>
<a href="#950" id="950">950</a>
<a href="#951" id="951">951</a>
<a href="#952" id="952">952</a>
<a href="#953" id="953">953</a>
<a href="#954" id="954">954</a>
<a href="#955" id="955">955</a>
<a href="#956" id="956">956</a>
<a href="#957" id="957">957</a>
<a href="#958" id="958">958</a>
<a href="#959" id="959">959</a>
<a href="#960" id="960">960</a>
<a href="#961" id="961">961</a>
<a href="#962" id="962">962</a>
<a href="#963" id="963">963</a>
<a href="#964" id="964">964</a>
<a href="#965" id="965">965</a>
<a href="#966" id="966">966</a>
<a href="#967" id="967">967</a>
<a href="#968" id="968">968</a>
<a href="#969" id="969">969</a>
<a href="#970" id="970">970</a>
<a href="#971" id="971">971</a>
<a href="#972" id="972">972</a>
<a href="#973" id="973">973</a>
<a href="#974" id="974">974</a>
<a href="#975" id="975">975</a>
<a href="#976" id="976">976</a>
<a href="#977" id="977">977</a>
<a href="#978" id="978">978</a>
<a href="#979" id="979">979</a>
<a href="#980" id="980">980</a>
<a href="#981" id="981">981</a>
<a href="#982" id="982">982</a>
<a href="#983" id="983">983</a>
<a href="#984" id="984">984</a>
<a href="#985" id="985">985</a>
<a href="#986" id="986">986</a>
<a href="#987" id="987">987</a>
<a href="#988" id="988">988</a>
<a href="#989" id="989">989</a>
<a href="#990" id="990">990</a>
<a href="#991" id="991">991</a>
<a href="#992" id="992">992</a>
<a href="#993" id="993">993</a>
<a href="#994" id="994">994</a>
<a href="#995" id="995">995</a>
<a href="#996" id="996">996</a>
<a href="#997" id="997">997</a>
<a href="#998" id="998">998</a>
<a href="#999" id="999">999</a>
<a href="#1000" id="1000">1000</a>
<a href="#1001" id="1001">1001</a>
<a href="#1002" id="1002">1002</a>
<a href="#1003" id="1003">1003</a>
<a href="#1004" id="1004">1004</a>
<a href="#1005" id="1005">1005</a>
<a href="#1006" id="1006">1006</a>
<a href="#1007" id="1007">1007</a>
<a href="#1008" id="1008">1008</a>
<a href="#1009" id="1009">1009</a>
<a href="#1010" id="1010">1010</a>
<a href="#1011" id="1011">1011</a>
<a href="#1012" id="1012">1012</a>
<a href="#1013" id="1013">1013</a>
<a href="#1014" id="1014">1014</a>
<a href="#1015" id="1015">1015</a>
<a href="#1016" id="1016">1016</a>
<a href="#1017" id="1017">1017</a>
<a href="#1018" id="1018">1018</a>
<a href="#1019" id="1019">1019</a>
<a href="#1020" id="1020">1020</a>
<a href="#1021" id="1021">1021</a>
<a href="#1022" id="1022">1022</a>
<a href="#1023" id="1023">1023</a>
<a href="#1024" id="1024">1024</a>
<a href="#1025" id="1025">1025</a>
<a href="#1026" id="1026">1026</a>
<a href="#1027" id="1027">1027</a>
<a href="#1028" id="1028">1028</a>
<a href="#1029" id="1029">1029</a>
<a href="#1030" id="1030">1030</a>
<a href="#1031" id="1031">1031</a>
<a href="#1032" id="1032">1032</a>
<a href="#1033" id="1033">1033</a>
<a href="#1034" id="1034">1034</a>
<a href="#1035" id="1035">1035</a>
<a href="#1036" id="1036">1036</a>
<a href="#1037" id="1037">1037</a>
<a href="#1038" id="1038">1038</a>
<a href="#1039" id="1039">1039</a>
<a href="#1040" id="1040">1040</a>
<a href="#1041" id="1041">1041</a>
<a href="#1042" id="1042">1042</a>
<a href="#1043" id="1043">1043</a>
<a href="#1044" id="1044">1044</a>
<a href="#1045" id="1045">1045</a>
<a href="#1046" id="1046">1046</a>
<a href="#1047" id="1047">1047</a>
<a href="#1048" id="1048">1048</a>
<a href="#1049" id="1049">1049</a>
<a href="#1050" id="1050">1050</a>
<a href="#1051" id="1051">1051</a>
<a href="#1052" id="1052">1052</a>
<a href="#1053" id="1053">1053</a>
<a href="#1054" id="1054">1054</a>
<a href="#1055" id="1055">1055</a>
<a href="#1056" id="1056">1056</a>
<a href="#1057" id="1057">1057</a>
<a href="#1058" id="1058">1058</a>
<a href="#1059" id="1059">1059</a>
<a href="#1060" id="1060">1060</a>
<a href="#1061" id="1061">1061</a>
<a href="#1062" id="1062">1062</a>
<a href="#1063" id="1063">1063</a>
<a href="#1064" id="1064">1064</a>
<a href="#1065" id="1065">1065</a>
<a href="#1066" id="1066">1066</a>
<a href="#1067" id="1067">1067</a>
<a href="#1068" id="1068">1068</a>
<a href="#1069" id="1069">1069</a>
<a href="#1070" id="1070">1070</a>
<a href="#1071" id="1071">1071</a>
<a href="#1072" id="1072">1072</a>
<a href="#1073" id="1073">1073</a>
<a href="#1074" id="1074">1074</a>
<a href="#1075" id="1075">1075</a>
<a href="#1076" id="1076">1076</a>
<a href="#1077" id="1077">1077</a>
<a href="#1078" id="1078">1078</a>
<a href="#1079" id="1079">1079</a>
<a href="#1080" id="1080">1080</a>
<a href="#1081" id="1081">1081</a>
<a href="#1082" id="1082">1082</a>
<a href="#1083" id="1083">1083</a>
<a href="#1084" id="1084">1084</a>
<a href="#1085" id="1085">1085</a>
<a href="#1086" id="1086">1086</a>
<a href="#1087" id="1087">1087</a>
<a href="#1088" id="1088">1088</a>
<a href="#1089" id="1089">1089</a>
<a href="#1090" id="1090">1090</a>
<a href="#1091" id="1091">1091</a>
<a href="#1092" id="1092">1092</a>
<a href="#1093" id="1093">1093</a>
<a href="#1094" id="1094">1094</a>
<a href="#1095" id="1095">1095</a>
<a href="#1096" id="1096">1096</a>
<a href="#1097" id="1097">1097</a>
<a href="#1098" id="1098">1098</a>
<a href="#1099" id="1099">1099</a>
<a href="#1100" id="1100">1100</a>
<a href="#1101" id="1101">1101</a>
<a href="#1102" id="1102">1102</a>
<a href="#1103" id="1103">1103</a>
<a href="#1104" id="1104">1104</a>
<a href="#1105" id="1105">1105</a>
<a href="#1106" id="1106">1106</a>
<a href="#1107" id="1107">1107</a>
<a href="#1108" id="1108">1108</a>
<a href="#1109" id="1109">1109</a>
<a href="#1110" id="1110">1110</a>
<a href="#1111" id="1111">1111</a>
<a href="#1112" id="1112">1112</a>
<a href="#1113" id="1113">1113</a>
<a href="#1114" id="1114">1114</a>
<a href="#1115" id="1115">1115</a>
<a href="#1116" id="1116">1116</a>
<a href="#1117" id="1117">1117</a>
<a href="#1118" id="1118">1118</a>
<a href="#1119" id="1119">1119</a>
<a href="#1120" id="1120">1120</a>
<a href="#1121" id="1121">1121</a>
<a href="#1122" id="1122">1122</a>
<a href="#1123" id="1123">1123</a>
<a href="#1124" id="1124">1124</a>
<a href="#1125" id="1125">1125</a>
<a href="#1126" id="1126">1126</a>
<a href="#1127" id="1127">1127</a>
<a href="#1128" id="1128">1128</a>
<a href="#1129" id="1129">1129</a>
<a href="#1130" id="1130">1130</a>
<a href="#1131" id="1131">1131</a>
<a href="#1132" id="1132">1132</a>
<a href="#1133" id="1133">1133</a>
<a href="#1134" id="1134">1134</a>
<a href="#1135" id="1135">1135</a>
<a href="#1136" id="1136">1136</a>
<a href="#1137" id="1137">1137</a>
<a href="#1138" id="1138">1138</a>
<a href="#1139" id="1139">1139</a>
<a href="#1140" id="1140">1140</a>
<a href="#1141" id="1141">1141</a>
<a href="#1142" id="1142">1142</a>
<a href="#1143" id="1143">1143</a>
<a href="#1144" id="1144">1144</a>
<a href="#1145" id="1145">1145</a>
<a href="#1146" id="1146">1146</a>
<a href="#1147" id="1147">1147</a>
<a href="#1148" id="1148">1148</a>
<a href="#1149" id="1149">1149</a>
<a href="#1150" id="1150">1150</a>
<a href="#1151" id="1151">1151</a>
<a href="#1152" id="1152">1152</a>
<a href="#1153" id="1153">1153</a>
<a href="#1154" id="1154">1154</a>
<a href="#1155" id="1155">1155</a>
<a href="#1156" id="1156">1156</a>
<a href="#1157" id="1157">1157</a>
<a href="#1158" id="1158">1158</a>
<a href="#1159" id="1159">1159</a>
<a href="#1160" id="1160">1160</a>
<a href="#1161" id="1161">1161</a>
<a href="#1162" id="1162">1162</a>
<a href="#1163" id="1163">1163</a>
<a href="#1164" id="1164">1164</a>
<a href="#1165" id="1165">1165</a>
<a href="#1166" id="1166">1166</a>
<a href="#1167" id="1167">1167</a>
<a href="#1168" id="1168">1168</a>
<a href="#1169" id="1169">1169</a>
<a href="#1170" id="1170">1170</a>
<a href="#1171" id="1171">1171</a>
<a href="#1172" id="1172">1172</a>
<a href="#1173" id="1173">1173</a>
<a href="#1174" id="1174">1174</a>
<a href="#1175" id="1175">1175</a>
<a href="#1176" id="1176">1176</a>
<a href="#1177" id="1177">1177</a>
<a href="#1178" id="1178">1178</a>
<a href="#1179" id="1179">1179</a>
<a href="#1180" id="1180">1180</a>
<a href="#1181" id="1181">1181</a>
<a href="#1182" id="1182">1182</a>
<a href="#1183" id="1183">1183</a>
<a href="#1184" id="1184">1184</a>
<a href="#1185" id="1185">1185</a>
<a href="#1186" id="1186">1186</a>
<a href="#1187" id="1187">1187</a>
<a href="#1188" id="1188">1188</a>
<a href="#1189" id="1189">1189</a>
<a href="#1190" id="1190">1190</a>
<a href="#1191" id="1191">1191</a>
<a href="#1192" id="1192">1192</a>
<a href="#1193" id="1193">1193</a>
<a href="#1194" id="1194">1194</a>
<a href="#1195" id="1195">1195</a>
<a href="#1196" id="1196">1196</a>
<a href="#1197" id="1197">1197</a>
<a href="#1198" id="1198">1198</a>
<a href="#1199" id="1199">1199</a>
<a href="#1200" id="1200">1200</a>
<a href="#1201" id="1201">1201</a>
<a href="#1202" id="1202">1202</a>
<a href="#1203" id="1203">1203</a>
<a href="#1204" id="1204">1204</a>
<a href="#1205" id="1205">1205</a>
<a href="#1206" id="1206">1206</a>
<a href="#1207" id="1207">1207</a>
<a href="#1208" id="1208">1208</a>
<a href="#1209" id="1209">1209</a>
<a href="#1210" id="1210">1210</a>
<a href="#1211" id="1211">1211</a>
<a href="#1212" id="1212">1212</a>
<a href="#1213" id="1213">1213</a>
<a href="#1214" id="1214">1214</a>
<a href="#1215" id="1215">1215</a>
<a href="#1216" id="1216">1216</a>
<a href="#1217" id="1217">1217</a>
<a href="#1218" id="1218">1218</a>
<a href="#1219" id="1219">1219</a>
<a href="#1220" id="1220">1220</a>
<a href="#1221" id="1221">1221</a>
<a href="#1222" id="1222">1222</a>
<a href="#1223" id="1223">1223</a>
<a href="#1224" id="1224">1224</a>
<a href="#1225" id="1225">1225</a>
<a href="#1226" id="1226">1226</a>
<a href="#1227" id="1227">1227</a>
<a href="#1228" id="1228">1228</a>
<a href="#1229" id="1229">1229</a>
<a href="#1230" id="1230">1230</a>
<a href="#1231" id="1231">1231</a>
<a href="#1232" id="1232">1232</a>
<a href="#1233" id="1233">1233</a>
<a href="#1234" id="1234">1234</a>
<a href="#1235" id="1235">1235</a>
<a href="#1236" id="1236">1236</a>
<a href="#1237" id="1237">1237</a>
<a href="#1238" id="1238">1238</a>
<a href="#1239" id="1239">1239</a>
<a href="#1240" id="1240">1240</a>
<a href="#1241" id="1241">1241</a>
<a href="#1242" id="1242">1242</a>
<a href="#1243" id="1243">1243</a>
<a href="#1244" id="1244">1244</a>
<a href="#1245" id="1245">1245</a>
<a href="#1246" id="1246">1246</a>
<a href="#1247" id="1247">1247</a>
<a href="#1248" id="1248">1248</a>
<a href="#1249" id="1249">1249</a>
<a href="#1250" id="1250">1250</a>
<a href="#1251" id="1251">1251</a>
<a href="#1252" id="1252">1252</a>
<a href="#1253" id="1253">1253</a>
<a href="#1254" id="1254">1254</a>
<a href="#1255" id="1255">1255</a>
<a href="#1256" id="1256">1256</a>
<a href="#1257" id="1257">1257</a>
<a href="#1258" id="1258">1258</a>
<a href="#1259" id="1259">1259</a>
<a href="#1260" id="1260">1260</a>
<a href="#1261" id="1261">1261</a>
<a href="#1262" id="1262">1262</a>
<a href="#1263" id="1263">1263</a>
<a href="#1264" id="1264">1264</a>
<a href="#1265" id="1265">1265</a>
<a href="#1266" id="1266">1266</a>
<a href="#1267" id="1267">1267</a>
<a href="#1268" id="1268">1268</a>
<a href="#1269" id="1269">1269</a>
<a href="#1270" id="1270">1270</a>
<a href="#1271" id="1271">1271</a>
<a href="#1272" id="1272">1272</a>
<a href="#1273" id="1273">1273</a>
<a href="#1274" id="1274">1274</a>
<a href="#1275" id="1275">1275</a>
<a href="#1276" id="1276">1276</a>
<a href="#1277" id="1277">1277</a>
<a href="#1278" id="1278">1278</a>
<a href="#1279" id="1279">1279</a>
<a href="#1280" id="1280">1280</a>
<a href="#1281" id="1281">1281</a>
<a href="#1282" id="1282">1282</a>
<a href="#1283" id="1283">1283</a>
<a href="#1284" id="1284">1284</a>
<a href="#1285" id="1285">1285</a>
<a href="#1286" id="1286">1286</a>
<a href="#1287" id="1287">1287</a>
<a href="#1288" id="1288">1288</a>
<a href="#1289" id="1289">1289</a>
<a href="#1290" id="1290">1290</a>
<a href="#1291" id="1291">1291</a>
<a href="#1292" id="1292">1292</a>
<a href="#1293" id="1293">1293</a>
<a href="#1294" id="1294">1294</a>
<a href="#1295" id="1295">1295</a>
<a href="#1296" id="1296">1296</a>
<a href="#1297" id="1297">1297</a>
<a href="#1298" id="1298">1298</a>
<a href="#1299" id="1299">1299</a>
<a href="#1300" id="1300">1300</a>
<a href="#1301" id="1301">1301</a>
<a href="#1302" id="1302">1302</a>
<a href="#1303" id="1303">1303</a>
<a href="#1304" id="1304">1304</a>
<a href="#1305" id="1305">1305</a>
<a href="#1306" id="1306">1306</a>
<a href="#1307" id="1307">1307</a>
<a href="#1308" id="1308">1308</a>
<a href="#1309" id="1309">1309</a>
<a href="#1310" id="1310">1310</a>
<a href="#1311" id="1311">1311</a>
<a href="#1312" id="1312">1312</a>
<a href="#1313" id="1313">1313</a>
<a href="#1314" id="1314">1314</a>
<a href="#1315" id="1315">1315</a>
<a href="#1316" id="1316">1316</a>
<a href="#1317" id="1317">1317</a>
<a href="#1318" id="1318">1318</a>
<a href="#1319" id="1319">1319</a>
<a href="#1320" id="1320">1320</a>
<a href="#1321" id="1321">1321</a>
<a href="#1322" id="1322">1322</a>
<a href="#1323" id="1323">1323</a>
<a href="#1324" id="1324">1324</a>
<a href="#1325" id="1325">1325</a>
<a href="#1326" id="1326">1326</a>
<a href="#1327" id="1327">1327</a>
<a href="#1328" id="1328">1328</a>
<a href="#1329" id="1329">1329</a>
<a href="#1330" id="1330">1330</a>
<a href="#1331" id="1331">1331</a>
<a href="#1332" id="1332">1332</a>
<a href="#1333" id="1333">1333</a>
<a href="#1334" id="1334">1334</a>
<a href="#1335" id="1335">1335</a>
<a href="#1336" id="1336">1336</a>
<a href="#1337" id="1337">1337</a>
<a href="#1338" id="1338">1338</a>
<a href="#1339" id="1339">1339</a>
<a href="#1340" id="1340">1340</a>
<a href="#1341" id="1341">1341</a>
<a href="#1342" id="1342">1342</a>
<a href="#1343" id="1343">1343</a>
<a href="#1344" id="1344">1344</a>
<a href="#1345" id="1345">1345</a>
<a href="#1346" id="1346">1346</a>
<a href="#1347" id="1347">1347</a>
<a href="#1348" id="1348">1348</a>
<a href="#1349" id="1349">1349</a>
<a href="#1350" id="1350">1350</a>
<a href="#1351" id="1351">1351</a>
<a href="#1352" id="1352">1352</a>
<a href="#1353" id="1353">1353</a>
<a href="#1354" id="1354">1354</a>
<a href="#1355" id="1355">1355</a>
<a href="#1356" id="1356">1356</a>
<a href="#1357" id="1357">1357</a>
<a href="#1358" id="1358">1358</a>
<a href="#1359" id="1359">1359</a>
<a href="#1360" id="1360">1360</a>
<a href="#1361" id="1361">1361</a>
<a href="#1362" id="1362">1362</a>
<a href="#1363" id="1363">1363</a>
<a href="#1364" id="1364">1364</a>
<a href="#1365" id="1365">1365</a>
<a href="#1366" id="1366">1366</a>
<a href="#1367" id="1367">1367</a>
<a href="#1368" id="1368">1368</a>
<a href="#1369" id="1369">1369</a>
<a href="#1370" id="1370">1370</a>
<a href="#1371" id="1371">1371</a>
<a href="#1372" id="1372">1372</a>
<a href="#1373" id="1373">1373</a>
<a href="#1374" id="1374">1374</a>
<a href="#1375" id="1375">1375</a>
<a href="#1376" id="1376">1376</a>
<a href="#1377" id="1377">1377</a>
<a href="#1378" id="1378">1378</a>
<a href="#1379" id="1379">1379</a>
<a href="#1380" id="1380">1380</a>
<a href="#1381" id="1381">1381</a>
<a href="#1382" id="1382">1382</a>
<a href="#1383" id="1383">1383</a>
<a href="#1384" id="1384">1384</a>
<a href="#1385" id="1385">1385</a>
<a href="#1386" id="1386">1386</a>
<a href="#1387" id="1387">1387</a>
<a href="#1388" id="1388">1388</a>
<a href="#1389" id="1389">1389</a>
<a href="#1390" id="1390">1390</a>
<a href="#1391" id="1391">1391</a>
<a href="#1392" id="1392">1392</a>
<a href="#1393" id="1393">1393</a>
<a href="#1394" id="1394">1394</a>
<a href="#1395" id="1395">1395</a>
<a href="#1396" id="1396">1396</a>
<a href="#1397" id="1397">1397</a>
<a href="#1398" id="1398">1398</a>
<a href="#1399" id="1399">1399</a>
<a href="#1400" id="1400">1400</a>
<a href="#1401" id="1401">1401</a>
<a href="#1402" id="1402">1402</a>
<a href="#1403" id="1403">1403</a>
<a href="#1404" id="1404">1404</a>
<a href="#1405" id="1405">1405</a>
<a href="#1406" id="1406">1406</a>
<a href="#1407" id="1407">1407</a>
<a href="#1408" id="1408">1408</a>
<a href="#1409" id="1409">1409</a>
<a href="#1410" id="1410">1410</a>
<a href="#1411" id="1411">1411</a>
<a href="#1412" id="1412">1412</a>
<a href="#1413" id="1413">1413</a>
<a href="#1414" id="1414">1414</a>
<a href="#1415" id="1415">1415</a>
<a href="#1416" id="1416">1416</a>
<a href="#1417" id="1417">1417</a>
<a href="#1418" id="1418">1418</a>
<a href="#1419" id="1419">1419</a>
<a href="#1420" id="1420">1420</a>
<a href="#1421" id="1421">1421</a>
<a href="#1422" id="1422">1422</a>
<a href="#1423" id="1423">1423</a>
<a href="#1424" id="1424">1424</a>
<a href="#1425" id="1425">1425</a>
<a href="#1426" id="1426">1426</a>
<a href="#1427" id="1427">1427</a>
<a href="#1428" id="1428">1428</a>
<a href="#1429" id="1429">1429</a>
<a href="#1430" id="1430">1430</a>
<a href="#1431" id="1431">1431</a>
<a href="#1432" id="1432">1432</a>
<a href="#1433" id="1433">1433</a>
<a href="#1434" id="1434">1434</a>
<a href="#1435" id="1435">1435</a>
<a href="#1436" id="1436">1436</a>
<a href="#1437" id="1437">1437</a>
<a href="#1438" id="1438">1438</a>
<a href="#1439" id="1439">1439</a>
<a href="#1440" id="1440">1440</a>
<a href="#1441" id="1441">1441</a>
<a href="#1442" id="1442">1442</a>
<a href="#1443" id="1443">1443</a>
<a href="#1444" id="1444">1444</a>
<a href="#1445" id="1445">1445</a>
<a href="#1446" id="1446">1446</a>
<a href="#1447" id="1447">1447</a>
<a href="#1448" id="1448">1448</a>
<a href="#1449" id="1449">1449</a>
<a href="#1450" id="1450">1450</a>
<a href="#1451" id="1451">1451</a>
<a href="#1452" id="1452">1452</a>
<a href="#1453" id="1453">1453</a>
<a href="#1454" id="1454">1454</a>
<a href="#1455" id="1455">1455</a>
<a href="#1456" id="1456">1456</a>
<a href="#1457" id="1457">1457</a>
<a href="#1458" id="1458">1458</a>
<a href="#1459" id="1459">1459</a>
<a href="#1460" id="1460">1460</a>
<a href="#1461" id="1461">1461</a>
<a href="#1462" id="1462">1462</a>
<a href="#1463" id="1463">1463</a>
<a href="#1464" id="1464">1464</a>
<a href="#1465" id="1465">1465</a>
<a href="#1466" id="1466">1466</a>
<a href="#1467" id="1467">1467</a>
<a href="#1468" id="1468">1468</a>
<a href="#1469" id="1469">1469</a>
<a href="#1470" id="1470">1470</a>
<a href="#1471" id="1471">1471</a>
<a href="#1472" id="1472">1472</a>
<a href="#1473" id="1473">1473</a>
<a href="#1474" id="1474">1474</a>
<a href="#1475" id="1475">1475</a>
<a href="#1476" id="1476">1476</a>
<a href="#1477" id="1477">1477</a>
<a href="#1478" id="1478">1478</a>
<a href="#1479" id="1479">1479</a>
<a href="#1480" id="1480">1480</a>
<a href="#1481" id="1481">1481</a>
<a href="#1482" id="1482">1482</a>
<a href="#1483" id="1483">1483</a>
<a href="#1484" id="1484">1484</a>
<a href="#1485" id="1485">1485</a>
<a href="#1486" id="1486">1486</a>
<a href="#1487" id="1487">1487</a>
<a href="#1488" id="1488">1488</a>
<a href="#1489" id="1489">1489</a>
<a href="#1490" id="1490">1490</a>
<a href="#1491" id="1491">1491</a>
<a href="#1492" id="1492">1492</a>
<a href="#1493" id="1493">1493</a>
<a href="#1494" id="1494">1494</a>
<a href="#1495" id="1495">1495</a>
<a href="#1496" id="1496">1496</a>
<a href="#1497" id="1497">1497</a>
<a href="#1498" id="1498">1498</a>
<a href="#1499" id="1499">1499</a>
<a href="#1500" id="1500">1500</a>
<a href="#1501" id="1501">1501</a>
<a href="#1502" id="1502">1502</a>
<a href="#1503" id="1503">1503</a>
<a href="#1504" id="1504">1504</a>
<a href="#1505" id="1505">1505</a>
<a href="#1506" id="1506">1506</a>
<a href="#1507" id="1507">1507</a>
<a href="#1508" id="1508">1508</a>
<a href="#1509" id="1509">1509</a>
<a href="#1510" id="1510">1510</a>
<a href="#1511" id="1511">1511</a>
<a href="#1512" id="1512">1512</a>
<a href="#1513" id="1513">1513</a>
<a href="#1514" id="1514">1514</a>
<a href="#1515" id="1515">1515</a>
<a href="#1516" id="1516">1516</a>
<a href="#1517" id="1517">1517</a>
<a href="#1518" id="1518">1518</a>
<a href="#1519" id="1519">1519</a>
<a href="#1520" id="1520">1520</a>
<a href="#1521" id="1521">1521</a>
<a href="#1522" id="1522">1522</a>
<a href="#1523" id="1523">1523</a>
<a href="#1524" id="1524">1524</a>
<a href="#1525" id="1525">1525</a>
<a href="#1526" id="1526">1526</a>
<a href="#1527" id="1527">1527</a>
<a href="#1528" id="1528">1528</a>
<a href="#1529" id="1529">1529</a>
<a href="#1530" id="1530">1530</a>
<a href="#1531" id="1531">1531</a>
<a href="#1532" id="1532">1532</a>
<a href="#1533" id="1533">1533</a>
<a href="#1534" id="1534">1534</a>
<a href="#1535" id="1535">1535</a>
<a href="#1536" id="1536">1536</a>
<a href="#1537" id="1537">1537</a>
<a href="#1538" id="1538">1538</a>
<a href="#1539" id="1539">1539</a>
<a href="#1540" id="1540">1540</a>
<a href="#1541" id="1541">1541</a>
<a href="#1542" id="1542">1542</a>
<a href="#1543" id="1543">1543</a>
<a href="#1544" id="1544">1544</a>
<a href="#1545" id="1545">1545</a>
<a href="#1546" id="1546">1546</a>
<a href="#1547" id="1547">1547</a>
<a href="#1548" id="1548">1548</a>
<a href="#1549" id="1549">1549</a>
<a href="#1550" id="1550">1550</a>
<a href="#1551" id="1551">1551</a>
<a href="#1552" id="1552">1552</a>
<a href="#1553" id="1553">1553</a>
<a href="#1554" id="1554">1554</a>
<a href="#1555" id="1555">1555</a>
<a href="#1556" id="1556">1556</a>
<a href="#1557" id="1557">1557</a>
<a href="#1558" id="1558">1558</a>
<a href="#1559" id="1559">1559</a>
<a href="#1560" id="1560">1560</a>
<a href="#1561" id="1561">1561</a>
<a href="#1562" id="1562">1562</a>
<a href="#1563" id="1563">1563</a>
<a href="#1564" id="1564">1564</a>
<a href="#1565" id="1565">1565</a>
<a href="#1566" id="1566">1566</a>
<a href="#1567" id="1567">1567</a>
<a href="#1568" id="1568">1568</a>
<a href="#1569" id="1569">1569</a>
<a href="#1570" id="1570">1570</a>
<a href="#1571" id="1571">1571</a>
<a href="#1572" id="1572">1572</a>
<a href="#1573" id="1573">1573</a>
<a href="#1574" id="1574">1574</a>
<a href="#1575" id="1575">1575</a>
<a href="#1576" id="1576">1576</a>
<a href="#1577" id="1577">1577</a>
<a href="#1578" id="1578">1578</a>
<a href="#1579" id="1579">1579</a>
<a href="#1580" id="1580">1580</a>
<a href="#1581" id="1581">1581</a>
<a href="#1582" id="1582">1582</a>
<a href="#1583" id="1583">1583</a>
<a href="#1584" id="1584">1584</a>
<a href="#1585" id="1585">1585</a>
<a href="#1586" id="1586">1586</a>
<a href="#1587" id="1587">1587</a>
<a href="#1588" id="1588">1588</a>
<a href="#1589" id="1589">1589</a>
<a href="#1590" id="1590">1590</a>
<a href="#1591" id="1591">1591</a>
<a href="#1592" id="1592">1592</a>
<a href="#1593" id="1593">1593</a>
<a href="#1594" id="1594">1594</a>
<a href="#1595" id="1595">1595</a>
<a href="#1596" id="1596">1596</a>
<a href="#1597" id="1597">1597</a>
<a href="#1598" id="1598">1598</a>
<a href="#1599" id="1599">1599</a>
<a href="#1600" id="1600">1600</a>
<a href="#1601" id="1601">1601</a>
<a href="#1602" id="1602">1602</a>
<a href="#1603" id="1603">1603</a>
<a href="#1604" id="1604">1604</a>
<a href="#1605" id="1605">1605</a>
<a href="#1606" id="1606">1606</a>
<a href="#1607" id="1607">1607</a>
<a href="#1608" id="1608">1608</a>
<a href="#1609" id="1609">1609</a>
<a href="#1610" id="1610">1610</a>
<a href="#1611" id="1611">1611</a>
<a href="#1612" id="1612">1612</a>
<a href="#1613" id="1613">1613</a>
<a href="#1614" id="1614">1614</a>
<a href="#1615" id="1615">1615</a>
<a href="#1616" id="1616">1616</a>
<a href="#1617" id="1617">1617</a>
<a href="#1618" id="1618">1618</a>
<a href="#1619" id="1619">1619</a>
<a href="#1620" id="1620">1620</a>
<a href="#1621" id="1621">1621</a>
<a href="#1622" id="1622">1622</a>
<a href="#1623" id="1623">1623</a>
<a href="#1624" id="1624">1624</a>
<a href="#1625" id="1625">1625</a>
<a href="#1626" id="1626">1626</a>
<a href="#1627" id="1627">1627</a>
<a href="#1628" id="1628">1628</a>
<a href="#1629" id="1629">1629</a>
<a href="#1630" id="1630">1630</a>
<a href="#1631" id="1631">1631</a>
<a href="#1632" id="1632">1632</a>
<a href="#1633" id="1633">1633</a>
<a href="#1634" id="1634">1634</a>
<a href="#1635" id="1635">1635</a>
<a href="#1636" id="1636">1636</a>
<a href="#1637" id="1637">1637</a>
<a href="#1638" id="1638">1638</a>
<a href="#1639" id="1639">1639</a>
<a href="#1640" id="1640">1640</a>
<a href="#1641" id="1641">1641</a>
<a href="#1642" id="1642">1642</a>
<a href="#1643" id="1643">1643</a>
<a href="#1644" id="1644">1644</a>
<a href="#1645" id="1645">1645</a>
<a href="#1646" id="1646">1646</a>
<a href="#1647" id="1647">1647</a>
<a href="#1648" id="1648">1648</a>
<a href="#1649" id="1649">1649</a>
<a href="#1650" id="1650">1650</a>
<a href="#1651" id="1651">1651</a>
<a href="#1652" id="1652">1652</a>
<a href="#1653" id="1653">1653</a>
<a href="#1654" id="1654">1654</a>
<a href="#1655" id="1655">1655</a>
<a href="#1656" id="1656">1656</a>
<a href="#1657" id="1657">1657</a>
<a href="#1658" id="1658">1658</a>
<a href="#1659" id="1659">1659</a>
<a href="#1660" id="1660">1660</a>
<a href="#1661" id="1661">1661</a>
<a href="#1662" id="1662">1662</a>
<a href="#1663" id="1663">1663</a>
<a href="#1664" id="1664">1664</a>
<a href="#1665" id="1665">1665</a>
<a href="#1666" id="1666">1666</a>
<a href="#1667" id="1667">1667</a>
<a href="#1668" id="1668">1668</a>
<a href="#1669" id="1669">1669</a>
<a href="#1670" id="1670">1670</a>
<a href="#1671" id="1671">1671</a>
<a href="#1672" id="1672">1672</a>
<a href="#1673" id="1673">1673</a>
<a href="#1674" id="1674">1674</a>
<a href="#1675" id="1675">1675</a>
<a href="#1676" id="1676">1676</a>
<a href="#1677" id="1677">1677</a>
<a href="#1678" id="1678">1678</a>
<a href="#1679" id="1679">1679</a>
<a href="#1680" id="1680">1680</a>
<a href="#1681" id="1681">1681</a>
<a href="#1682" id="1682">1682</a>
<a href="#1683" id="1683">1683</a>
<a href="#1684" id="1684">1684</a>
<a href="#1685" id="1685">1685</a>
<a href="#1686" id="1686">1686</a>
<a href="#1687" id="1687">1687</a>
<a href="#1688" id="1688">1688</a>
<a href="#1689" id="1689">1689</a>
<a href="#1690" id="1690">1690</a>
<a href="#1691" id="1691">1691</a>
<a href="#1692" id="1692">1692</a>
<a href="#1693" id="1693">1693</a>
<a href="#1694" id="1694">1694</a>
<a href="#1695" id="1695">1695</a>
<a href="#1696" id="1696">1696</a>
<a href="#1697" id="1697">1697</a>
<a href="#1698" id="1698">1698</a>
<a href="#1699" id="1699">1699</a>
<a href="#1700" id="1700">1700</a>
<a href="#1701" id="1701">1701</a>
<a href="#1702" id="1702">1702</a>
<a href="#1703" id="1703">1703</a>
<a href="#1704" id="1704">1704</a>
<a href="#1705" id="1705">1705</a>
<a href="#1706" id="1706">1706</a>
<a href="#1707" id="1707">1707</a>
<a href="#1708" id="1708">1708</a>
<a href="#1709" id="1709">1709</a>
<a href="#1710" id="1710">1710</a>
<a href="#1711" id="1711">1711</a>
<a href="#1712" id="1712">1712</a>
<a href="#1713" id="1713">1713</a>
<a href="#1714" id="1714">1714</a>
<a href="#1715" id="1715">1715</a>
<a href="#1716" id="1716">1716</a>
<a href="#1717" id="1717">1717</a>
<a href="#1718" id="1718">1718</a>
<a href="#1719" id="1719">1719</a>
<a href="#1720" id="1720">1720</a>
<a href="#1721" id="1721">1721</a>
<a href="#1722" id="1722">1722</a>
<a href="#1723" id="1723">1723</a>
<a href="#1724" id="1724">1724</a>
<a href="#1725" id="1725">1725</a>
<a href="#1726" id="1726">1726</a>
<a href="#1727" id="1727">1727</a>
<a href="#1728" id="1728">1728</a>
<a href="#1729" id="1729">1729</a>
<a href="#1730" id="1730">1730</a>
<a href="#1731" id="1731">1731</a>
<a href="#1732" id="1732">1732</a>
<a href="#1733" id="1733">1733</a>
<a href="#1734" id="1734">1734</a>
<a href="#1735" id="1735">1735</a>
<a href="#1736" id="1736">1736</a>
<a href="#1737" id="1737">1737</a>
<a href="#1738" id="1738">1738</a>
<a href="#1739" id="1739">1739</a>
<a href="#1740" id="1740">1740</a>
<a href="#1741" id="1741">1741</a>
<a href="#1742" id="1742">1742</a>
<a href="#1743" id="1743">1743</a>
<a href="#1744" id="1744">1744</a>
<a href="#1745" id="1745">1745</a>
<a href="#1746" id="1746">1746</a>
<a href="#1747" id="1747">1747</a>
<a href="#1748" id="1748">1748</a>
<a href="#1749" id="1749">1749</a>
<a href="#1750" id="1750">1750</a>
<a href="#1751" id="1751">1751</a>
<a href="#1752" id="1752">1752</a>
<a href="#1753" id="1753">1753</a>
<a href="#1754" id="1754">1754</a>
<a href="#1755" id="1755">1755</a>
<a href="#1756" id="1756">1756</a>
<a href="#1757" id="1757">1757</a>
<a href="#1758" id="1758">1758</a>
<a href="#1759" id="1759">1759</a>
<a href="#1760" id="1760">1760</a>
<a href="#1761" id="1761">1761</a>
<a href="#1762" id="1762">1762</a>
<a href="#1763" id="1763">1763</a>
<a href="#1764" id="1764">1764</a>
<a href="#1765" id="1765">1765</a>
<a href="#1766" id="1766">1766</a>
<a href="#1767" id="1767">1767</a>
<a href="#1768" id="1768">1768</a>
<a href="#1769" id="1769">1769</a>
<a href="#1770" id="1770">1770</a>
<a href="#1771" id="1771">1771</a>
<a href="#1772" id="1772">1772</a>
<a href="#1773" id="1773">1773</a>
<a href="#1774" id="1774">1774</a>
<a href="#1775" id="1775">1775</a>
<a href="#1776" id="1776">1776</a>
<a href="#1777" id="1777">1777</a>
<a href="#1778" id="1778">1778</a>
<a href="#1779" id="1779">1779</a>
<a href="#1780" id="1780">1780</a>
<a href="#1781" id="1781">1781</a>
<a href="#1782" id="1782">1782</a>
<a href="#1783" id="1783">1783</a>
<a href="#1784" id="1784">1784</a>
<a href="#1785" id="1785">1785</a>
<a href="#1786" id="1786">1786</a>
<a href="#1787" id="1787">1787</a>
<a href="#1788" id="1788">1788</a>
<a href="#1789" id="1789">1789</a>
<a href="#1790" id="1790">1790</a>
<a href="#1791" id="1791">1791</a>
<a href="#1792" id="1792">1792</a>
<a href="#1793" id="1793">1793</a>
<a href="#1794" id="1794">1794</a>
<a href="#1795" id="1795">1795</a>
<a href="#1796" id="1796">1796</a>
<a href="#1797" id="1797">1797</a>
<a href="#1798" id="1798">1798</a>
<a href="#1799" id="1799">1799</a>
<a href="#1800" id="1800">1800</a>
<a href="#1801" id="1801">1801</a>
<a href="#1802" id="1802">1802</a>
<a href="#1803" id="1803">1803</a>
<a href="#1804" id="1804">1804</a>
<a href="#1805" id="1805">1805</a>
<a href="#1806" id="1806">1806</a>
<a href="#1807" id="1807">1807</a>
<a href="#1808" id="1808">1808</a>
<a href="#1809" id="1809">1809</a>
<a href="#1810" id="1810">1810</a>
<a href="#1811" id="1811">1811</a>
<a href="#1812" id="1812">1812</a>
<a href="#1813" id="1813">1813</a>
<a href="#1814" id="1814">1814</a>
<a href="#1815" id="1815">1815</a>
<a href="#1816" id="1816">1816</a>
<a href="#1817" id="1817">1817</a>
<a href="#1818" id="1818">1818</a>
<a href="#1819" id="1819">1819</a>
<a href="#1820" id="1820">1820</a>
<a href="#1821" id="1821">1821</a>
<a href="#1822" id="1822">1822</a>
<a href="#1823" id="1823">1823</a>
<a href="#1824" id="1824">1824</a>
<a href="#1825" id="1825">1825</a>
<a href="#1826" id="1826">1826</a>
<a href="#1827" id="1827">1827</a>
<a href="#1828" id="1828">1828</a>
<a href="#1829" id="1829">1829</a>
<a href="#1830" id="1830">1830</a>
<a href="#1831" id="1831">1831</a>
<a href="#1832" id="1832">1832</a>
<a href="#1833" id="1833">1833</a>
<a href="#1834" id="1834">1834</a>
<a href="#1835" id="1835">1835</a>
<a href="#1836" id="1836">1836</a>
<a href="#1837" id="1837">1837</a>
<a href="#1838" id="1838">1838</a>
<a href="#1839" id="1839">1839</a>
<a href="#1840" id="1840">1840</a>
<a href="#1841" id="1841">1841</a>
<a href="#1842" id="1842">1842</a>
<a href="#1843" id="1843">1843</a>
<a href="#1844" id="1844">1844</a>
<a href="#1845" id="1845">1845</a>
<a href="#1846" id="1846">1846</a>
<a href="#1847" id="1847">1847</a>
<a href="#1848" id="1848">1848</a>
<a href="#1849" id="1849">1849</a>
<a href="#1850" id="1850">1850</a>
<a href="#1851" id="1851">1851</a>
<a href="#1852" id="1852">1852</a>
<a href="#1853" id="1853">1853</a>
<a href="#1854" id="1854">1854</a>
<a href="#1855" id="1855">1855</a>
<a href="#1856" id="1856">1856</a>
<a href="#1857" id="1857">1857</a>
<a href="#1858" id="1858">1858</a>
<a href="#1859" id="1859">1859</a>
<a href="#1860" id="1860">1860</a>
<a href="#1861" id="1861">1861</a>
<a href="#1862" id="1862">1862</a>
<a href="#1863" id="1863">1863</a>
<a href="#1864" id="1864">1864</a>
<a href="#1865" id="1865">1865</a>
<a href="#1866" id="1866">1866</a>
<a href="#1867" id="1867">1867</a>
<a href="#1868" id="1868">1868</a>
<a href="#1869" id="1869">1869</a>
<a href="#1870" id="1870">1870</a>
<a href="#1871" id="1871">1871</a>
<a href="#1872" id="1872">1872</a>
<a href="#1873" id="1873">1873</a>
<a href="#1874" id="1874">1874</a>
<a href="#1875" id="1875">1875</a>
<a href="#1876" id="1876">1876</a>
<a href="#1877" id="1877">1877</a>
<a href="#1878" id="1878">1878</a>
<a href="#1879" id="1879">1879</a>
<a href="#1880" id="1880">1880</a>
<a href="#1881" id="1881">1881</a>
<a href="#1882" id="1882">1882</a>
<a href="#1883" id="1883">1883</a>
<a href="#1884" id="1884">1884</a>
<a href="#1885" id="1885">1885</a>
<a href="#1886" id="1886">1886</a>
<a href="#1887" id="1887">1887</a>
<a href="#1888" id="1888">1888</a>
<a href="#1889" id="1889">1889</a>
<a href="#1890" id="1890">1890</a>
<a href="#1891" id="1891">1891</a>
<a href="#1892" id="1892">1892</a>
<a href="#1893" id="1893">1893</a>
<a href="#1894" id="1894">1894</a>
<a href="#1895" id="1895">1895</a>
<a href="#1896" id="1896">1896</a>
<a href="#1897" id="1897">1897</a>
<a href="#1898" id="1898">1898</a>
<a href="#1899" id="1899">1899</a>
<a href="#1900" id="1900">1900</a>
<a href="#1901" id="1901">1901</a>
<a href="#1902" id="1902">1902</a>
<a href="#1903" id="1903">1903</a>
<a href="#1904" id="1904">1904</a>
<a href="#1905" id="1905">1905</a>
<a href="#1906" id="1906">1906</a>
<a href="#1907" id="1907">1907</a>
<a href="#1908" id="1908">1908</a>
<a href="#1909" id="1909">1909</a>
<a href="#1910" id="1910">1910</a>
<a href="#1911" id="1911">1911</a>
<a href="#1912" id="1912">1912</a>
<a href="#1913" id="1913">1913</a>
<a href="#1914" id="1914">1914</a>
<a href="#1915" id="1915">1915</a>
<a href="#1916" id="1916">1916</a>
<a href="#1917" id="1917">1917</a>
<a href="#1918" id="1918">1918</a>
<a href="#1919" id="1919">1919</a>
<a href="#1920" id="1920">1920</a>
<a href="#1921" id="1921">1921</a>
<a href="#1922" id="1922">1922</a>
<a href="#1923" id="1923">1923</a>
<a href="#1924" id="1924">1924</a>
<a href="#1925" id="1925">1925</a>
<a href="#1926" id="1926">1926</a>
<a href="#1927" id="1927">1927</a>
<a href="#1928" id="1928">1928</a>
<a href="#1929" id="1929">1929</a>
<a href="#1930" id="1930">1930</a>
<a href="#1931" id="1931">1931</a>
<a href="#1932" id="1932">1932</a>
<a href="#1933" id="1933">1933</a>
<a href="#1934" id="1934">1934</a>
<a href="#1935" id="1935">1935</a>
<a href="#1936" id="1936">1936</a>
<a href="#1937" id="1937">1937</a>
<a href="#1938" id="1938">1938</a>
<a href="#1939" id="1939">1939</a>
<a href="#1940" id="1940">1940</a>
<a href="#1941" id="1941">1941</a>
<a href="#1942" id="1942">1942</a>
<a href="#1943" id="1943">1943</a>
<a href="#1944" id="1944">1944</a>
<a href="#1945" id="1945">1945</a>
<a href="#1946" id="1946">1946</a>
<a href="#1947" id="1947">1947</a>
<a href="#1948" id="1948">1948</a>
<a href="#1949" id="1949">1949</a>
<a href="#1950" id="1950">1950</a>
<a href="#1951" id="1951">1951</a>
<a href="#1952" id="1952">1952</a>
<a href="#1953" id="1953">1953</a>
<a href="#1954" id="1954">1954</a>
<a href="#1955" id="1955">1955</a>
<a href="#1956" id="1956">1956</a>
<a href="#1957" id="1957">1957</a>
<a href="#1958" id="1958">1958</a>
<a href="#1959" id="1959">1959</a>
<a href="#1960" id="1960">1960</a>
<a href="#1961" id="1961">1961</a>
<a href="#1962" id="1962">1962</a>
<a href="#1963" id="1963">1963</a>
<a href="#1964" id="1964">1964</a>
<a href="#1965" id="1965">1965</a>
<a href="#1966" id="1966">1966</a>
<a href="#1967" id="1967">1967</a>
<a href="#1968" id="1968">1968</a>
<a href="#1969" id="1969">1969</a>
<a href="#1970" id="1970">1970</a>
<a href="#1971" id="1971">1971</a>
<a href="#1972" id="1972">1972</a>
<a href="#1973" id="1973">1973</a>
<a href="#1974" id="1974">1974</a>
<a href="#1975" id="1975">1975</a>
<a href="#1976" id="1976">1976</a>
<a href="#1977" id="1977">1977</a>
<a href="#1978" id="1978">1978</a>
<a href="#1979" id="1979">1979</a>
<a href="#1980" id="1980">1980</a>
<a href="#1981" id="1981">1981</a>
<a href="#1982" id="1982">1982</a>
<a href="#1983" id="1983">1983</a>
<a href="#1984" id="1984">1984</a>
<a href="#1985" id="1985">1985</a>
<a href="#1986" id="1986">1986</a>
<a href="#1987" id="1987">1987</a>
<a href="#1988" id="1988">1988</a>
<a href="#1989" id="1989">1989</a>
<a href="#1990" id="1990">1990</a>
<a href="#1991" id="1991">1991</a>
<a href="#1992" id="1992">1992</a>
<a href="#1993" id="1993">1993</a>
<a href="#1994" id="1994">1994</a>
<a href="#1995" id="1995">1995</a>
<a href="#1996" id="1996">1996</a>
<a href="#1997" id="1997">1997</a>
<a href="#1998" id="1998">1998</a>
<a href="#1999" id="1999">1999</a>
<a href="#2000" id="2000">2000</a>
<a href="#2001" id="2001">2001</a>
<a href="#2002" id="2002">2002</a>
<a href="#2003" id="2003">2003</a>
<a href="#2004" id="2004">2004</a>
<a href="#2005" id="2005">2005</a>
<a href="#2006" id="2006">2006</a>
<a href="#2007" id="2007">2007</a>
<a href="#2008" id="2008">2008</a>
<a href="#2009" id="2009">2009</a>
<a href="#2010" id="2010">2010</a>
<a href="#2011" id="2011">2011</a>
<a href="#2012" id="2012">2012</a>
<a href="#2013" id="2013">2013</a>
<a href="#2014" id="2014">2014</a>
<a href="#2015" id="2015">2015</a>
<a href="#2016" id="2016">2016</a>
<a href="#2017" id="2017">2017</a>
<a href="#2018" id="2018">2018</a>
<a href="#2019" id="2019">2019</a>
<a href="#2020" id="2020">2020</a>
<a href="#2021" id="2021">2021</a>
<a href="#2022" id="2022">2022</a>
<a href="#2023" id="2023">2023</a>
<a href="#2024" id="2024">2024</a>
<a href="#2025" id="2025">2025</a>
<a href="#2026" id="2026">2026</a>
<a href="#2027" id="2027">2027</a>
<a href="#2028" id="2028">2028</a>
<a href="#2029" id="2029">2029</a>
<a href="#2030" id="2030">2030</a>
<a href="#2031" id="2031">2031</a>
<a href="#2032" id="2032">2032</a>
<a href="#2033" id="2033">2033</a>
<a href="#2034" id="2034">2034</a>
<a href="#2035" id="2035">2035</a>
<a href="#2036" id="2036">2036</a>
<a href="#2037" id="2037">2037</a>
<a href="#2038" id="2038">2038</a>
<a href="#2039" id="2039">2039</a>
<a href="#2040" id="2040">2040</a>
<a href="#2041" id="2041">2041</a>
<a href="#2042" id="2042">2042</a>
<a href="#2043" id="2043">2043</a>
<a href="#2044" id="2044">2044</a>
<a href="#2045" id="2045">2045</a>
<a href="#2046" id="2046">2046</a>
<a href="#2047" id="2047">2047</a>
<a href="#2048" id="2048">2048</a>
<a href="#2049" id="2049">2049</a>
<a href="#2050" id="2050">2050</a>
<a href="#2051" id="2051">2051</a>
<a href="#2052" id="2052">2052</a>
<a href="#2053" id="2053">2053</a>
<a href="#2054" id="2054">2054</a>
<a href="#2055" id="2055">2055</a>
<a href="#2056" id="2056">2056</a>
<a href="#2057" id="2057">2057</a>
<a href="#2058" id="2058">2058</a>
<a href="#2059" id="2059">2059</a>
<a href="#2060" id="2060">2060</a>
<a href="#2061" id="2061">2061</a>
<a href="#2062" id="2062">2062</a>
<a href="#2063" id="2063">2063</a>
<a href="#2064" id="2064">2064</a>
<a href="#2065" id="2065">2065</a>
<a href="#2066" id="2066">2066</a>
<a href="#2067" id="2067">2067</a>
<a href="#2068" id="2068">2068</a>
<a href="#2069" id="2069">2069</a>
<a href="#2070" id="2070">2070</a>
<a href="#2071" id="2071">2071</a>
<a href="#2072" id="2072">2072</a>
<a href="#2073" id="2073">2073</a>
<a href="#2074" id="2074">2074</a>
<a href="#2075" id="2075">2075</a>
<a href="#2076" id="2076">2076</a>
<a href="#2077" id="2077">2077</a>
<a href="#2078" id="2078">2078</a>
<a href="#2079" id="2079">2079</a>
<a href="#2080" id="2080">2080</a>
<a href="#2081" id="2081">2081</a>
<a href="#2082" id="2082">2082</a>
<a href="#2083" id="2083">2083</a>
<a href="#2084" id="2084">2084</a>
<a href="#2085" id="2085">2085</a>
<a href="#2086" id="2086">2086</a>
<a href="#2087" id="2087">2087</a>
<a href="#2088" id="2088">2088</a>
<a href="#2089" id="2089">2089</a>
<a href="#2090" id="2090">2090</a>
<a href="#2091" id="2091">2091</a>
<a href="#2092" id="2092">2092</a>
<a href="#2093" id="2093">2093</a>
<a href="#2094" id="2094">2094</a>
<a href="#2095" id="2095">2095</a>
<a href="#2096" id="2096">2096</a>
<a href="#2097" id="2097">2097</a>
<a href="#2098" id="2098">2098</a>
<a href="#2099" id="2099">2099</a>
<a href="#2100" id="2100">2100</a>
<a href="#2101" id="2101">2101</a>
<a href="#2102" id="2102">2102</a>
<a href="#2103" id="2103">2103</a>
<a href="#2104" id="2104">2104</a>
<a href="#2105" id="2105">2105</a>
<a href="#2106" id="2106">2106</a>
<a href="#2107" id="2107">2107</a>
<a href="#2108" id="2108">2108</a>
<a href="#2109" id="2109">2109</a>
<a href="#2110" id="2110">2110</a>
<a href="#2111" id="2111">2111</a>
<a href="#2112" id="2112">2112</a>
<a href="#2113" id="2113">2113</a>
<a href="#2114" id="2114">2114</a>
<a href="#2115" id="2115">2115</a>
<a href="#2116" id="2116">2116</a>
<a href="#2117" id="2117">2117</a>
<a href="#2118" id="2118">2118</a>
<a href="#2119" id="2119">2119</a>
<a href="#2120" id="2120">2120</a>
<a href="#2121" id="2121">2121</a>
<a href="#2122" id="2122">2122</a>
<a href="#2123" id="2123">2123</a>
<a href="#2124" id="2124">2124</a>
<a href="#2125" id="2125">2125</a>
<a href="#2126" id="2126">2126</a>
<a href="#2127" id="2127">2127</a>
<a href="#2128" id="2128">2128</a>
<a href="#2129" id="2129">2129</a>
<a href="#2130" id="2130">2130</a>
<a href="#2131" id="2131">2131</a>
<a href="#2132" id="2132">2132</a>
<a href="#2133" id="2133">2133</a>
<a href="#2134" id="2134">2134</a>
<a href="#2135" id="2135">2135</a>
<a href="#2136" id="2136">2136</a>
<a href="#2137" id="2137">2137</a>
<a href="#2138" id="2138">2138</a>
<a href="#2139" id="2139">2139</a>
<a href="#2140" id="2140">2140</a>
<a href="#2141" id="2141">2141</a>
<a href="#2142" id="2142">2142</a>
<a href="#2143" id="2143">2143</a>
<a href="#2144" id="2144">2144</a>
<a href="#2145" id="2145">2145</a>
<a href="#2146" id="2146">2146</a>
<a href="#2147" id="2147">2147</a>
<a href="#2148" id="2148">2148</a>
<a href="#2149" id="2149">2149</a>
<a href="#2150" id="2150">2150</a>
<a href="#2151" id="2151">2151</a>
<a href="#2152" id="2152">2152</a>
<a href="#2153" id="2153">2153</a>
<a href="#2154" id="2154">2154</a>
<a href="#2155" id="2155">2155</a>
<a href="#2156" id="2156">2156</a>
<a href="#2157" id="2157">2157</a>
<a href="#2158" id="2158">2158</a>
<a href="#2159" id="2159">2159</a>
<a href="#2160" id="2160">2160</a>
<a href="#2161" id="2161">2161</a>
<a href="#2162" id="2162">2162</a>
<a href="#2163" id="2163">2163</a>
<a href="#2164" id="2164">2164</a>
<a href="#2165" id="2165">2165</a>
<a href="#2166" id="2166">2166</a>
<a href="#2167" id="2167">2167</a>
<a href="#2168" id="2168">2168</a>
<a href="#2169" id="2169">2169</a>
<a href="#2170" id="2170">2170</a>
<a href="#2171" id="2171">2171</a>
<a href="#2172" id="2172">2172</a>
<a href="#2173" id="2173">2173</a>
<a href="#2174" id="2174">2174</a>
<a href="#2175" id="2175">2175</a>
<a href="#2176" id="2176">2176</a>
<a href="#2177" id="2177">2177</a>
<a href="#2178" id="2178">2178</a>
<a href="#2179" id="2179">2179</a>
<a href="#2180" id="2180">2180</a>
<a href="#2181" id="2181">2181</a>
<a href="#2182" id="2182">2182</a>
<a href="#2183" id="2183">2183</a>
<a href="#2184" id="2184">2184</a>
<a href="#2185" id="2185">2185</a>
<a href="#2186" id="2186">2186</a>
<a href="#2187" id="2187">2187</a>
<a href="#2188" id="2188">2188</a>
<a href="#2189" id="2189">2189</a>
<a href="#2190" id="2190">2190</a>
<a href="#2191" id="2191">2191</a>
<a href="#2192" id="2192">2192</a>
<a href="#2193" id="2193">2193</a>
<a href="#2194" id="2194">2194</a>
<a href="#2195" id="2195">2195</a>
<a href="#2196" id="2196">2196</a>
<a href="#2197" id="2197">2197</a>
<a href="#2198" id="2198">2198</a>
<a href="#2199" id="2199">2199</a>
<a href="#2200" id="2200">2200</a>
<a href="#2201" id="2201">2201</a>
<a href="#2202" id="2202">2202</a>
<a href="#2203" id="2203">2203</a>
<a href="#2204" id="2204">2204</a>
<a href="#2205" id="2205">2205</a>
<a href="#2206" id="2206">2206</a>
<a href="#2207" id="2207">2207</a>
<a href="#2208" id="2208">2208</a>
</pre></div><pre class="rust"><code><span class="comment">// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you 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.
</span><span class="doccomment">//! Contains [`ArrayData`], a generic representation of Arrow array data which encapsulates
//! common attributes and operations for Arrow array.
</span><span class="kw">use </span><span class="kw">crate</span>::bit_iterator::BitSliceIterator;
<span class="kw">use </span>arrow_buffer::buffer::{BooleanBuffer, NullBuffer};
<span class="kw">use </span>arrow_buffer::{bit_util, i256, ArrowNativeType, Buffer, MutableBuffer};
<span class="kw">use </span>arrow_schema::{ArrowError, DataType, UnionMode};
<span class="kw">use </span>std::ops::Range;
<span class="kw">use </span>std::sync::Arc;
<span class="kw">use </span>std::{mem, usize};
<span class="kw">use crate</span>::{equal, validate_binary_view, validate_string_view};
<span class="doccomment">/// A collection of [`Buffer`]
</span><span class="attr">#[doc(hidden)]
#[deprecated(note = <span class="string">"Use [Buffer]"</span>)]
</span><span class="kw">pub type </span>Buffers&lt;<span class="lifetime">'a</span>&gt; = <span class="kw-2">&amp;</span><span class="lifetime">'a </span>[Buffer];
<span class="attr">#[inline]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>contains_nulls(
null_bit_buffer: <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>NullBuffer&gt;,
offset: usize,
len: usize,
) -&gt; bool {
<span class="kw">match </span>null_bit_buffer {
<span class="prelude-val">Some</span>(buffer) =&gt; {
<span class="kw">match </span>BitSliceIterator::new(buffer.validity(), buffer.offset() + offset, len).next() {
<span class="prelude-val">Some</span>((start, end)) =&gt; start != <span class="number">0 </span>|| end != len,
<span class="prelude-val">None </span>=&gt; len != <span class="number">0</span>, <span class="comment">// No non-null values
</span>}
}
<span class="prelude-val">None </span>=&gt; <span class="bool-val">false</span>, <span class="comment">// No null buffer
</span>}
}
<span class="attr">#[inline]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>count_nulls(
null_bit_buffer: <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>NullBuffer&gt;,
offset: usize,
len: usize,
) -&gt; usize {
<span class="kw">if let </span><span class="prelude-val">Some</span>(buf) = null_bit_buffer {
<span class="kw">let </span>buffer = buf.buffer();
len - buffer.count_set_bits_offset(offset + buf.offset(), len)
} <span class="kw">else </span>{
<span class="number">0
</span>}
}
<span class="doccomment">/// creates 2 [`MutableBuffer`]s with a given `capacity` (in slots).
</span><span class="attr">#[inline]
</span><span class="kw">pub</span>(<span class="kw">crate</span>) <span class="kw">fn </span>new_buffers(data_type: <span class="kw-2">&amp;</span>DataType, capacity: usize) -&gt; [MutableBuffer; <span class="number">2</span>] {
<span class="kw">let </span>empty_buffer = MutableBuffer::new(<span class="number">0</span>);
<span class="kw">match </span>data_type {
DataType::Null =&gt; [empty_buffer, MutableBuffer::new(<span class="number">0</span>)],
DataType::Boolean =&gt; {
<span class="kw">let </span>bytes = bit_util::ceil(capacity, <span class="number">8</span>);
<span class="kw">let </span>buffer = MutableBuffer::new(bytes);
[buffer, empty_buffer]
}
DataType::UInt8
| DataType::UInt16
| DataType::UInt32
| DataType::UInt64
| DataType::Int8
| DataType::Int16
| DataType::Int32
| DataType::Int64
| DataType::Float16
| DataType::Float32
| DataType::Float64
| DataType::Date32
| DataType::Time32(<span class="kw">_</span>)
| DataType::Date64
| DataType::Time64(<span class="kw">_</span>)
| DataType::Duration(<span class="kw">_</span>)
| DataType::Timestamp(<span class="kw">_</span>, <span class="kw">_</span>)
| DataType::Interval(<span class="kw">_</span>) =&gt; [
MutableBuffer::new(capacity * data_type.primitive_width().unwrap()),
empty_buffer,
],
DataType::Utf8 | DataType::Binary =&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>buffer = MutableBuffer::new((<span class="number">1 </span>+ capacity) * mem::size_of::&lt;i32&gt;());
<span class="comment">// safety: `unsafe` code assumes that this buffer is initialized with one element
</span>buffer.push(<span class="number">0i32</span>);
[buffer, MutableBuffer::new(capacity * mem::size_of::&lt;u8&gt;())]
}
DataType::LargeUtf8 | DataType::LargeBinary =&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>buffer = MutableBuffer::new((<span class="number">1 </span>+ capacity) * mem::size_of::&lt;i64&gt;());
<span class="comment">// safety: `unsafe` code assumes that this buffer is initialized with one element
</span>buffer.push(<span class="number">0i64</span>);
[buffer, MutableBuffer::new(capacity * mem::size_of::&lt;u8&gt;())]
}
DataType::BinaryView | DataType::Utf8View =&gt; [
MutableBuffer::new(capacity * mem::size_of::&lt;u128&gt;()),
empty_buffer,
],
DataType::List(<span class="kw">_</span>) | DataType::Map(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; {
<span class="comment">// offset buffer always starts with a zero
</span><span class="kw">let </span><span class="kw-2">mut </span>buffer = MutableBuffer::new((<span class="number">1 </span>+ capacity) * mem::size_of::&lt;i32&gt;());
buffer.push(<span class="number">0i32</span>);
[buffer, empty_buffer]
}
DataType::ListView(<span class="kw">_</span>) =&gt; [
MutableBuffer::new(capacity * mem::size_of::&lt;i32&gt;()),
MutableBuffer::new(capacity * mem::size_of::&lt;i32&gt;()),
],
DataType::LargeList(<span class="kw">_</span>) =&gt; {
<span class="comment">// offset buffer always starts with a zero
</span><span class="kw">let </span><span class="kw-2">mut </span>buffer = MutableBuffer::new((<span class="number">1 </span>+ capacity) * mem::size_of::&lt;i64&gt;());
buffer.push(<span class="number">0i64</span>);
[buffer, empty_buffer]
}
DataType::LargeListView(<span class="kw">_</span>) =&gt; [
MutableBuffer::new(capacity * mem::size_of::&lt;i64&gt;()),
MutableBuffer::new(capacity * mem::size_of::&lt;i64&gt;()),
],
DataType::FixedSizeBinary(size) =&gt; {
[MutableBuffer::new(capacity * <span class="kw-2">*</span>size <span class="kw">as </span>usize), empty_buffer]
}
DataType::Dictionary(k, <span class="kw">_</span>) =&gt; [
MutableBuffer::new(capacity * k.primitive_width().unwrap()),
empty_buffer,
],
DataType::FixedSizeList(<span class="kw">_</span>, <span class="kw">_</span>) | DataType::Struct(<span class="kw">_</span>) | DataType::RunEndEncoded(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; {
[empty_buffer, MutableBuffer::new(<span class="number">0</span>)]
}
DataType::Decimal128(<span class="kw">_</span>, <span class="kw">_</span>) | DataType::Decimal256(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; [
MutableBuffer::new(capacity * mem::size_of::&lt;u8&gt;()),
empty_buffer,
],
DataType::Union(<span class="kw">_</span>, mode) =&gt; {
<span class="kw">let </span>type_ids = MutableBuffer::new(capacity * mem::size_of::&lt;i8&gt;());
<span class="kw">match </span>mode {
UnionMode::Sparse =&gt; [type_ids, empty_buffer],
UnionMode::Dense =&gt; {
<span class="kw">let </span>offsets = MutableBuffer::new(capacity * mem::size_of::&lt;i32&gt;());
[type_ids, offsets]
}
}
}
}
}
<span class="doccomment">/// A generic representation of Arrow array data which encapsulates common attributes and
/// operations for Arrow array. Specific operations for different arrays types (e.g.,
/// primitive, list, struct) are implemented in `Array`.
///
/// # Memory Layout
///
/// `ArrayData` has references to one or more underlying data buffers
/// and optional child ArrayData, depending on type as illustrated
/// below. Bitmaps are not shown for simplicity but they are stored
/// similarly to the buffers.
///
/// ```text
/// offset
/// points to
/// ┌───────────────────┐ start of ┌───────┐ Different
/// │ │ data │ │ ArrayData may
/// │ArrayData { │ │.... │ also refers to
/// │ data_type: ... │ ─ ─ ─ ─▶│1234 │ ┌ ─ the same
/// │ offset: ... ─ ─ ─│─ ┘ │4372 │ underlying
/// │ len: ... ─ ─ ─│─ ┐ │4888 │ │ buffer with different offset/len
/// │ buffers: [ │ │5882 │◀─
/// │ ... │ │ │4323 │
/// │ ] │ ─ ─ ─ ─▶│4859 │
/// │ child_data: [ │ │.... │
/// │ ... │ │ │
/// │ ] │ └───────┘
/// │} │
/// │ │ Shared Buffer uses
/// │ │ │ bytes::Bytes to hold
/// └───────────────────┘ actual data values
/// ┌ ─ ─ ┘
///
/// ▼
/// ┌───────────────────┐
/// │ArrayData { │
/// │ ... │
/// │} │
/// │ │
/// └───────────────────┘
///
/// Child ArrayData may also have its own buffers and children
/// ```
</span><span class="attr">#[derive(Debug, Clone)]
</span><span class="kw">pub struct </span>ArrayData {
<span class="doccomment">/// The data type for this array data
</span>data_type: DataType,
<span class="doccomment">/// The number of elements in this array data
</span>len: usize,
<span class="doccomment">/// The offset into this array data, in number of items
</span>offset: usize,
<span class="doccomment">/// The buffers for this array data. Note that depending on the array types, this
/// could hold different kinds of buffers (e.g., value buffer, value offset buffer)
/// at different positions.
</span>buffers: Vec&lt;Buffer&gt;,
<span class="doccomment">/// The child(ren) of this array. Only non-empty for nested types, currently
/// `ListArray` and `StructArray`.
</span>child_data: Vec&lt;ArrayData&gt;,
<span class="doccomment">/// The null bitmap. A `None` value for this indicates all values are non-null in
/// this array.
</span>nulls: <span class="prelude-ty">Option</span>&lt;NullBuffer&gt;,
}
<span class="kw">pub type </span>ArrayDataRef = Arc&lt;ArrayData&gt;;
<span class="kw">impl </span>ArrayData {
<span class="doccomment">/// Create a new ArrayData instance;
///
/// If `null_count` is not specified, the number of nulls in
/// null_bit_buffer is calculated.
///
/// If the number of nulls is 0 then the null_bit_buffer
/// is set to `None`.
///
/// # Safety
///
/// The input values *must* form a valid Arrow array for
/// `data_type`, or undefined behavior can result.
///
/// Note: This is a low level API and most users of the arrow
/// crate should create arrays using the methods in the `array`
/// module.
</span><span class="kw">pub unsafe fn </span>new_unchecked(
data_type: DataType,
len: usize,
null_count: <span class="prelude-ty">Option</span>&lt;usize&gt;,
null_bit_buffer: <span class="prelude-ty">Option</span>&lt;Buffer&gt;,
offset: usize,
buffers: Vec&lt;Buffer&gt;,
child_data: Vec&lt;ArrayData&gt;,
) -&gt; <span class="self">Self </span>{
ArrayDataBuilder {
data_type,
len,
null_count,
null_bit_buffer,
nulls: <span class="prelude-val">None</span>,
offset,
buffers,
child_data,
}
.build_unchecked()
}
<span class="doccomment">/// Create a new ArrayData, validating that the provided buffers form a valid
/// Arrow array of the specified data type.
///
/// If the number of nulls in `null_bit_buffer` is 0 then the null_bit_buffer
/// is set to `None`.
///
/// Internally this calls through to [`Self::validate_data`]
///
/// Note: This is a low level API and most users of the arrow crate should create
/// arrays using the builders found in [arrow_array](https://docs.rs/arrow-array)
</span><span class="kw">pub fn </span>try_new(
data_type: DataType,
len: usize,
null_bit_buffer: <span class="prelude-ty">Option</span>&lt;Buffer&gt;,
offset: usize,
buffers: Vec&lt;Buffer&gt;,
child_data: Vec&lt;ArrayData&gt;,
) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="self">Self</span>, ArrowError&gt; {
<span class="comment">// we must check the length of `null_bit_buffer` first
// because we use this buffer to calculate `null_count`
// in `Self::new_unchecked`.
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(null_bit_buffer) = null_bit_buffer.as_ref() {
<span class="kw">let </span>needed_len = bit_util::ceil(len + offset, <span class="number">8</span>);
<span class="kw">if </span>null_bit_buffer.len() &lt; needed_len {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"null_bit_buffer size too small. got {} needed {}"</span>,
null_bit_buffer.len(),
needed_len
)));
}
}
<span class="comment">// Safety justification: `validate_full` is called below
</span><span class="kw">let </span>new_self = <span class="kw">unsafe </span>{
<span class="self">Self</span>::new_unchecked(
data_type,
len,
<span class="prelude-val">None</span>,
null_bit_buffer,
offset,
buffers,
child_data,
)
};
<span class="comment">// As the data is not trusted, do a full validation of its contents
// We don't need to validate children as we can assume that the
// [`ArrayData`] in `child_data` have already been validated through
// a call to `ArrayData::try_new` or created using unsafe
</span>new_self.validate_data()<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(new_self)
}
<span class="doccomment">/// Returns a builder to construct a [`ArrayData`] instance of the same [`DataType`]
</span><span class="attr">#[inline]
</span><span class="kw">pub const fn </span>builder(data_type: DataType) -&gt; ArrayDataBuilder {
ArrayDataBuilder::new(data_type)
}
<span class="doccomment">/// Returns a reference to the [`DataType`] of this [`ArrayData`]
</span><span class="attr">#[inline]
</span><span class="kw">pub const fn </span>data_type(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>DataType {
<span class="kw-2">&amp;</span><span class="self">self</span>.data_type
}
<span class="doccomment">/// Returns the [`Buffer`] storing data for this [`ArrayData`]
</span><span class="kw">pub fn </span>buffers(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>[Buffer] {
<span class="kw-2">&amp;</span><span class="self">self</span>.buffers
}
<span class="doccomment">/// Returns a slice of children [`ArrayData`]. This will be non
/// empty for type such as lists and structs.
</span><span class="kw">pub fn </span>child_data(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="kw-2">&amp;</span>[ArrayData] {
<span class="kw-2">&amp;</span><span class="self">self</span>.child_data[..]
}
<span class="doccomment">/// Returns whether the element at index `i` is null
</span><span class="attr">#[inline]
</span><span class="kw">pub fn </span>is_null(<span class="kw-2">&amp;</span><span class="self">self</span>, i: usize) -&gt; bool {
<span class="kw">match </span><span class="kw-2">&amp;</span><span class="self">self</span>.nulls {
<span class="prelude-val">Some</span>(v) =&gt; v.is_null(i),
<span class="prelude-val">None </span>=&gt; <span class="bool-val">false</span>,
}
}
<span class="doccomment">/// Returns a reference to the null buffer of this [`ArrayData`] if any
///
/// Note: [`ArrayData::offset`] does NOT apply to the returned [`NullBuffer`]
</span><span class="attr">#[inline]
</span><span class="kw">pub fn </span>nulls(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>NullBuffer&gt; {
<span class="self">self</span>.nulls.as_ref()
}
<span class="doccomment">/// Returns whether the element at index `i` is not null
</span><span class="attr">#[inline]
</span><span class="kw">pub fn </span>is_valid(<span class="kw-2">&amp;</span><span class="self">self</span>, i: usize) -&gt; bool {
!<span class="self">self</span>.is_null(i)
}
<span class="doccomment">/// Returns the length (i.e., number of elements) of this [`ArrayData`].
</span><span class="attr">#[inline]
</span><span class="kw">pub const fn </span>len(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.len
}
<span class="doccomment">/// Returns whether this [`ArrayData`] is empty
</span><span class="attr">#[inline]
</span><span class="kw">pub const fn </span>is_empty(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; bool {
<span class="self">self</span>.len == <span class="number">0
</span>}
<span class="doccomment">/// Returns the offset of this [`ArrayData`]
</span><span class="attr">#[inline]
</span><span class="kw">pub const fn </span>offset(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.offset
}
<span class="doccomment">/// Returns the total number of nulls in this array
</span><span class="attr">#[inline]
</span><span class="kw">pub fn </span>null_count(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="self">self</span>.nulls
.as_ref()
.map(|x| x.null_count())
.unwrap_or_default()
}
<span class="doccomment">/// Returns the total number of bytes of memory occupied by the
/// buffers owned by this [`ArrayData`] and all of its
/// children. (See also diagram on [`ArrayData`]).
///
/// Note that this [`ArrayData`] may only refer to a subset of the
/// data in the underlying [`Buffer`]s (due to `offset` and
/// `length`), but the size returned includes the entire size of
/// the buffers.
///
/// If multiple [`ArrayData`]s refer to the same underlying
/// [`Buffer`]s they will both report the same size.
</span><span class="kw">pub fn </span>get_buffer_memory_size(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="kw">let </span><span class="kw-2">mut </span>size = <span class="number">0</span>;
<span class="kw">for </span>buffer <span class="kw">in </span><span class="kw-2">&amp;</span><span class="self">self</span>.buffers {
size += buffer.capacity();
}
<span class="kw">if let </span><span class="prelude-val">Some</span>(bitmap) = <span class="kw-2">&amp;</span><span class="self">self</span>.nulls {
size += bitmap.buffer().capacity()
}
<span class="kw">for </span>child <span class="kw">in </span><span class="kw-2">&amp;</span><span class="self">self</span>.child_data {
size += child.get_buffer_memory_size();
}
size
}
<span class="doccomment">/// Returns the total number of the bytes of memory occupied by
/// the buffers by this slice of [`ArrayData`] (See also diagram on [`ArrayData`]).
///
/// This is approximately the number of bytes if a new
/// [`ArrayData`] was formed by creating new [`Buffer`]s with
/// exactly the data needed.
///
/// For example, a [`DataType::Int64`] with `100` elements,
/// [`Self::get_slice_memory_size`] would return `100 * 8 = 800`. If
/// the [`ArrayData`] was then [`Self::slice`]ed to refer to its
/// first `20` elements, then [`Self::get_slice_memory_size`] on the
/// sliced [`ArrayData`] would return `20 * 8 = 160`.
</span><span class="kw">pub fn </span>get_slice_memory_size(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;usize, ArrowError&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>result: usize = <span class="number">0</span>;
<span class="kw">let </span>layout = layout(<span class="kw-2">&amp;</span><span class="self">self</span>.data_type);
<span class="kw">for </span>spec <span class="kw">in </span>layout.buffers.iter() {
<span class="kw">match </span>spec {
BufferSpec::FixedWidth { byte_width, .. } =&gt; {
<span class="kw">let </span>buffer_size = <span class="self">self</span>.len.checked_mul(<span class="kw-2">*</span>byte_width).ok_or_else(|| {
ArrowError::ComputeError(
<span class="string">"Integer overflow computing buffer size"</span>.to_string(),
)
})<span class="question-mark">?</span>;
result += buffer_size;
}
BufferSpec::VariableWidth =&gt; {
<span class="kw">let </span>buffer_len: usize;
<span class="kw">match </span><span class="self">self</span>.data_type {
DataType::Utf8 | DataType::Binary =&gt; {
<span class="kw">let </span>offsets = <span class="self">self</span>.typed_offsets::&lt;i32&gt;()<span class="question-mark">?</span>;
buffer_len = (offsets[<span class="self">self</span>.len] - offsets[<span class="number">0</span>] ) <span class="kw">as </span>usize;
}
DataType::LargeUtf8 | DataType::LargeBinary =&gt; {
<span class="kw">let </span>offsets = <span class="self">self</span>.typed_offsets::&lt;i64&gt;()<span class="question-mark">?</span>;
buffer_len = (offsets[<span class="self">self</span>.len] - offsets[<span class="number">0</span>]) <span class="kw">as </span>usize;
}
<span class="kw">_ </span>=&gt; {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::NotYetImplemented(<span class="macro">format!</span>(
<span class="string">"Invalid data type for VariableWidth buffer. Expected Utf8, LargeUtf8, Binary or LargeBinary. Got {}"</span>,
<span class="self">self</span>.data_type
)))
}
};
result += buffer_len;
}
BufferSpec::BitMap =&gt; {
<span class="kw">let </span>buffer_size = bit_util::ceil(<span class="self">self</span>.len, <span class="number">8</span>);
result += buffer_size;
}
BufferSpec::AlwaysNull =&gt; {
<span class="comment">// Nothing to do
</span>}
}
}
<span class="kw">if </span><span class="self">self</span>.nulls().is_some() {
result += bit_util::ceil(<span class="self">self</span>.len, <span class="number">8</span>);
}
<span class="kw">for </span>child <span class="kw">in </span><span class="kw-2">&amp;</span><span class="self">self</span>.child_data {
result += child.get_slice_memory_size()<span class="question-mark">?</span>;
}
<span class="prelude-val">Ok</span>(result)
}
<span class="doccomment">/// Returns the total number of bytes of memory occupied
/// physically by this [`ArrayData`] and all its [`Buffer`]s and
/// children. (See also diagram on [`ArrayData`]).
///
/// Equivalent to:
/// `size_of_val(self)` +
/// [`Self::get_buffer_memory_size`] +
/// `size_of_val(child)` for all children
</span><span class="kw">pub fn </span>get_array_memory_size(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; usize {
<span class="kw">let </span><span class="kw-2">mut </span>size = mem::size_of_val(<span class="self">self</span>);
<span class="comment">// Calculate rest of the fields top down which contain actual data
</span><span class="kw">for </span>buffer <span class="kw">in </span><span class="kw-2">&amp;</span><span class="self">self</span>.buffers {
size += mem::size_of::&lt;Buffer&gt;();
size += buffer.capacity();
}
<span class="kw">if let </span><span class="prelude-val">Some</span>(nulls) = <span class="kw-2">&amp;</span><span class="self">self</span>.nulls {
size += nulls.buffer().capacity();
}
<span class="kw">for </span>child <span class="kw">in </span><span class="kw-2">&amp;</span><span class="self">self</span>.child_data {
size += child.get_array_memory_size();
}
size
}
<span class="doccomment">/// Creates a zero-copy slice of itself. This creates a new
/// [`ArrayData`] pointing at the same underlying [`Buffer`]s with a
/// different offset and len
///
/// # Panics
///
/// Panics if `offset + length &gt; self.len()`.
</span><span class="kw">pub fn </span>slice(<span class="kw-2">&amp;</span><span class="self">self</span>, offset: usize, length: usize) -&gt; ArrayData {
<span class="macro">assert!</span>((offset + length) &lt;= <span class="self">self</span>.len());
<span class="kw">if let </span>DataType::Struct(<span class="kw">_</span>) = <span class="self">self</span>.data_type() {
<span class="comment">// Slice into children
</span><span class="kw">let </span>new_offset = <span class="self">self</span>.offset + offset;
<span class="kw">let </span>new_data = ArrayData {
data_type: <span class="self">self</span>.data_type().clone(),
len: length,
offset: new_offset,
buffers: <span class="self">self</span>.buffers.clone(),
<span class="comment">// Slice child data, to propagate offsets down to them
</span>child_data: <span class="self">self
</span>.child_data()
.iter()
.map(|data| data.slice(offset, length))
.collect(),
nulls: <span class="self">self</span>.nulls.as_ref().map(|x| x.slice(offset, length)),
};
new_data
} <span class="kw">else </span>{
<span class="kw">let </span><span class="kw-2">mut </span>new_data = <span class="self">self</span>.clone();
new_data.len = length;
new_data.offset = offset + <span class="self">self</span>.offset;
new_data.nulls = <span class="self">self</span>.nulls.as_ref().map(|x| x.slice(offset, length));
new_data
}
}
<span class="doccomment">/// Returns the `buffer` as a slice of type `T` starting at self.offset
/// # Panics
/// This function panics if:
/// * the buffer is not byte-aligned with type T, or
/// * the datatype is `Boolean` (it corresponds to a bit-packed buffer where the offset is not applicable)
</span><span class="kw">pub fn </span>buffer&lt;T: ArrowNativeType&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, buffer: usize) -&gt; <span class="kw-2">&amp;</span>[T] {
<span class="kw-2">&amp;</span><span class="self">self</span>.buffers()[buffer].typed_data()[<span class="self">self</span>.offset..]
}
<span class="doccomment">/// Returns a new [`ArrayData`] valid for `data_type` containing `len` null values
</span><span class="kw">pub fn </span>new_null(data_type: <span class="kw-2">&amp;</span>DataType, len: usize) -&gt; <span class="self">Self </span>{
<span class="kw">let </span>bit_len = bit_util::ceil(len, <span class="number">8</span>);
<span class="kw">let </span>zeroed = |len: usize| Buffer::from(MutableBuffer::from_len_zeroed(len));
<span class="kw">let </span>(buffers, child_data, has_nulls) = <span class="kw">match </span>data_type.primitive_width() {
<span class="prelude-val">Some</span>(width) =&gt; (<span class="macro">vec!</span>[zeroed(width * len)], <span class="macro">vec!</span>[], <span class="bool-val">true</span>),
<span class="prelude-val">None </span>=&gt; <span class="kw">match </span>data_type {
DataType::Null =&gt; (<span class="macro">vec!</span>[], <span class="macro">vec!</span>[], <span class="bool-val">false</span>),
DataType::Boolean =&gt; (<span class="macro">vec!</span>[zeroed(bit_len)], <span class="macro">vec!</span>[], <span class="bool-val">true</span>),
DataType::Binary | DataType::Utf8 =&gt; {
(<span class="macro">vec!</span>[zeroed((len + <span class="number">1</span>) * <span class="number">4</span>), zeroed(<span class="number">0</span>)], <span class="macro">vec!</span>[], <span class="bool-val">true</span>)
}
DataType::LargeBinary | DataType::LargeUtf8 =&gt; {
(<span class="macro">vec!</span>[zeroed((len + <span class="number">1</span>) * <span class="number">8</span>), zeroed(<span class="number">0</span>)], <span class="macro">vec!</span>[], <span class="bool-val">true</span>)
}
DataType::FixedSizeBinary(i) =&gt; (<span class="macro">vec!</span>[zeroed(<span class="kw-2">*</span>i <span class="kw">as </span>usize * len)], <span class="macro">vec!</span>[], <span class="bool-val">true</span>),
DataType::List(f) | DataType::Map(f, <span class="kw">_</span>) =&gt; (
<span class="macro">vec!</span>[zeroed((len + <span class="number">1</span>) * <span class="number">4</span>)],
<span class="macro">vec!</span>[ArrayData::new_empty(f.data_type())],
<span class="bool-val">true</span>,
),
DataType::LargeList(f) =&gt; (
<span class="macro">vec!</span>[zeroed((len + <span class="number">1</span>) * <span class="number">8</span>)],
<span class="macro">vec!</span>[ArrayData::new_empty(f.data_type())],
<span class="bool-val">true</span>,
),
DataType::FixedSizeList(f, list_len) =&gt; (
<span class="macro">vec!</span>[],
<span class="macro">vec!</span>[ArrayData::new_null(f.data_type(), <span class="kw-2">*</span>list_len <span class="kw">as </span>usize * len)],
<span class="bool-val">true</span>,
),
DataType::Struct(fields) =&gt; (
<span class="macro">vec!</span>[],
fields
.iter()
.map(|f| <span class="self">Self</span>::new_null(f.data_type(), len))
.collect(),
<span class="bool-val">true</span>,
),
DataType::Dictionary(k, v) =&gt; (
<span class="macro">vec!</span>[zeroed(k.primitive_width().unwrap() * len)],
<span class="macro">vec!</span>[ArrayData::new_empty(v.as_ref())],
<span class="bool-val">true</span>,
),
DataType::Union(f, mode) =&gt; {
<span class="kw">let </span>(id, <span class="kw">_</span>) = f.iter().next().unwrap();
<span class="kw">let </span>ids = Buffer::from_iter(std::iter::repeat(id).take(len));
<span class="kw">let </span>buffers = <span class="kw">match </span>mode {
UnionMode::Sparse =&gt; <span class="macro">vec!</span>[ids],
UnionMode::Dense =&gt; {
<span class="kw">let </span>end_offset = i32::from_usize(len).unwrap();
<span class="macro">vec!</span>[ids, Buffer::from_iter(<span class="number">0_i32</span>..end_offset)]
}
};
<span class="kw">let </span>children = f
.iter()
.enumerate()
.map(|(idx, (<span class="kw">_</span>, f))| {
<span class="kw">if </span>idx == <span class="number">0 </span>|| <span class="kw-2">*</span>mode == UnionMode::Sparse {
<span class="self">Self</span>::new_null(f.data_type(), len)
} <span class="kw">else </span>{
<span class="self">Self</span>::new_empty(f.data_type())
}
})
.collect();
(buffers, children, <span class="bool-val">false</span>)
}
DataType::RunEndEncoded(r, v) =&gt; {
<span class="kw">let </span>runs = <span class="kw">match </span>r.data_type() {
DataType::Int16 =&gt; {
<span class="kw">let </span>i = i16::from_usize(len).expect(<span class="string">"run overflow"</span>);
Buffer::from_slice_ref([i])
}
DataType::Int32 =&gt; {
<span class="kw">let </span>i = i32::from_usize(len).expect(<span class="string">"run overflow"</span>);
Buffer::from_slice_ref([i])
}
DataType::Int64 =&gt; {
<span class="kw">let </span>i = i64::from_usize(len).expect(<span class="string">"run overflow"</span>);
Buffer::from_slice_ref([i])
}
dt =&gt; <span class="macro">unreachable!</span>(<span class="string">"Invalid run ends data type {dt}"</span>),
};
<span class="kw">let </span>builder = ArrayData::builder(r.data_type().clone())
.len(<span class="number">1</span>)
.buffers(<span class="macro">vec!</span>[runs]);
<span class="comment">// SAFETY:
// Valid by construction
</span><span class="kw">let </span>runs = <span class="kw">unsafe </span>{ builder.build_unchecked() };
(
<span class="macro">vec!</span>[],
<span class="macro">vec!</span>[runs, ArrayData::new_null(v.data_type(), <span class="number">1</span>)],
<span class="bool-val">false</span>,
)
}
d =&gt; <span class="macro">unreachable!</span>(<span class="string">"{d}"</span>),
},
};
<span class="kw">let </span><span class="kw-2">mut </span>builder = ArrayDataBuilder::new(data_type.clone())
.len(len)
.buffers(buffers)
.child_data(child_data);
<span class="kw">if </span>has_nulls {
builder = builder.nulls(<span class="prelude-val">Some</span>(NullBuffer::new_null(len)))
}
<span class="comment">// SAFETY:
// Data valid by construction
</span><span class="kw">unsafe </span>{ builder.build_unchecked() }
}
<span class="doccomment">/// Returns a new empty [ArrayData] valid for `data_type`.
</span><span class="kw">pub fn </span>new_empty(data_type: <span class="kw-2">&amp;</span>DataType) -&gt; <span class="self">Self </span>{
<span class="self">Self</span>::new_null(data_type, <span class="number">0</span>)
}
<span class="doccomment">/// Verifies that the buffers meet the minimum alignment requirements for the data type
///
/// Buffers that are not adequately aligned will be copied to a new aligned allocation
///
/// This can be useful for when interacting with data sent over IPC or FFI, that may
/// not meet the minimum alignment requirements
</span><span class="kw">pub fn </span>align_buffers(<span class="kw-2">&amp;mut </span><span class="self">self</span>) {
<span class="kw">let </span>layout = layout(<span class="kw-2">&amp;</span><span class="self">self</span>.data_type);
<span class="kw">for </span>(buffer, spec) <span class="kw">in </span><span class="self">self</span>.buffers.iter_mut().zip(<span class="kw-2">&amp;</span>layout.buffers) {
<span class="kw">if let </span>BufferSpec::FixedWidth { alignment, .. } = spec {
<span class="kw">if </span>buffer.as_ptr().align_offset(<span class="kw-2">*</span>alignment) != <span class="number">0 </span>{
<span class="kw-2">*</span>buffer = Buffer::from_slice_ref(buffer.as_ref())
}
}
}
}
<span class="doccomment">/// "cheap" validation of an `ArrayData`. Ensures buffers are
/// sufficiently sized to store `len` + `offset` total elements of
/// `data_type` and performs other inexpensive consistency checks.
///
/// This check is "cheap" in the sense that it does not validate the
/// contents of the buffers (e.g. that all offsets for UTF8 arrays
/// are within the bounds of the values buffer).
///
/// See [ArrayData::validate_data] to validate fully the offset content
/// and the validity of utf8 data
</span><span class="kw">pub fn </span>validate(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt; {
<span class="comment">// Need at least this mich space in each buffer
</span><span class="kw">let </span>len_plus_offset = <span class="self">self</span>.len + <span class="self">self</span>.offset;
<span class="comment">// Check that the data layout conforms to the spec
</span><span class="kw">let </span>layout = layout(<span class="kw-2">&amp;</span><span class="self">self</span>.data_type);
<span class="kw">if </span>!layout.can_contain_null_mask &amp;&amp; <span class="self">self</span>.nulls.is_some() {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Arrays of type {:?} cannot contain a null bitmask"</span>,
<span class="self">self</span>.data_type,
)));
}
<span class="comment">// Check data buffers length for view types and other types
</span><span class="kw">if </span><span class="self">self</span>.buffers.len() &lt; layout.buffers.len()
|| (!layout.variadic &amp;&amp; <span class="self">self</span>.buffers.len() != layout.buffers.len())
{
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Expected {} buffers in array of type {:?}, got {}"</span>,
layout.buffers.len(),
<span class="self">self</span>.data_type,
<span class="self">self</span>.buffers.len(),
)));
}
<span class="kw">for </span>(i, (buffer, spec)) <span class="kw">in </span><span class="self">self</span>.buffers.iter().zip(layout.buffers.iter()).enumerate() {
<span class="kw">match </span>spec {
BufferSpec::FixedWidth {
byte_width,
alignment,
} =&gt; {
<span class="kw">let </span>min_buffer_size = len_plus_offset.saturating_mul(<span class="kw-2">*</span>byte_width);
<span class="kw">if </span>buffer.len() &lt; min_buffer_size {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Need at least {} bytes in buffers[{}] in array of type {:?}, but got {}"</span>,
min_buffer_size, i, <span class="self">self</span>.data_type, buffer.len()
)));
}
<span class="kw">let </span>align_offset = buffer.as_ptr().align_offset(<span class="kw-2">*</span>alignment);
<span class="kw">if </span>align_offset != <span class="number">0 </span>{
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Misaligned buffers[{i}] in array of type {:?}, offset from expected alignment of {alignment} by {}"</span>,
<span class="self">self</span>.data_type, align_offset.min(alignment - align_offset)
)));
}
}
BufferSpec::VariableWidth =&gt; {
<span class="comment">// not cheap to validate (need to look at the
// data). Partially checked in validate_offsets
// called below. Can check with `validate_full`
</span>}
BufferSpec::BitMap =&gt; {
<span class="kw">let </span>min_buffer_size = bit_util::ceil(len_plus_offset, <span class="number">8</span>);
<span class="kw">if </span>buffer.len() &lt; min_buffer_size {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Need at least {} bytes for bitmap in buffers[{}] in array of type {:?}, but got {}"</span>,
min_buffer_size, i, <span class="self">self</span>.data_type, buffer.len()
)));
}
}
BufferSpec::AlwaysNull =&gt; {
<span class="comment">// Nothing to validate
</span>}
}
}
<span class="comment">// check null bit buffer size
</span><span class="kw">if let </span><span class="prelude-val">Some</span>(nulls) = <span class="self">self</span>.nulls() {
<span class="kw">if </span>nulls.null_count() &gt; <span class="self">self</span>.len {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"null_count {} for an array exceeds length of {} elements"</span>,
nulls.null_count(),
<span class="self">self</span>.len
)));
}
<span class="kw">let </span>actual_len = nulls.validity().len();
<span class="kw">let </span>needed_len = bit_util::ceil(len_plus_offset, <span class="number">8</span>);
<span class="kw">if </span>actual_len &lt; needed_len {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"null_bit_buffer size too small. got {actual_len} needed {needed_len}"</span>,
)));
}
<span class="kw">if </span>nulls.len() != <span class="self">self</span>.len {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"null buffer incorrect size. got {} expected {}"</span>,
nulls.len(),
<span class="self">self</span>.len
)));
}
}
<span class="self">self</span>.validate_child_data()<span class="question-mark">?</span>;
<span class="comment">// Additional Type specific checks
</span><span class="kw">match </span><span class="kw-2">&amp;</span><span class="self">self</span>.data_type {
DataType::Utf8 | DataType::Binary =&gt; {
<span class="self">self</span>.validate_offsets::&lt;i32&gt;(<span class="self">self</span>.buffers[<span class="number">1</span>].len())<span class="question-mark">?</span>;
}
DataType::LargeUtf8 | DataType::LargeBinary =&gt; {
<span class="self">self</span>.validate_offsets::&lt;i64&gt;(<span class="self">self</span>.buffers[<span class="number">1</span>].len())<span class="question-mark">?</span>;
}
DataType::Dictionary(key_type, _value_type) =&gt; {
<span class="comment">// At the moment, constructing a DictionaryArray will also check this
</span><span class="kw">if </span>!DataType::is_dictionary_key_type(key_type) {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Dictionary key type must be integer, but was {key_type}"
</span>)));
}
}
DataType::RunEndEncoded(run_ends_type, <span class="kw">_</span>) =&gt; {
<span class="kw">if </span>run_ends_type.is_nullable() {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(
<span class="string">"The nullable should be set to false for the field defining run_ends array."</span>.to_string()
));
}
<span class="kw">if </span>!DataType::is_run_ends_type(run_ends_type.data_type()) {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"RunArray run_ends types must be Int16, Int32 or Int64, but was {}"</span>,
run_ends_type.data_type()
)));
}
}
<span class="kw">_ </span>=&gt; {}
};
<span class="prelude-val">Ok</span>(())
}
<span class="doccomment">/// Returns a reference to the data in `buffer` as a typed slice
/// (typically `&amp;[i32]` or `&amp;[i64]`) after validating. The
/// returned slice is guaranteed to have at least `self.len + 1`
/// entries.
///
/// For an empty array, the `buffer` can also be empty.
</span><span class="kw">fn </span>typed_offsets&lt;T: ArrowNativeType + num::Num&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="kw-2">&amp;</span>[T], ArrowError&gt; {
<span class="comment">// An empty list-like array can have 0 offsets
</span><span class="kw">if </span><span class="self">self</span>.len == <span class="number">0 </span>&amp;&amp; <span class="self">self</span>.buffers[<span class="number">0</span>].is_empty() {
<span class="kw">return </span><span class="prelude-val">Ok</span>(<span class="kw-2">&amp;</span>[]);
}
<span class="self">self</span>.typed_buffer(<span class="number">0</span>, <span class="self">self</span>.len + <span class="number">1</span>)
}
<span class="doccomment">/// Returns a reference to the data in `buffers[idx]` as a typed slice after validating
</span><span class="kw">fn </span>typed_buffer&lt;T: ArrowNativeType + num::Num&gt;(
<span class="kw-2">&amp;</span><span class="self">self</span>,
idx: usize,
len: usize,
) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="kw-2">&amp;</span>[T], ArrowError&gt; {
<span class="kw">let </span>buffer = <span class="kw-2">&amp;</span><span class="self">self</span>.buffers[idx];
<span class="kw">let </span>required_len = (len + <span class="self">self</span>.offset) * mem::size_of::&lt;T&gt;();
<span class="kw">if </span>buffer.len() &lt; required_len {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Buffer {} of {} isn't large enough. Expected {} bytes got {}"</span>,
idx,
<span class="self">self</span>.data_type,
required_len,
buffer.len()
)));
}
<span class="prelude-val">Ok</span>(<span class="kw-2">&amp;</span>buffer.typed_data::&lt;T&gt;()[<span class="self">self</span>.offset..<span class="self">self</span>.offset + len])
}
<span class="doccomment">/// Does a cheap sanity check that the `self.len` values in `buffer` are valid
/// offsets (of type T) into some other buffer of `values_length` bytes long
</span><span class="kw">fn </span>validate_offsets&lt;T: ArrowNativeType + num::Num + std::fmt::Display&gt;(
<span class="kw-2">&amp;</span><span class="self">self</span>,
values_length: usize,
) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt; {
<span class="comment">// Justification: buffer size was validated above
</span><span class="kw">let </span>offsets = <span class="self">self</span>.typed_offsets::&lt;T&gt;()<span class="question-mark">?</span>;
<span class="kw">if </span>offsets.is_empty() {
<span class="kw">return </span><span class="prelude-val">Ok</span>(());
}
<span class="kw">let </span>first_offset = offsets[<span class="number">0</span>].to_usize().ok_or_else(|| {
ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Error converting offset[0] ({}) to usize for {}"</span>,
offsets[<span class="number">0</span>], <span class="self">self</span>.data_type
))
})<span class="question-mark">?</span>;
<span class="kw">let </span>last_offset = offsets[<span class="self">self</span>.len].to_usize().ok_or_else(|| {
ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Error converting offset[{}] ({}) to usize for {}"</span>,
<span class="self">self</span>.len, offsets[<span class="self">self</span>.len], <span class="self">self</span>.data_type
))
})<span class="question-mark">?</span>;
<span class="kw">if </span>first_offset &gt; values_length {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"First offset {} of {} is larger than values length {}"</span>,
first_offset, <span class="self">self</span>.data_type, values_length,
)));
}
<span class="kw">if </span>last_offset &gt; values_length {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Last offset {} of {} is larger than values length {}"</span>,
last_offset, <span class="self">self</span>.data_type, values_length,
)));
}
<span class="kw">if </span>first_offset &gt; last_offset {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"First offset {} in {} is smaller than last offset {}"</span>,
first_offset, <span class="self">self</span>.data_type, last_offset,
)));
}
<span class="prelude-val">Ok</span>(())
}
<span class="doccomment">/// Does a cheap sanity check that the `self.len` values in `buffer` are valid
/// offsets and sizes (of type T) into some other buffer of `values_length` bytes long
</span><span class="kw">fn </span>validate_offsets_and_sizes&lt;T: ArrowNativeType + num::Num + std::fmt::Display&gt;(
<span class="kw-2">&amp;</span><span class="self">self</span>,
values_length: usize,
) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt; {
<span class="kw">let </span>offsets: <span class="kw-2">&amp;</span>[T] = <span class="self">self</span>.typed_buffer(<span class="number">0</span>, <span class="self">self</span>.len)<span class="question-mark">?</span>;
<span class="kw">let </span>sizes: <span class="kw-2">&amp;</span>[T] = <span class="self">self</span>.typed_buffer(<span class="number">1</span>, <span class="self">self</span>.len)<span class="question-mark">?</span>;
<span class="kw">for </span>i <span class="kw">in </span><span class="number">0</span>..values_length {
<span class="kw">let </span>size = sizes[i].to_usize().ok_or_else(|| {
ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Error converting size[{}] ({}) to usize for {}"</span>,
i, sizes[i], <span class="self">self</span>.data_type
))
})<span class="question-mark">?</span>;
<span class="kw">let </span>offset = offsets[i].to_usize().ok_or_else(|| {
ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Error converting offset[{}] ({}) to usize for {}"</span>,
i, offsets[i], <span class="self">self</span>.data_type
))
})<span class="question-mark">?</span>;
<span class="kw">if </span>size
.checked_add(offset)
.expect(<span class="string">"Offset and size have exceeded the usize boundary"</span>)
&gt; values_length
{
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Size {} at index {} is larger than the remaining values for {}"</span>,
size, i, <span class="self">self</span>.data_type
)));
}
}
<span class="prelude-val">Ok</span>(())
}
<span class="doccomment">/// Validates the layout of `child_data` ArrayData structures
</span><span class="kw">fn </span>validate_child_data(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt; {
<span class="kw">match </span><span class="kw-2">&amp;</span><span class="self">self</span>.data_type {
DataType::List(field) | DataType::Map(field, <span class="kw">_</span>) =&gt; {
<span class="kw">let </span>values_data = <span class="self">self</span>.get_single_valid_child_data(field.data_type())<span class="question-mark">?</span>;
<span class="self">self</span>.validate_offsets::&lt;i32&gt;(values_data.len)<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(())
}
DataType::LargeList(field) =&gt; {
<span class="kw">let </span>values_data = <span class="self">self</span>.get_single_valid_child_data(field.data_type())<span class="question-mark">?</span>;
<span class="self">self</span>.validate_offsets::&lt;i64&gt;(values_data.len)<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(())
}
DataType::ListView(field) =&gt; {
<span class="kw">let </span>values_data = <span class="self">self</span>.get_single_valid_child_data(field.data_type())<span class="question-mark">?</span>;
<span class="self">self</span>.validate_offsets_and_sizes::&lt;i32&gt;(values_data.len)<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(())
}
DataType::LargeListView(field) =&gt; {
<span class="kw">let </span>values_data = <span class="self">self</span>.get_single_valid_child_data(field.data_type())<span class="question-mark">?</span>;
<span class="self">self</span>.validate_offsets_and_sizes::&lt;i64&gt;(values_data.len)<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(())
}
DataType::FixedSizeList(field, list_size) =&gt; {
<span class="kw">let </span>values_data = <span class="self">self</span>.get_single_valid_child_data(field.data_type())<span class="question-mark">?</span>;
<span class="kw">let </span>list_size: usize = (<span class="kw-2">*</span>list_size).try_into().map_err(|<span class="kw">_</span>| {
ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"{} has a negative list_size {}"</span>,
<span class="self">self</span>.data_type, list_size
))
})<span class="question-mark">?</span>;
<span class="kw">let </span>expected_values_len = <span class="self">self</span>.len
.checked_mul(list_size)
.expect(<span class="string">"integer overflow computing expected number of expected values in FixedListSize"</span>);
<span class="kw">if </span>values_data.len &lt; expected_values_len {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Values length {} is less than the length ({}) multiplied by the value size ({}) for {}"</span>,
values_data.len, list_size, list_size, <span class="self">self</span>.data_type
)));
}
<span class="prelude-val">Ok</span>(())
}
DataType::Struct(fields) =&gt; {
<span class="self">self</span>.validate_num_child_data(fields.len())<span class="question-mark">?</span>;
<span class="kw">for </span>(i, field) <span class="kw">in </span>fields.iter().enumerate() {
<span class="kw">let </span>field_data = <span class="self">self</span>.get_valid_child_data(i, field.data_type())<span class="question-mark">?</span>;
<span class="comment">// Ensure child field has sufficient size
</span><span class="kw">if </span>field_data.len &lt; <span class="self">self</span>.len {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"{} child array #{} for field {} has length smaller than expected for struct array ({} &lt; {})"</span>,
<span class="self">self</span>.data_type, i, field.name(), field_data.len, <span class="self">self</span>.len
)));
}
}
<span class="prelude-val">Ok</span>(())
}
DataType::RunEndEncoded(run_ends_field, values_field) =&gt; {
<span class="self">self</span>.validate_num_child_data(<span class="number">2</span>)<span class="question-mark">?</span>;
<span class="kw">let </span>run_ends_data = <span class="self">self</span>.get_valid_child_data(<span class="number">0</span>, run_ends_field.data_type())<span class="question-mark">?</span>;
<span class="kw">let </span>values_data = <span class="self">self</span>.get_valid_child_data(<span class="number">1</span>, values_field.data_type())<span class="question-mark">?</span>;
<span class="kw">if </span>run_ends_data.len != values_data.len {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"The run_ends array length should be the same as values array length. Run_ends array length is {}, values array length is {}"</span>,
run_ends_data.len, values_data.len
)));
}
<span class="kw">if </span>run_ends_data.nulls.is_some() {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(
<span class="string">"Found null values in run_ends array. The run_ends array should not have null values."</span>.to_string(),
));
}
<span class="prelude-val">Ok</span>(())
}
DataType::Union(fields, mode) =&gt; {
<span class="self">self</span>.validate_num_child_data(fields.len())<span class="question-mark">?</span>;
<span class="kw">for </span>(i, (<span class="kw">_</span>, field)) <span class="kw">in </span>fields.iter().enumerate() {
<span class="kw">let </span>field_data = <span class="self">self</span>.get_valid_child_data(i, field.data_type())<span class="question-mark">?</span>;
<span class="kw">if </span>mode == <span class="kw-2">&amp;</span>UnionMode::Sparse &amp;&amp; field_data.len &lt; (<span class="self">self</span>.len + <span class="self">self</span>.offset) {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Sparse union child array #{} has length smaller than expected for union array ({} &lt; {})"</span>,
i, field_data.len, <span class="self">self</span>.len + <span class="self">self</span>.offset
)));
}
}
<span class="prelude-val">Ok</span>(())
}
DataType::Dictionary(_key_type, value_type) =&gt; {
<span class="self">self</span>.get_single_valid_child_data(value_type)<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(())
}
<span class="kw">_ </span>=&gt; {
<span class="comment">// other types do not have child data
</span><span class="kw">if </span>!<span class="self">self</span>.child_data.is_empty() {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Expected no child arrays for type {} but got {}"</span>,
<span class="self">self</span>.data_type,
<span class="self">self</span>.child_data.len()
)));
}
<span class="prelude-val">Ok</span>(())
}
}
}
<span class="doccomment">/// Ensures that this array data has a single child_data with the
/// expected type, and calls `validate()` on it. Returns a
/// reference to that child_data
</span><span class="kw">fn </span>get_single_valid_child_data(
<span class="kw-2">&amp;</span><span class="self">self</span>,
expected_type: <span class="kw-2">&amp;</span>DataType,
) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="kw-2">&amp;</span>ArrayData, ArrowError&gt; {
<span class="self">self</span>.validate_num_child_data(<span class="number">1</span>)<span class="question-mark">?</span>;
<span class="self">self</span>.get_valid_child_data(<span class="number">0</span>, expected_type)
}
<span class="doccomment">/// Returns `Err` if self.child_data does not have exactly `expected_len` elements
</span><span class="kw">fn </span>validate_num_child_data(<span class="kw-2">&amp;</span><span class="self">self</span>, expected_len: usize) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt; {
<span class="kw">if </span><span class="self">self</span>.child_data.len() != expected_len {
<span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Value data for {} should contain {} child data array(s), had {}"</span>,
<span class="self">self</span>.data_type,
expected_len,
<span class="self">self</span>.child_data.len()
)))
} <span class="kw">else </span>{
<span class="prelude-val">Ok</span>(())
}
}
<span class="doccomment">/// Ensures that `child_data[i]` has the expected type, calls
/// `validate()` on it, and returns a reference to that child_data
</span><span class="kw">fn </span>get_valid_child_data(
<span class="kw-2">&amp;</span><span class="self">self</span>,
i: usize,
expected_type: <span class="kw-2">&amp;</span>DataType,
) -&gt; <span class="prelude-ty">Result</span>&lt;<span class="kw-2">&amp;</span>ArrayData, ArrowError&gt; {
<span class="kw">let </span>values_data = <span class="self">self</span>.child_data.get(i).ok_or_else(|| {
ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"{} did not have enough child arrays. Expected at least {} but had only {}"</span>,
<span class="self">self</span>.data_type,
i + <span class="number">1</span>,
<span class="self">self</span>.child_data.len()
))
})<span class="question-mark">?</span>;
<span class="kw">if </span>expected_type != <span class="kw-2">&amp;</span>values_data.data_type {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Child type mismatch for {}. Expected {} but child data had {}"</span>,
<span class="self">self</span>.data_type, expected_type, values_data.data_type
)));
}
values_data.validate()<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(values_data)
}
<span class="doccomment">/// Validate that the data contained within this [`ArrayData`] is valid
///
/// 1. Null count is correct
/// 2. All offsets are valid
/// 3. All String data is valid UTF-8
/// 4. All dictionary offsets are valid
///
/// Internally this calls:
///
/// * [`Self::validate`]
/// * [`Self::validate_nulls`]
/// * [`Self::validate_values`]
///
/// Note: this does not recurse into children, for a recursive variant
/// see [`Self::validate_full`]
</span><span class="kw">pub fn </span>validate_data(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt; {
<span class="self">self</span>.validate()<span class="question-mark">?</span>;
<span class="self">self</span>.validate_nulls()<span class="question-mark">?</span>;
<span class="self">self</span>.validate_values()<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(())
}
<span class="doccomment">/// Performs a full recursive validation of this [`ArrayData`] and all its children
///
/// This is equivalent to calling [`Self::validate_data`] on this [`ArrayData`]
/// and all its children recursively
</span><span class="kw">pub fn </span>validate_full(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt; {
<span class="self">self</span>.validate_data()<span class="question-mark">?</span>;
<span class="comment">// validate all children recursively
</span><span class="self">self</span>.child_data
.iter()
.enumerate()
.try_for_each(|(i, child_data)| {
child_data.validate_full().map_err(|e| {
ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"{} child #{} invalid: {}"</span>,
<span class="self">self</span>.data_type, i, e
))
})
})<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(())
}
<span class="doccomment">/// Validates the values stored within this [`ArrayData`] are valid
/// without recursing into child [`ArrayData`]
///
/// Does not (yet) check
/// 1. Union type_ids are valid see [#85](https://github.com/apache/arrow-rs/issues/85)
/// Validates the the null count is correct and that any
/// nullability requirements of its children are correct
</span><span class="kw">pub fn </span>validate_nulls(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt; {
<span class="kw">if let </span><span class="prelude-val">Some</span>(nulls) = <span class="kw-2">&amp;</span><span class="self">self</span>.nulls {
<span class="kw">let </span>actual = nulls.len() - nulls.inner().count_set_bits();
<span class="kw">if </span>actual != nulls.null_count() {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"null_count value ({}) doesn't match actual number of nulls in array ({})"</span>,
nulls.null_count(),
actual
)));
}
}
<span class="comment">// In general non-nullable children should not contain nulls, however, for certain
// types, such as StructArray and FixedSizeList, nulls in the parent take up
// space in the child. As such we permit nulls in the children in the corresponding
// positions for such types
</span><span class="kw">match </span><span class="kw-2">&amp;</span><span class="self">self</span>.data_type {
DataType::List(f) | DataType::LargeList(f) | DataType::Map(f, <span class="kw">_</span>) =&gt; {
<span class="kw">if </span>!f.is_nullable() {
<span class="self">self</span>.validate_non_nullable(<span class="prelude-val">None</span>, <span class="kw-2">&amp;</span><span class="self">self</span>.child_data[<span class="number">0</span>])<span class="question-mark">?
</span>}
}
DataType::FixedSizeList(field, len) =&gt; {
<span class="kw">let </span>child = <span class="kw-2">&amp;</span><span class="self">self</span>.child_data[<span class="number">0</span>];
<span class="kw">if </span>!field.is_nullable() {
<span class="kw">match </span><span class="kw-2">&amp;</span><span class="self">self</span>.nulls {
<span class="prelude-val">Some</span>(nulls) =&gt; {
<span class="kw">let </span>element_len = <span class="kw-2">*</span>len <span class="kw">as </span>usize;
<span class="kw">let </span>expanded = nulls.expand(element_len);
<span class="self">self</span>.validate_non_nullable(<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>expanded), child)<span class="question-mark">?</span>;
}
<span class="prelude-val">None </span>=&gt; <span class="self">self</span>.validate_non_nullable(<span class="prelude-val">None</span>, child)<span class="question-mark">?</span>,
}
}
}
DataType::Struct(fields) =&gt; {
<span class="kw">for </span>(field, child) <span class="kw">in </span>fields.iter().zip(<span class="kw-2">&amp;</span><span class="self">self</span>.child_data) {
<span class="kw">if </span>!field.is_nullable() {
<span class="self">self</span>.validate_non_nullable(<span class="self">self</span>.nulls(), child)<span class="question-mark">?
</span>}
}
}
<span class="kw">_ </span>=&gt; {}
}
<span class="prelude-val">Ok</span>(())
}
<span class="doccomment">/// Verifies that `child` contains no nulls not present in `mask`
</span><span class="kw">fn </span>validate_non_nullable(
<span class="kw-2">&amp;</span><span class="self">self</span>,
mask: <span class="prelude-ty">Option</span>&lt;<span class="kw-2">&amp;</span>NullBuffer&gt;,
child: <span class="kw-2">&amp;</span>ArrayData,
) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt; {
<span class="kw">let </span>mask = <span class="kw">match </span>mask {
<span class="prelude-val">Some</span>(mask) =&gt; mask,
<span class="prelude-val">None </span>=&gt; {
<span class="kw">return match </span>child.null_count() {
<span class="number">0 </span>=&gt; <span class="prelude-val">Ok</span>(()),
<span class="kw">_ </span>=&gt; <span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"non-nullable child of type {} contains nulls not present in parent {}"</span>,
child.data_type, <span class="self">self</span>.data_type
))),
}
}
};
<span class="kw">match </span>child.nulls() {
<span class="prelude-val">Some</span>(nulls) <span class="kw">if </span>!mask.contains(nulls) =&gt; <span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"non-nullable child of type {} contains nulls not present in parent"</span>,
child.data_type
))),
<span class="kw">_ </span>=&gt; <span class="prelude-val">Ok</span>(()),
}
}
<span class="doccomment">/// Validates the values stored within this [`ArrayData`] are valid
/// without recursing into child [`ArrayData`]
///
/// Does not (yet) check
/// 1. Union type_ids are valid see [#85](https://github.com/apache/arrow-rs/issues/85)
</span><span class="kw">pub fn </span>validate_values(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt; {
<span class="kw">match </span><span class="kw-2">&amp;</span><span class="self">self</span>.data_type {
DataType::Utf8 =&gt; <span class="self">self</span>.validate_utf8::&lt;i32&gt;(),
DataType::LargeUtf8 =&gt; <span class="self">self</span>.validate_utf8::&lt;i64&gt;(),
DataType::Binary =&gt; <span class="self">self</span>.validate_offsets_full::&lt;i32&gt;(<span class="self">self</span>.buffers[<span class="number">1</span>].len()),
DataType::LargeBinary =&gt; <span class="self">self</span>.validate_offsets_full::&lt;i64&gt;(<span class="self">self</span>.buffers[<span class="number">1</span>].len()),
DataType::BinaryView =&gt; {
<span class="kw">let </span>views = <span class="self">self</span>.typed_buffer::&lt;u128&gt;(<span class="number">0</span>, <span class="self">self</span>.len)<span class="question-mark">?</span>;
validate_binary_view(views, <span class="kw-2">&amp;</span><span class="self">self</span>.buffers[<span class="number">1</span>..])
}
DataType::Utf8View =&gt; {
<span class="kw">let </span>views = <span class="self">self</span>.typed_buffer::&lt;u128&gt;(<span class="number">0</span>, <span class="self">self</span>.len)<span class="question-mark">?</span>;
validate_string_view(views, <span class="kw-2">&amp;</span><span class="self">self</span>.buffers[<span class="number">1</span>..])
}
DataType::List(<span class="kw">_</span>) | DataType::Map(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; {
<span class="kw">let </span>child = <span class="kw-2">&amp;</span><span class="self">self</span>.child_data[<span class="number">0</span>];
<span class="self">self</span>.validate_offsets_full::&lt;i32&gt;(child.len)
}
DataType::LargeList(<span class="kw">_</span>) =&gt; {
<span class="kw">let </span>child = <span class="kw-2">&amp;</span><span class="self">self</span>.child_data[<span class="number">0</span>];
<span class="self">self</span>.validate_offsets_full::&lt;i64&gt;(child.len)
}
DataType::Union(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; {
<span class="comment">// Validate Union Array as part of implementing new Union semantics
// See comments in `ArrayData::validate()`
// https://github.com/apache/arrow-rs/issues/85
//
// TODO file follow on ticket for full union validation
</span><span class="prelude-val">Ok</span>(())
}
DataType::Dictionary(key_type, _value_type) =&gt; {
<span class="kw">let </span>dictionary_length: i64 = <span class="self">self</span>.child_data[<span class="number">0</span>].len.try_into().unwrap();
<span class="kw">let </span>max_value = dictionary_length - <span class="number">1</span>;
<span class="kw">match </span>key_type.as_ref() {
DataType::UInt8 =&gt; <span class="self">self</span>.check_bounds::&lt;u8&gt;(max_value),
DataType::UInt16 =&gt; <span class="self">self</span>.check_bounds::&lt;u16&gt;(max_value),
DataType::UInt32 =&gt; <span class="self">self</span>.check_bounds::&lt;u32&gt;(max_value),
DataType::UInt64 =&gt; <span class="self">self</span>.check_bounds::&lt;u64&gt;(max_value),
DataType::Int8 =&gt; <span class="self">self</span>.check_bounds::&lt;i8&gt;(max_value),
DataType::Int16 =&gt; <span class="self">self</span>.check_bounds::&lt;i16&gt;(max_value),
DataType::Int32 =&gt; <span class="self">self</span>.check_bounds::&lt;i32&gt;(max_value),
DataType::Int64 =&gt; <span class="self">self</span>.check_bounds::&lt;i64&gt;(max_value),
<span class="kw">_ </span>=&gt; <span class="macro">unreachable!</span>(),
}
}
DataType::RunEndEncoded(run_ends, _values) =&gt; {
<span class="kw">let </span>run_ends_data = <span class="self">self</span>.child_data()[<span class="number">0</span>].clone();
<span class="kw">match </span>run_ends.data_type() {
DataType::Int16 =&gt; run_ends_data.check_run_ends::&lt;i16&gt;(),
DataType::Int32 =&gt; run_ends_data.check_run_ends::&lt;i32&gt;(),
DataType::Int64 =&gt; run_ends_data.check_run_ends::&lt;i64&gt;(),
<span class="kw">_ </span>=&gt; <span class="macro">unreachable!</span>(),
}
}
<span class="kw">_ </span>=&gt; {
<span class="comment">// No extra validation check required for other types
</span><span class="prelude-val">Ok</span>(())
}
}
}
<span class="doccomment">/// Calls the `validate(item_index, range)` function for each of
/// the ranges specified in the arrow offsets buffer of type
/// `T`. Also validates that each offset is smaller than
/// `offset_limit`
///
/// For an empty array, the offsets buffer can either be empty
/// or contain a single `0`.
///
/// For example, the offsets buffer contained `[1, 2, 4]`, this
/// function would call `validate([1,2])`, and `validate([2,4])`
</span><span class="kw">fn </span>validate_each_offset&lt;T, V&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, offset_limit: usize, validate: V) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt;
<span class="kw">where
</span>T: ArrowNativeType + TryInto&lt;usize&gt; + num::Num + std::fmt::Display,
V: Fn(usize, Range&lt;usize&gt;) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt;,
{
<span class="self">self</span>.typed_offsets::&lt;T&gt;()<span class="question-mark">?
</span>.iter()
.enumerate()
.map(|(i, x)| {
<span class="comment">// check if the offset can be converted to usize
</span><span class="kw">let </span>r = x.to_usize().ok_or_else(|| {
ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Offset invariant failure: Could not convert offset {x} to usize at position {i}"</span>))}
);
<span class="comment">// check if the offset exceeds the limit
</span><span class="kw">match </span>r {
<span class="prelude-val">Ok</span>(n) <span class="kw">if </span>n &lt;= offset_limit =&gt; <span class="prelude-val">Ok</span>((i, n)),
<span class="prelude-val">Ok</span>(<span class="kw">_</span>) =&gt; <span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Offset invariant failure: offset at position {i} out of bounds: {x} &gt; {offset_limit}"</span>))
),
<span class="prelude-val">Err</span>(e) =&gt; <span class="prelude-val">Err</span>(e),
}
})
.scan(<span class="number">0_usize</span>, |start, end| {
<span class="comment">// check offsets are monotonically increasing
</span><span class="kw">match </span>end {
<span class="prelude-val">Ok</span>((i, end)) <span class="kw">if </span><span class="kw-2">*</span>start &lt;= end =&gt; {
<span class="kw">let </span>range = <span class="prelude-val">Some</span>(<span class="prelude-val">Ok</span>((i, <span class="kw-2">*</span>start..end)));
<span class="kw-2">*</span>start = end;
range
}
<span class="prelude-val">Ok</span>((i, end)) =&gt; <span class="prelude-val">Some</span>(<span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Offset invariant failure: non-monotonic offset at slot {}: {} &gt; {}"</span>,
i - <span class="number">1</span>, start, end))
)),
<span class="prelude-val">Err</span>(err) =&gt; <span class="prelude-val">Some</span>(<span class="prelude-val">Err</span>(err)),
}
})
.skip(<span class="number">1</span>) <span class="comment">// the first element is meaningless
</span>.try_for_each(|res: <span class="prelude-ty">Result</span>&lt;(usize, Range&lt;usize&gt;), ArrowError&gt;| {
<span class="kw">let </span>(item_index, range) = res<span class="question-mark">?</span>;
validate(item_index-<span class="number">1</span>, range)
})
}
<span class="doccomment">/// Ensures that all strings formed by the offsets in `buffers[0]`
/// into `buffers[1]` are valid utf8 sequences
</span><span class="kw">fn </span>validate_utf8&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt;
<span class="kw">where
</span>T: ArrowNativeType + TryInto&lt;usize&gt; + num::Num + std::fmt::Display,
{
<span class="kw">let </span>values_buffer = <span class="kw-2">&amp;</span><span class="self">self</span>.buffers[<span class="number">1</span>].as_slice();
<span class="kw">if let </span><span class="prelude-val">Ok</span>(values_str) = std::str::from_utf8(values_buffer) {
<span class="comment">// Validate Offsets are correct
</span><span class="self">self</span>.validate_each_offset::&lt;T, <span class="kw">_</span>&gt;(values_buffer.len(), |string_index, range| {
<span class="kw">if </span>!values_str.is_char_boundary(range.start)
|| !values_str.is_char_boundary(range.end)
{
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"incomplete utf-8 byte sequence from index {string_index}"
</span>)));
}
<span class="prelude-val">Ok</span>(())
})
} <span class="kw">else </span>{
<span class="comment">// find specific offset that failed utf8 validation
</span><span class="self">self</span>.validate_each_offset::&lt;T, <span class="kw">_</span>&gt;(values_buffer.len(), |string_index, range| {
std::str::from_utf8(<span class="kw-2">&amp;</span>values_buffer[range.clone()]).map_err(|e| {
ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Invalid UTF8 sequence at string index {string_index} ({range:?}): {e}"
</span>))
})<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(())
})
}
}
<span class="doccomment">/// Ensures that all offsets in `buffers[0]` into `buffers[1]` are
/// between `0` and `offset_limit`
</span><span class="kw">fn </span>validate_offsets_full&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, offset_limit: usize) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt;
<span class="kw">where
</span>T: ArrowNativeType + TryInto&lt;usize&gt; + num::Num + std::fmt::Display,
{
<span class="self">self</span>.validate_each_offset::&lt;T, <span class="kw">_</span>&gt;(offset_limit, |_string_index, _range| {
<span class="comment">// No validation applied to each value, but the iteration
// itself applies bounds checking to each range
</span><span class="prelude-val">Ok</span>(())
})
}
<span class="doccomment">/// Validates that each value in self.buffers (typed as T)
/// is within the range [0, max_value], inclusive
</span><span class="kw">fn </span>check_bounds&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>, max_value: i64) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt;
<span class="kw">where
</span>T: ArrowNativeType + TryInto&lt;i64&gt; + num::Num + std::fmt::Display,
{
<span class="kw">let </span>required_len = <span class="self">self</span>.len + <span class="self">self</span>.offset;
<span class="kw">let </span>buffer = <span class="kw-2">&amp;</span><span class="self">self</span>.buffers[<span class="number">0</span>];
<span class="comment">// This should have been checked as part of `validate()` prior
// to calling `validate_full()` but double check to be sure
</span><span class="macro">assert!</span>(buffer.len() / mem::size_of::&lt;T&gt;() &gt;= required_len);
<span class="comment">// Justification: buffer size was validated above
</span><span class="kw">let </span>indexes: <span class="kw-2">&amp;</span>[T] = <span class="kw-2">&amp;</span>buffer.typed_data::&lt;T&gt;()[<span class="self">self</span>.offset..<span class="self">self</span>.offset + <span class="self">self</span>.len];
indexes.iter().enumerate().try_for_each(|(i, <span class="kw-2">&amp;</span>dict_index)| {
<span class="comment">// Do not check the value is null (value can be arbitrary)
</span><span class="kw">if </span><span class="self">self</span>.is_null(i) {
<span class="kw">return </span><span class="prelude-val">Ok</span>(());
}
<span class="kw">let </span>dict_index: i64 = dict_index.try_into().map_err(|<span class="kw">_</span>| {
ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Value at position {i} out of bounds: {dict_index} (can not convert to i64)"
</span>))
})<span class="question-mark">?</span>;
<span class="kw">if </span>dict_index &lt; <span class="number">0 </span>|| dict_index &gt; max_value {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Value at position {i} out of bounds: {dict_index} (should be in [0, {max_value}])"
</span>)));
}
<span class="prelude-val">Ok</span>(())
})
}
<span class="doccomment">/// Validates that each value in run_ends array is positive and strictly increasing.
</span><span class="kw">fn </span>check_run_ends&lt;T&gt;(<span class="kw-2">&amp;</span><span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;(), ArrowError&gt;
<span class="kw">where
</span>T: ArrowNativeType + TryInto&lt;i64&gt; + num::Num + std::fmt::Display,
{
<span class="kw">let </span>values = <span class="self">self</span>.typed_buffer::&lt;T&gt;(<span class="number">0</span>, <span class="self">self</span>.len)<span class="question-mark">?</span>;
<span class="kw">let </span><span class="kw-2">mut </span>prev_value: i64 = <span class="number">0_i64</span>;
values.iter().enumerate().try_for_each(|(ix, <span class="kw-2">&amp;</span>inp_value)| {
<span class="kw">let </span>value: i64 = inp_value.try_into().map_err(|<span class="kw">_</span>| {
ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"Value at position {ix} out of bounds: {inp_value} (can not convert to i64)"
</span>))
})<span class="question-mark">?</span>;
<span class="kw">if </span>value &lt;= <span class="number">0_i64 </span>{
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"The values in run_ends array should be strictly positive. Found value {value} at index {ix} that does not match the criteria."
</span>)));
}
<span class="kw">if </span>ix &gt; <span class="number">0 </span>&amp;&amp; value &lt;= prev_value {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"The values in run_ends array should be strictly increasing. Found value {value} at index {ix} with previous value {prev_value} that does not match the criteria."
</span>)));
}
prev_value = value;
<span class="prelude-val">Ok</span>(())
})<span class="question-mark">?</span>;
<span class="kw">if </span>prev_value.as_usize() &lt; (<span class="self">self</span>.offset + <span class="self">self</span>.len) {
<span class="kw">return </span><span class="prelude-val">Err</span>(ArrowError::InvalidArgumentError(<span class="macro">format!</span>(
<span class="string">"The offset + length of array should be less or equal to last value in the run_ends array. The last value of run_ends array is {prev_value} and offset + length of array is {}."</span>,
<span class="self">self</span>.offset + <span class="self">self</span>.len
)));
}
<span class="prelude-val">Ok</span>(())
}
<span class="doccomment">/// Returns true if this `ArrayData` is equal to `other`, using pointer comparisons
/// to determine buffer equality. This is cheaper than `PartialEq::eq` but may
/// return false when the arrays are logically equal
</span><span class="kw">pub fn </span>ptr_eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span><span class="self">Self</span>) -&gt; bool {
<span class="kw">if </span><span class="self">self</span>.offset != other.offset
|| <span class="self">self</span>.len != other.len
|| <span class="self">self</span>.data_type != other.data_type
|| <span class="self">self</span>.buffers.len() != other.buffers.len()
|| <span class="self">self</span>.child_data.len() != other.child_data.len()
{
<span class="kw">return </span><span class="bool-val">false</span>;
}
<span class="kw">match </span>(<span class="kw-2">&amp;</span><span class="self">self</span>.nulls, <span class="kw-2">&amp;</span>other.nulls) {
(<span class="prelude-val">Some</span>(a), <span class="prelude-val">Some</span>(b)) <span class="kw">if </span>!a.inner().ptr_eq(b.inner()) =&gt; <span class="kw">return </span><span class="bool-val">false</span>,
(<span class="prelude-val">Some</span>(<span class="kw">_</span>), <span class="prelude-val">None</span>) | (<span class="prelude-val">None</span>, <span class="prelude-val">Some</span>(<span class="kw">_</span>)) =&gt; <span class="kw">return </span><span class="bool-val">false</span>,
<span class="kw">_ </span>=&gt; {}
};
<span class="kw">if </span>!<span class="self">self
</span>.buffers
.iter()
.zip(other.buffers.iter())
.all(|(a, b)| a.as_ptr() == b.as_ptr())
{
<span class="kw">return </span><span class="bool-val">false</span>;
}
<span class="self">self</span>.child_data
.iter()
.zip(other.child_data.iter())
.all(|(a, b)| a.ptr_eq(b))
}
<span class="doccomment">/// Converts this [`ArrayData`] into an [`ArrayDataBuilder`]
</span><span class="kw">pub fn </span>into_builder(<span class="self">self</span>) -&gt; ArrayDataBuilder {
<span class="self">self</span>.into()
}
}
<span class="doccomment">/// Return the expected [`DataTypeLayout`] Arrays of this data
/// type are expected to have
</span><span class="kw">pub fn </span>layout(data_type: <span class="kw-2">&amp;</span>DataType) -&gt; DataTypeLayout {
<span class="comment">// based on C/C++ implementation in
// https://github.com/apache/arrow/blob/661c7d749150905a63dd3b52e0a04dac39030d95/cpp/src/arrow/type.h (and .cc)
</span><span class="kw">use </span>arrow_schema::IntervalUnit::<span class="kw-2">*</span>;
<span class="kw">match </span>data_type {
DataType::Null =&gt; DataTypeLayout {
buffers: <span class="macro">vec!</span>[],
can_contain_null_mask: <span class="bool-val">false</span>,
variadic: <span class="bool-val">false</span>,
},
DataType::Boolean =&gt; DataTypeLayout {
buffers: <span class="macro">vec!</span>[BufferSpec::BitMap],
can_contain_null_mask: <span class="bool-val">true</span>,
variadic: <span class="bool-val">false</span>,
},
DataType::Int8 =&gt; DataTypeLayout::new_fixed_width::&lt;i8&gt;(),
DataType::Int16 =&gt; DataTypeLayout::new_fixed_width::&lt;i16&gt;(),
DataType::Int32 =&gt; DataTypeLayout::new_fixed_width::&lt;i32&gt;(),
DataType::Int64 =&gt; DataTypeLayout::new_fixed_width::&lt;i64&gt;(),
DataType::UInt8 =&gt; DataTypeLayout::new_fixed_width::&lt;u8&gt;(),
DataType::UInt16 =&gt; DataTypeLayout::new_fixed_width::&lt;u16&gt;(),
DataType::UInt32 =&gt; DataTypeLayout::new_fixed_width::&lt;u32&gt;(),
DataType::UInt64 =&gt; DataTypeLayout::new_fixed_width::&lt;u64&gt;(),
DataType::Float16 =&gt; DataTypeLayout::new_fixed_width::&lt;half::f16&gt;(),
DataType::Float32 =&gt; DataTypeLayout::new_fixed_width::&lt;f32&gt;(),
DataType::Float64 =&gt; DataTypeLayout::new_fixed_width::&lt;f64&gt;(),
DataType::Timestamp(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; DataTypeLayout::new_fixed_width::&lt;i64&gt;(),
DataType::Date32 =&gt; DataTypeLayout::new_fixed_width::&lt;i32&gt;(),
DataType::Date64 =&gt; DataTypeLayout::new_fixed_width::&lt;i64&gt;(),
DataType::Time32(<span class="kw">_</span>) =&gt; DataTypeLayout::new_fixed_width::&lt;i32&gt;(),
DataType::Time64(<span class="kw">_</span>) =&gt; DataTypeLayout::new_fixed_width::&lt;i64&gt;(),
DataType::Interval(YearMonth) =&gt; DataTypeLayout::new_fixed_width::&lt;i32&gt;(),
DataType::Interval(DayTime) =&gt; DataTypeLayout::new_fixed_width::&lt;i64&gt;(),
DataType::Interval(MonthDayNano) =&gt; DataTypeLayout::new_fixed_width::&lt;i128&gt;(),
DataType::Duration(<span class="kw">_</span>) =&gt; DataTypeLayout::new_fixed_width::&lt;i64&gt;(),
DataType::Decimal128(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; DataTypeLayout::new_fixed_width::&lt;i128&gt;(),
DataType::Decimal256(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; DataTypeLayout::new_fixed_width::&lt;i256&gt;(),
DataType::FixedSizeBinary(size) =&gt; {
<span class="kw">let </span>spec = BufferSpec::FixedWidth {
byte_width: (<span class="kw-2">*</span>size).try_into().unwrap(),
alignment: mem::align_of::&lt;u8&gt;(),
};
DataTypeLayout {
buffers: <span class="macro">vec!</span>[spec],
can_contain_null_mask: <span class="bool-val">true</span>,
variadic: <span class="bool-val">false</span>,
}
}
DataType::Binary =&gt; DataTypeLayout::new_binary::&lt;i32&gt;(),
DataType::LargeBinary =&gt; DataTypeLayout::new_binary::&lt;i64&gt;(),
DataType::Utf8 =&gt; DataTypeLayout::new_binary::&lt;i32&gt;(),
DataType::LargeUtf8 =&gt; DataTypeLayout::new_binary::&lt;i64&gt;(),
DataType::BinaryView | DataType::Utf8View =&gt; DataTypeLayout::new_view(),
DataType::FixedSizeList(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; DataTypeLayout::new_nullable_empty(), <span class="comment">// all in child data
</span>DataType::List(<span class="kw">_</span>) =&gt; DataTypeLayout::new_fixed_width::&lt;i32&gt;(),
DataType::ListView(<span class="kw">_</span>) =&gt; DataTypeLayout::new_list_view::&lt;i32&gt;(),
DataType::LargeListView(<span class="kw">_</span>) =&gt; DataTypeLayout::new_list_view::&lt;i64&gt;(),
DataType::LargeList(<span class="kw">_</span>) =&gt; DataTypeLayout::new_fixed_width::&lt;i64&gt;(),
DataType::Map(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; DataTypeLayout::new_fixed_width::&lt;i32&gt;(),
DataType::Struct(<span class="kw">_</span>) =&gt; DataTypeLayout::new_nullable_empty(), <span class="comment">// all in child data,
</span>DataType::RunEndEncoded(<span class="kw">_</span>, <span class="kw">_</span>) =&gt; DataTypeLayout::new_empty(), <span class="comment">// all in child data,
</span>DataType::Union(<span class="kw">_</span>, mode) =&gt; {
<span class="kw">let </span>type_ids = BufferSpec::FixedWidth {
byte_width: mem::size_of::&lt;i8&gt;(),
alignment: mem::align_of::&lt;i8&gt;(),
};
DataTypeLayout {
buffers: <span class="kw">match </span>mode {
UnionMode::Sparse =&gt; {
<span class="macro">vec!</span>[type_ids]
}
UnionMode::Dense =&gt; {
<span class="macro">vec!</span>[
type_ids,
BufferSpec::FixedWidth {
byte_width: mem::size_of::&lt;i32&gt;(),
alignment: mem::align_of::&lt;i32&gt;(),
},
]
}
},
can_contain_null_mask: <span class="bool-val">false</span>,
variadic: <span class="bool-val">false</span>,
}
}
DataType::Dictionary(key_type, _value_type) =&gt; layout(key_type),
}
}
<span class="doccomment">/// Layout specification for a data type
</span><span class="attr">#[derive(Debug, PartialEq, Eq)]
</span><span class="comment">// Note: Follows structure from C++: https://github.com/apache/arrow/blob/master/cpp/src/arrow/type.h#L91
</span><span class="kw">pub struct </span>DataTypeLayout {
<span class="doccomment">/// A vector of buffer layout specifications, one for each expected buffer
</span><span class="kw">pub </span>buffers: Vec&lt;BufferSpec&gt;,
<span class="doccomment">/// Can contain a null bitmask
</span><span class="kw">pub </span>can_contain_null_mask: bool,
<span class="doccomment">/// This field only applies to the view type [`DataType::BinaryView`] and [`DataType::Utf8View`]
/// If `variadic` is true, the number of buffers expected is only lower-bounded by
/// buffers.len(). Buffers that exceed the lower bound are legal.
</span><span class="kw">pub </span>variadic: bool,
}
<span class="kw">impl </span>DataTypeLayout {
<span class="doccomment">/// Describes a basic numeric array where each element has type `T`
</span><span class="kw">pub fn </span>new_fixed_width&lt;T&gt;() -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
buffers: <span class="macro">vec!</span>[BufferSpec::FixedWidth {
byte_width: mem::size_of::&lt;T&gt;(),
alignment: mem::align_of::&lt;T&gt;(),
}],
can_contain_null_mask: <span class="bool-val">true</span>,
variadic: <span class="bool-val">false</span>,
}
}
<span class="doccomment">/// Describes arrays which have no data of their own
/// but may still have a Null Bitmap (e.g. FixedSizeList)
</span><span class="kw">pub fn </span>new_nullable_empty() -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
buffers: <span class="macro">vec!</span>[],
can_contain_null_mask: <span class="bool-val">true</span>,
variadic: <span class="bool-val">false</span>,
}
}
<span class="doccomment">/// Describes arrays which have no data of their own
/// (e.g. RunEndEncoded).
</span><span class="kw">pub fn </span>new_empty() -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
buffers: <span class="macro">vec!</span>[],
can_contain_null_mask: <span class="bool-val">false</span>,
variadic: <span class="bool-val">false</span>,
}
}
<span class="doccomment">/// Describes a basic numeric array where each element has a fixed
/// with offset buffer of type `T`, followed by a
/// variable width data buffer
</span><span class="kw">pub fn </span>new_binary&lt;T&gt;() -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
buffers: <span class="macro">vec!</span>[
<span class="comment">// offsets
</span>BufferSpec::FixedWidth {
byte_width: mem::size_of::&lt;T&gt;(),
alignment: mem::align_of::&lt;T&gt;(),
},
<span class="comment">// values
</span>BufferSpec::VariableWidth,
],
can_contain_null_mask: <span class="bool-val">true</span>,
variadic: <span class="bool-val">false</span>,
}
}
<span class="doccomment">/// Describes a view type
</span><span class="kw">pub fn </span>new_view() -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
buffers: <span class="macro">vec!</span>[BufferSpec::FixedWidth {
byte_width: mem::size_of::&lt;u128&gt;(),
alignment: mem::align_of::&lt;u128&gt;(),
}],
can_contain_null_mask: <span class="bool-val">true</span>,
variadic: <span class="bool-val">true</span>,
}
}
<span class="doccomment">/// Describes a list view type
</span><span class="kw">pub fn </span>new_list_view&lt;T&gt;() -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
buffers: <span class="macro">vec!</span>[
BufferSpec::FixedWidth {
byte_width: mem::size_of::&lt;T&gt;(),
alignment: mem::align_of::&lt;T&gt;(),
},
BufferSpec::FixedWidth {
byte_width: mem::size_of::&lt;T&gt;(),
alignment: mem::align_of::&lt;T&gt;(),
},
],
can_contain_null_mask: <span class="bool-val">true</span>,
variadic: <span class="bool-val">true</span>,
}
}
}
<span class="doccomment">/// Layout specification for a single data type buffer
</span><span class="attr">#[derive(Debug, PartialEq, Eq)]
</span><span class="kw">pub enum </span>BufferSpec {
<span class="doccomment">/// Each element is a fixed width primitive, with the given `byte_width` and `alignment`
///
/// `alignment` is the alignment required by Rust for an array of the corresponding primitive,
/// see [`Layout::array`](std::alloc::Layout::array) and [`std::mem::align_of`].
///
/// Arrow-rs requires that all buffers have at least this alignment, to allow for
/// [slice](std::slice) based APIs. Alignment in excess of this is not required to allow
/// for array slicing and interoperability with `Vec`, which cannot be over-aligned.
///
/// Note that these alignment requirements will vary between architectures
</span>FixedWidth { byte_width: usize, alignment: usize },
<span class="doccomment">/// Variable width, such as string data for utf8 data
</span>VariableWidth,
<span class="doccomment">/// Buffer holds a bitmap.
///
/// Note: Unlike the C++ implementation, the null/validity buffer
/// is handled specially rather than as another of the buffers in
/// the spec, so this variant is only used for the Boolean type.
</span>BitMap,
<span class="doccomment">/// Buffer is always null. Unused currently in Rust implementation,
/// (used in C++ for Union type)
</span><span class="attr">#[allow(dead_code)]
</span>AlwaysNull,
}
<span class="kw">impl </span>PartialEq <span class="kw">for </span>ArrayData {
<span class="kw">fn </span>eq(<span class="kw-2">&amp;</span><span class="self">self</span>, other: <span class="kw-2">&amp;</span><span class="self">Self</span>) -&gt; bool {
equal::equal(<span class="self">self</span>, other)
}
}
<span class="doccomment">/// Builder for `ArrayData` type
</span><span class="attr">#[derive(Debug)]
</span><span class="kw">pub struct </span>ArrayDataBuilder {
data_type: DataType,
len: usize,
null_count: <span class="prelude-ty">Option</span>&lt;usize&gt;,
null_bit_buffer: <span class="prelude-ty">Option</span>&lt;Buffer&gt;,
nulls: <span class="prelude-ty">Option</span>&lt;NullBuffer&gt;,
offset: usize,
buffers: Vec&lt;Buffer&gt;,
child_data: Vec&lt;ArrayData&gt;,
}
<span class="kw">impl </span>ArrayDataBuilder {
<span class="attr">#[inline]
</span><span class="kw">pub const fn </span>new(data_type: DataType) -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
data_type,
len: <span class="number">0</span>,
null_count: <span class="prelude-val">None</span>,
null_bit_buffer: <span class="prelude-val">None</span>,
nulls: <span class="prelude-val">None</span>,
offset: <span class="number">0</span>,
buffers: <span class="macro">vec!</span>[],
child_data: <span class="macro">vec!</span>[],
}
}
<span class="kw">pub fn </span>data_type(<span class="self">self</span>, data_type: DataType) -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{ data_type, ..<span class="self">self </span>}
}
<span class="attr">#[inline]
#[allow(clippy::len_without_is_empty)]
</span><span class="kw">pub const fn </span>len(<span class="kw-2">mut </span><span class="self">self</span>, n: usize) -&gt; <span class="self">Self </span>{
<span class="self">self</span>.len = n;
<span class="self">self
</span>}
<span class="kw">pub fn </span>nulls(<span class="kw-2">mut </span><span class="self">self</span>, nulls: <span class="prelude-ty">Option</span>&lt;NullBuffer&gt;) -&gt; <span class="self">Self </span>{
<span class="self">self</span>.nulls = nulls;
<span class="self">self</span>.null_count = <span class="prelude-val">None</span>;
<span class="self">self</span>.null_bit_buffer = <span class="prelude-val">None</span>;
<span class="self">self
</span>}
<span class="kw">pub fn </span>null_count(<span class="kw-2">mut </span><span class="self">self</span>, null_count: usize) -&gt; <span class="self">Self </span>{
<span class="self">self</span>.null_count = <span class="prelude-val">Some</span>(null_count);
<span class="self">self
</span>}
<span class="kw">pub fn </span>null_bit_buffer(<span class="kw-2">mut </span><span class="self">self</span>, buf: <span class="prelude-ty">Option</span>&lt;Buffer&gt;) -&gt; <span class="self">Self </span>{
<span class="self">self</span>.nulls = <span class="prelude-val">None</span>;
<span class="self">self</span>.null_bit_buffer = buf;
<span class="self">self
</span>}
<span class="attr">#[inline]
</span><span class="kw">pub const fn </span>offset(<span class="kw-2">mut </span><span class="self">self</span>, n: usize) -&gt; <span class="self">Self </span>{
<span class="self">self</span>.offset = n;
<span class="self">self
</span>}
<span class="kw">pub fn </span>buffers(<span class="kw-2">mut </span><span class="self">self</span>, v: Vec&lt;Buffer&gt;) -&gt; <span class="self">Self </span>{
<span class="self">self</span>.buffers = v;
<span class="self">self
</span>}
<span class="kw">pub fn </span>add_buffer(<span class="kw-2">mut </span><span class="self">self</span>, b: Buffer) -&gt; <span class="self">Self </span>{
<span class="self">self</span>.buffers.push(b);
<span class="self">self
</span>}
<span class="kw">pub fn </span>add_buffers(<span class="kw-2">mut </span><span class="self">self</span>, bs: Vec&lt;Buffer&gt;) -&gt; <span class="self">Self </span>{
<span class="self">self</span>.buffers.extend(bs);
<span class="self">self
</span>}
<span class="kw">pub fn </span>child_data(<span class="kw-2">mut </span><span class="self">self</span>, v: Vec&lt;ArrayData&gt;) -&gt; <span class="self">Self </span>{
<span class="self">self</span>.child_data = v;
<span class="self">self
</span>}
<span class="kw">pub fn </span>add_child_data(<span class="kw-2">mut </span><span class="self">self</span>, r: ArrayData) -&gt; <span class="self">Self </span>{
<span class="self">self</span>.child_data.push(r);
<span class="self">self
</span>}
<span class="doccomment">/// Creates an array data, without any validation
///
/// # Safety
///
/// The same caveats as [`ArrayData::new_unchecked`]
/// apply.
</span><span class="attr">#[allow(clippy::let_and_return)]
</span><span class="kw">pub unsafe fn </span>build_unchecked(<span class="self">self</span>) -&gt; ArrayData {
<span class="kw">let </span>data = <span class="self">self</span>.build_impl();
<span class="comment">// Provide a force_validate mode
</span><span class="attr">#[cfg(feature = <span class="string">"force_validate"</span>)]
</span>data.validate_data().unwrap();
data
}
<span class="doccomment">/// Same as [`Self::build_unchecked`] but ignoring `force_validate` feature flag
</span><span class="kw">unsafe fn </span>build_impl(<span class="self">self</span>) -&gt; ArrayData {
<span class="kw">let </span>nulls = <span class="self">self</span>.nulls.or_else(|| {
<span class="kw">let </span>buffer = <span class="self">self</span>.null_bit_buffer<span class="question-mark">?</span>;
<span class="kw">let </span>buffer = BooleanBuffer::new(buffer, <span class="self">self</span>.offset, <span class="self">self</span>.len);
<span class="prelude-val">Some</span>(<span class="kw">match </span><span class="self">self</span>.null_count {
<span class="prelude-val">Some</span>(n) =&gt; NullBuffer::new_unchecked(buffer, n),
<span class="prelude-val">None </span>=&gt; NullBuffer::new(buffer),
})
});
ArrayData {
data_type: <span class="self">self</span>.data_type,
len: <span class="self">self</span>.len,
offset: <span class="self">self</span>.offset,
buffers: <span class="self">self</span>.buffers,
child_data: <span class="self">self</span>.child_data,
nulls: nulls.filter(|b| b.null_count() != <span class="number">0</span>),
}
}
<span class="doccomment">/// Creates an array data, validating all inputs
</span><span class="kw">pub fn </span>build(<span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;ArrayData, ArrowError&gt; {
<span class="kw">let </span>data = <span class="kw">unsafe </span>{ <span class="self">self</span>.build_impl() };
data.validate_data()<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(data)
}
<span class="doccomment">/// Creates an array data, validating all inputs, and aligning any buffers
///
/// Rust requires that arrays are aligned to their corresponding primitive,
/// see [`Layout::array`](std::alloc::Layout::array) and [`std::mem::align_of`].
///
/// [`ArrayData`] therefore requires that all buffers have at least this alignment,
/// to allow for [slice](std::slice) based APIs. See [`BufferSpec::FixedWidth`].
///
/// As this alignment is architecture specific, and not guaranteed by all arrow implementations,
/// this method is provided to automatically copy buffers to a new correctly aligned allocation
/// when necessary, making it useful when interacting with buffers produced by other systems,
/// e.g. IPC or FFI.
///
/// This is unlike `[Self::build`] which will instead return an error on encountering
/// insufficiently aligned buffers.
</span><span class="kw">pub fn </span>build_aligned(<span class="self">self</span>) -&gt; <span class="prelude-ty">Result</span>&lt;ArrayData, ArrowError&gt; {
<span class="kw">let </span><span class="kw-2">mut </span>data = <span class="kw">unsafe </span>{ <span class="self">self</span>.build_impl() };
data.align_buffers();
data.validate_data()<span class="question-mark">?</span>;
<span class="prelude-val">Ok</span>(data)
}
}
<span class="kw">impl </span>From&lt;ArrayData&gt; <span class="kw">for </span>ArrayDataBuilder {
<span class="kw">fn </span>from(d: ArrayData) -&gt; <span class="self">Self </span>{
<span class="self">Self </span>{
data_type: d.data_type,
len: d.len,
offset: d.offset,
buffers: d.buffers,
child_data: d.child_data,
nulls: d.nulls,
null_bit_buffer: <span class="prelude-val">None</span>,
null_count: <span class="prelude-val">None</span>,
}
}
}
<span class="attr">#[cfg(test)]
</span><span class="kw">mod </span>tests {
<span class="kw">use super</span>::<span class="kw-2">*</span>;
<span class="kw">use </span>arrow_schema::Field;
<span class="comment">// See arrow/tests/array_data_validation.rs for test of array validation
</span><span class="doccomment">/// returns a buffer initialized with some constant value for tests
</span><span class="kw">fn </span>make_i32_buffer(n: usize) -&gt; Buffer {
Buffer::from_slice_ref(<span class="macro">vec!</span>[<span class="number">42i32</span>; n])
}
<span class="doccomment">/// returns a buffer initialized with some constant value for tests
</span><span class="kw">fn </span>make_f32_buffer(n: usize) -&gt; Buffer {
Buffer::from_slice_ref(<span class="macro">vec!</span>[<span class="number">42f32</span>; n])
}
<span class="attr">#[test]
</span><span class="kw">fn </span>test_builder() {
<span class="comment">// Buffer needs to be at least 25 long
</span><span class="kw">let </span>v = (<span class="number">0</span>..<span class="number">25</span>).collect::&lt;Vec&lt;i32&gt;&gt;();
<span class="kw">let </span>b1 = Buffer::from_slice_ref(<span class="kw-2">&amp;</span>v);
<span class="kw">let </span>arr_data = ArrayData::builder(DataType::Int32)
.len(<span class="number">20</span>)
.offset(<span class="number">5</span>)
.add_buffer(b1)
.null_bit_buffer(<span class="prelude-val">Some</span>(Buffer::from(<span class="macro">vec!</span>[
<span class="number">0b01011111</span>, <span class="number">0b10110101</span>, <span class="number">0b01100011</span>, <span class="number">0b00011110</span>,
])))
.build()
.unwrap();
<span class="macro">assert_eq!</span>(<span class="number">20</span>, arr_data.len());
<span class="macro">assert_eq!</span>(<span class="number">10</span>, arr_data.null_count());
<span class="macro">assert_eq!</span>(<span class="number">5</span>, arr_data.offset());
<span class="macro">assert_eq!</span>(<span class="number">1</span>, arr_data.buffers().len());
<span class="macro">assert_eq!</span>(
Buffer::from_slice_ref(<span class="kw-2">&amp;</span>v).as_slice(),
arr_data.buffers()[<span class="number">0</span>].as_slice()
);
}
<span class="attr">#[test]
</span><span class="kw">fn </span>test_builder_with_child_data() {
<span class="kw">let </span>child_arr_data = ArrayData::try_new(
DataType::Int32,
<span class="number">5</span>,
<span class="prelude-val">None</span>,
<span class="number">0</span>,
<span class="macro">vec!</span>[Buffer::from_slice_ref([<span class="number">1i32</span>, <span class="number">2</span>, <span class="number">3</span>, <span class="number">4</span>, <span class="number">5</span>])],
<span class="macro">vec!</span>[],
)
.unwrap();
<span class="kw">let </span>field = Arc::new(Field::new(<span class="string">"x"</span>, DataType::Int32, <span class="bool-val">true</span>));
<span class="kw">let </span>data_type = DataType::Struct(<span class="macro">vec!</span>[field].into());
<span class="kw">let </span>arr_data = ArrayData::builder(data_type)
.len(<span class="number">5</span>)
.offset(<span class="number">0</span>)
.add_child_data(child_arr_data.clone())
.build()
.unwrap();
<span class="macro">assert_eq!</span>(<span class="number">5</span>, arr_data.len());
<span class="macro">assert_eq!</span>(<span class="number">1</span>, arr_data.child_data().len());
<span class="macro">assert_eq!</span>(child_arr_data, arr_data.child_data()[<span class="number">0</span>]);
}
<span class="attr">#[test]
</span><span class="kw">fn </span>test_null_count() {
<span class="kw">let </span><span class="kw-2">mut </span>bit_v: [u8; <span class="number">2</span>] = [<span class="number">0</span>; <span class="number">2</span>];
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">0</span>);
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">3</span>);
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">10</span>);
<span class="kw">let </span>arr_data = ArrayData::builder(DataType::Int32)
.len(<span class="number">16</span>)
.add_buffer(make_i32_buffer(<span class="number">16</span>))
.null_bit_buffer(<span class="prelude-val">Some</span>(Buffer::from(bit_v)))
.build()
.unwrap();
<span class="macro">assert_eq!</span>(<span class="number">13</span>, arr_data.null_count());
<span class="comment">// Test with offset
</span><span class="kw">let </span><span class="kw-2">mut </span>bit_v: [u8; <span class="number">2</span>] = [<span class="number">0</span>; <span class="number">2</span>];
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">0</span>);
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">3</span>);
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">10</span>);
<span class="kw">let </span>arr_data = ArrayData::builder(DataType::Int32)
.len(<span class="number">12</span>)
.offset(<span class="number">2</span>)
.add_buffer(make_i32_buffer(<span class="number">14</span>)) <span class="comment">// requires at least 14 bytes of space,
</span>.null_bit_buffer(<span class="prelude-val">Some</span>(Buffer::from(bit_v)))
.build()
.unwrap();
<span class="macro">assert_eq!</span>(<span class="number">10</span>, arr_data.null_count());
}
<span class="attr">#[test]
</span><span class="kw">fn </span>test_null_buffer_ref() {
<span class="kw">let </span><span class="kw-2">mut </span>bit_v: [u8; <span class="number">2</span>] = [<span class="number">0</span>; <span class="number">2</span>];
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">0</span>);
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">3</span>);
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">10</span>);
<span class="kw">let </span>arr_data = ArrayData::builder(DataType::Int32)
.len(<span class="number">16</span>)
.add_buffer(make_i32_buffer(<span class="number">16</span>))
.null_bit_buffer(<span class="prelude-val">Some</span>(Buffer::from(bit_v)))
.build()
.unwrap();
<span class="macro">assert!</span>(arr_data.nulls().is_some());
<span class="macro">assert_eq!</span>(<span class="kw-2">&amp;</span>bit_v, arr_data.nulls().unwrap().validity());
}
<span class="attr">#[test]
</span><span class="kw">fn </span>test_slice() {
<span class="kw">let </span><span class="kw-2">mut </span>bit_v: [u8; <span class="number">2</span>] = [<span class="number">0</span>; <span class="number">2</span>];
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">0</span>);
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">3</span>);
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">10</span>);
<span class="kw">let </span>data = ArrayData::builder(DataType::Int32)
.len(<span class="number">16</span>)
.add_buffer(make_i32_buffer(<span class="number">16</span>))
.null_bit_buffer(<span class="prelude-val">Some</span>(Buffer::from(bit_v)))
.build()
.unwrap();
<span class="kw">let </span>new_data = data.slice(<span class="number">1</span>, <span class="number">15</span>);
<span class="macro">assert_eq!</span>(data.len() - <span class="number">1</span>, new_data.len());
<span class="macro">assert_eq!</span>(<span class="number">1</span>, new_data.offset());
<span class="macro">assert_eq!</span>(data.null_count(), new_data.null_count());
<span class="comment">// slice of a slice (removes one null)
</span><span class="kw">let </span>new_data = new_data.slice(<span class="number">1</span>, <span class="number">14</span>);
<span class="macro">assert_eq!</span>(data.len() - <span class="number">2</span>, new_data.len());
<span class="macro">assert_eq!</span>(<span class="number">2</span>, new_data.offset());
<span class="macro">assert_eq!</span>(data.null_count() - <span class="number">1</span>, new_data.null_count());
}
<span class="attr">#[test]
</span><span class="kw">fn </span>test_equality() {
<span class="kw">let </span>int_data = ArrayData::builder(DataType::Int32)
.len(<span class="number">1</span>)
.add_buffer(make_i32_buffer(<span class="number">1</span>))
.build()
.unwrap();
<span class="kw">let </span>float_data = ArrayData::builder(DataType::Float32)
.len(<span class="number">1</span>)
.add_buffer(make_f32_buffer(<span class="number">1</span>))
.build()
.unwrap();
<span class="macro">assert_ne!</span>(int_data, float_data);
<span class="macro">assert!</span>(!int_data.ptr_eq(<span class="kw-2">&amp;</span>float_data));
<span class="macro">assert!</span>(int_data.ptr_eq(<span class="kw-2">&amp;</span>int_data));
<span class="attr">#[allow(clippy::redundant_clone)]
</span><span class="kw">let </span>int_data_clone = int_data.clone();
<span class="macro">assert_eq!</span>(int_data, int_data_clone);
<span class="macro">assert!</span>(int_data.ptr_eq(<span class="kw-2">&amp;</span>int_data_clone));
<span class="macro">assert!</span>(int_data_clone.ptr_eq(<span class="kw-2">&amp;</span>int_data));
<span class="kw">let </span>int_data_slice = int_data_clone.slice(<span class="number">1</span>, <span class="number">0</span>);
<span class="macro">assert!</span>(int_data_slice.ptr_eq(<span class="kw-2">&amp;</span>int_data_slice));
<span class="macro">assert!</span>(!int_data.ptr_eq(<span class="kw-2">&amp;</span>int_data_slice));
<span class="macro">assert!</span>(!int_data_slice.ptr_eq(<span class="kw-2">&amp;</span>int_data));
<span class="kw">let </span>data_buffer = Buffer::from_slice_ref(<span class="string">"abcdef"</span>.as_bytes());
<span class="kw">let </span>offsets_buffer = Buffer::from_slice_ref([<span class="number">0_i32</span>, <span class="number">2_i32</span>, <span class="number">2_i32</span>, <span class="number">5_i32</span>]);
<span class="kw">let </span>string_data = ArrayData::try_new(
DataType::Utf8,
<span class="number">3</span>,
<span class="prelude-val">Some</span>(Buffer::from_iter(<span class="macro">vec!</span>[<span class="bool-val">true</span>, <span class="bool-val">false</span>, <span class="bool-val">true</span>])),
<span class="number">0</span>,
<span class="macro">vec!</span>[offsets_buffer, data_buffer],
<span class="macro">vec!</span>[],
)
.unwrap();
<span class="macro">assert_ne!</span>(float_data, string_data);
<span class="macro">assert!</span>(!float_data.ptr_eq(<span class="kw-2">&amp;</span>string_data));
<span class="macro">assert!</span>(string_data.ptr_eq(<span class="kw-2">&amp;</span>string_data));
<span class="attr">#[allow(clippy::redundant_clone)]
</span><span class="kw">let </span>string_data_cloned = string_data.clone();
<span class="macro">assert!</span>(string_data_cloned.ptr_eq(<span class="kw-2">&amp;</span>string_data));
<span class="macro">assert!</span>(string_data.ptr_eq(<span class="kw-2">&amp;</span>string_data_cloned));
<span class="kw">let </span>string_data_slice = string_data.slice(<span class="number">1</span>, <span class="number">2</span>);
<span class="macro">assert!</span>(string_data_slice.ptr_eq(<span class="kw-2">&amp;</span>string_data_slice));
<span class="macro">assert!</span>(!string_data_slice.ptr_eq(<span class="kw-2">&amp;</span>string_data))
}
<span class="attr">#[test]
</span><span class="kw">fn </span>test_slice_memory_size() {
<span class="kw">let </span><span class="kw-2">mut </span>bit_v: [u8; <span class="number">2</span>] = [<span class="number">0</span>; <span class="number">2</span>];
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">0</span>);
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">3</span>);
bit_util::set_bit(<span class="kw-2">&amp;mut </span>bit_v, <span class="number">10</span>);
<span class="kw">let </span>data = ArrayData::builder(DataType::Int32)
.len(<span class="number">16</span>)
.add_buffer(make_i32_buffer(<span class="number">16</span>))
.null_bit_buffer(<span class="prelude-val">Some</span>(Buffer::from(bit_v)))
.build()
.unwrap();
<span class="kw">let </span>new_data = data.slice(<span class="number">1</span>, <span class="number">14</span>);
<span class="macro">assert_eq!</span>(
data.get_slice_memory_size().unwrap() - <span class="number">8</span>,
new_data.get_slice_memory_size().unwrap()
);
<span class="kw">let </span>data_buffer = Buffer::from_slice_ref(<span class="string">"abcdef"</span>.as_bytes());
<span class="kw">let </span>offsets_buffer = Buffer::from_slice_ref([<span class="number">0_i32</span>, <span class="number">2_i32</span>, <span class="number">2_i32</span>, <span class="number">5_i32</span>]);
<span class="kw">let </span>string_data = ArrayData::try_new(
DataType::Utf8,
<span class="number">3</span>,
<span class="prelude-val">Some</span>(Buffer::from_iter(<span class="macro">vec!</span>[<span class="bool-val">true</span>, <span class="bool-val">false</span>, <span class="bool-val">true</span>])),
<span class="number">0</span>,
<span class="macro">vec!</span>[offsets_buffer, data_buffer],
<span class="macro">vec!</span>[],
)
.unwrap();
<span class="kw">let </span>string_data_slice = string_data.slice(<span class="number">1</span>, <span class="number">2</span>);
<span class="comment">//4 bytes of offset and 2 bytes of data reduced by slicing.
</span><span class="macro">assert_eq!</span>(
string_data.get_slice_memory_size().unwrap() - <span class="number">6</span>,
string_data_slice.get_slice_memory_size().unwrap()
);
}
<span class="attr">#[test]
</span><span class="kw">fn </span>test_count_nulls() {
<span class="kw">let </span>buffer = Buffer::from(<span class="macro">vec!</span>[<span class="number">0b00010110</span>, <span class="number">0b10011111</span>]);
<span class="kw">let </span>buffer = NullBuffer::new(BooleanBuffer::new(buffer, <span class="number">0</span>, <span class="number">16</span>));
<span class="kw">let </span>count = count_nulls(<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>buffer), <span class="number">0</span>, <span class="number">16</span>);
<span class="macro">assert_eq!</span>(count, <span class="number">7</span>);
<span class="kw">let </span>count = count_nulls(<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>buffer), <span class="number">4</span>, <span class="number">8</span>);
<span class="macro">assert_eq!</span>(count, <span class="number">3</span>);
}
<span class="attr">#[test]
</span><span class="kw">fn </span>test_contains_nulls() {
<span class="kw">let </span>buffer: Buffer =
MutableBuffer::from_iter([<span class="bool-val">false</span>, <span class="bool-val">false</span>, <span class="bool-val">false</span>, <span class="bool-val">true</span>, <span class="bool-val">true</span>, <span class="bool-val">false</span>]).into();
<span class="kw">let </span>buffer = NullBuffer::new(BooleanBuffer::new(buffer, <span class="number">0</span>, <span class="number">6</span>));
<span class="macro">assert!</span>(contains_nulls(<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>buffer), <span class="number">0</span>, <span class="number">6</span>));
<span class="macro">assert!</span>(contains_nulls(<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>buffer), <span class="number">0</span>, <span class="number">3</span>));
<span class="macro">assert!</span>(!contains_nulls(<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>buffer), <span class="number">3</span>, <span class="number">2</span>));
<span class="macro">assert!</span>(!contains_nulls(<span class="prelude-val">Some</span>(<span class="kw-2">&amp;</span>buffer), <span class="number">0</span>, <span class="number">0</span>));
}
<span class="attr">#[test]
</span><span class="kw">fn </span>test_alignment() {
<span class="kw">let </span>buffer = Buffer::from_vec(<span class="macro">vec!</span>[<span class="number">1_i32</span>, <span class="number">2_i32</span>, <span class="number">3_i32</span>]);
<span class="kw">let </span>sliced = buffer.slice(<span class="number">1</span>);
<span class="kw">let </span><span class="kw-2">mut </span>data = ArrayData {
data_type: DataType::Int32,
len: <span class="number">0</span>,
offset: <span class="number">0</span>,
buffers: <span class="macro">vec!</span>[buffer],
child_data: <span class="macro">vec!</span>[],
nulls: <span class="prelude-val">None</span>,
};
data.validate_full().unwrap();
data.buffers[<span class="number">0</span>] = sliced;
<span class="kw">let </span>err = data.validate().unwrap_err();
<span class="macro">assert_eq!</span>(
err.to_string(),
<span class="string">"Invalid argument error: Misaligned buffers[0] in array of type Int32, offset from expected alignment of 4 by 1"
</span>);
data.align_buffers();
data.validate_full().unwrap();
}
}
</code></pre></div></section></main></body></html>