You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@arrow.apache.org by we...@apache.org on 2017/07/31 19:30:01 UTC
[43/51] [partial] arrow-site git commit: Update C++ API docs to 0.5.0
http://git-wip-us.apache.org/repos/asf/arrow-site/blob/b286da84/docs/cpp/bit-util_8h_source.html
----------------------------------------------------------------------
diff --git a/docs/cpp/bit-util_8h_source.html b/docs/cpp/bit-util_8h_source.html
index 94464cd..e2a20f7 100644
--- a/docs/cpp/bit-util_8h_source.html
+++ b/docs/cpp/bit-util_8h_source.html
@@ -3,17 +3,15 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
-<meta name="generator" content="Doxygen 1.8.11"/>
-<title>Apache Arrow (C++): /home/uwe/Development/arrow/cpp/src/arrow/util/bit-util.h Source File</title>
+<meta name="generator" content="Doxygen 1.8.13"/>
+<meta name="viewport" content="width=device-width, initial-scale=1"/>
+<title>Apache Arrow (C++): /home/wesm/code/arrow/cpp/src/arrow/util/bit-util.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
-<script type="text/javascript">
- $(document).ready(function() { init_search(); });
-</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
@@ -32,41 +30,19 @@
</table>
</div>
<!-- end header part -->
-<!-- Generated by Doxygen 1.8.11 -->
+<!-- Generated by Doxygen 1.8.13 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
- <div id="navrow1" class="tabs">
- <ul class="tablist">
- <li><a href="index.html"><span>Main Page</span></a></li>
- <li><a href="pages.html"><span>Related Pages</span></a></li>
- <li><a href="namespaces.html"><span>Namespaces</span></a></li>
- <li><a href="annotated.html"><span>Classes</span></a></li>
- <li class="current"><a href="files.html"><span>Files</span></a></li>
- <li>
- <div id="MSearchBox" class="MSearchBoxInactive">
- <span class="left">
- <img id="MSearchSelect" src="search/mag_sel.png"
- onmouseover="return searchBox.OnSearchSelectShow()"
- onmouseout="return searchBox.OnSearchSelectHide()"
- alt=""/>
- <input type="text" id="MSearchField" value="Search" accesskey="S"
- onfocus="searchBox.OnSearchFieldFocus(true)"
- onblur="searchBox.OnSearchFieldFocus(false)"
- onkeyup="searchBox.OnSearchFieldChange(event)"/>
- </span><span class="right">
- <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
- </span>
- </div>
- </li>
- </ul>
- </div>
- <div id="navrow2" class="tabs2">
- <ul class="tablist">
- <li><a href="files.html"><span>File List</span></a></li>
- <li><a href="globals.html"><span>File Members</span></a></li>
- </ul>
- </div>
+<script type="text/javascript" src="menudata.js"></script>
+<script type="text/javascript" src="menu.js"></script>
+<script type="text/javascript">
+$(function() {
+ initMenu('',true,false,'search.php','Search');
+ $(document).ready(function() { init_search(); });
+});
+</script>
+<div id="main-nav"></div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
@@ -91,24 +67,40 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
<div class="title">bit-util.h</div> </div>
</div><!--header-->
<div class="contents">
-<a href="bit-util_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Licensed to the Apache Software Foundation (ASF) under one</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// or more contributor license agreements. See the NOTICE file</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// distributed with this work for additional information</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// regarding copyright ownership. The ASF licenses this file</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// to you under the Apache License, Version 2.0 (the</span></div><div class="line"><a name="l00006"></a><span clas
s="lineno"> 6</span> <span class="comment">// "License"); you may not use this file except in compliance</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// with the License. You may obtain a copy of the License at</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">//</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">//</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// Unless required by applicable law or agreed to in writing,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// software distributed
under the License is distributed on an</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// KIND, either express or implied. See the License for the</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// specific language governing permissions and limitations</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// under the License.</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#ifndef ARROW_UTIL_BIT_UTIL_H</span></div><div class="line"><a name="l00019"></a><span class="linen
o"> 19</span> <span class="preprocessor">#define ARROW_UTIL_BIT_UTIL_H</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#include <memory></span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> </div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include "<a class="code" href="visibility_8h.html">arrow/util/v
isibility.h</a>"</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> </div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="keyword">namespace </span><a class="code" href="namespacearrow.html">arrow</a> {</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="keyword">class </span>Buffer;</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="keyword">class </span>MemoryPool;</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="keyword">class </span>MutableBuffer;</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="keyword">class </span>Status;</div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><
a name="l00035"></a><span class="lineno"><a class="line" href="namespacearrow_1_1_bit_util.html"> 35</a></span> <span class="keyword">namespace </span>BitUtil {</div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="keyword">static</span> constexpr uint8_t kBitmask[] = {1, 2, 4, 8, 16, 32, 64, 128};</div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">// the ~i byte version of kBitmaks</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="keyword">static</span> constexpr uint8_t kFlippedBitmask[] = {254, 253, 251, 247, 239, 223, 191, 127};</div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span
class="lineno"> 42</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t CeilByte(int64_t size) {</div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span>  <span class="keywordflow">return</span> (size + 7) & ~7;</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> }</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> </div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t BytesForBits(int64_t size) {</div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="keywordflow">return</span> CeilByte(size) / 8;</div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> }</div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div><div class="line"><a name="l00050
"></a><span class="lineno"> 50</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t Ceil2Bytes(int64_t size) {</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keywordflow">return</span> (size + 15) & ~15;</div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> }</div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> </div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> GetBit(<span class="keyword">const</span> uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keywordflow">return</span> (bits[i / 8] & kBitmask[i % 8]) != 0;</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> }</div><div cla
ss="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> BitNotSet(<span class="keyword">const</span> uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span> (bits[i / 8] & kBitmask[i % 8]) == 0;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> }</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> </div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> ClearBit(uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  bits[i /
8] &= kFlippedBitmask[i % 8];</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> }</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> SetBit(uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  bits[i / 8] |= kBitmask[i % 8];</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> }</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> </div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> SetBitTo(uint8_t* bits, int64_t i, <span class="keywordtype">bool</span> bit_is_set) {<
/div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="comment">// TODO: speed up. See https://graphics.stanford.edu/~seander/bithacks.html</span></div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="comment">// "Conditionally set or clear bits without branching"</span></div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">if</span> (bit_is_set) {</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  SetBit(bits, i);</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  ClearBit(bits, i);</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  }</div><div class="line"><a name="l00078"></a><span class="lineno">
78</span> }</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> </div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t NextPower2(int64_t n) {</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  n--;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  n |= n >> 1;</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  n |= n >> 2;</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  n |= n >> 4;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  n |= n >> 8;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  n |= n >> 16;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  n |= n >&g
t; 32;</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  n++;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  <span class="keywordflow">return</span> n;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> }</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> IsMultipleOf64(int64_t n) {</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keywordflow">return</span> (n & 63) == 0;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> }</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> </div><div class="line"><a name="l00096"></a><span class="lineno"> 9
6</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> IsMultipleOf8(int64_t n) {</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <span class="keywordflow">return</span> (n & 7) == 0;</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> }</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00101"></a><span class="lineno"><a class="line" href="namespacearrow_1_1_bit_util.html#a579a683813940e32133af9e6c6acb2c4"> 101</a></span> <span class="keyword">inline</span> int64_t <a class="code" href="namespacearrow_1_1_bit_util.html#a579a683813940e32133af9e6c6acb2c4">RoundUp</a>(int64_t value, int64_t factor) {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordflow">return</span> (value + (factor - 1)) / factor * factor;</div><div c
lass="line"><a name="l00103"></a><span class="lineno"> 103</span> }</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> </div><div class="line"><a name="l00105"></a><span class="lineno"><a class="line" href="namespacearrow_1_1_bit_util.html#a2f7b5bcced6e09a6b02315208dec7c5d"> 105</a></span> <span class="keyword">inline</span> int64_t <a class="code" href="namespacearrow_1_1_bit_util.html#a2f7b5bcced6e09a6b02315208dec7c5d">RoundUpToMultipleOf64</a>(int64_t num) {</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="comment">// TODO(wesm): is this definitely needed?</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// DCHECK_GE(num, 0);</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  constexpr int64_t round_to = 64;</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>
  constexpr int64_t force_carry_addend = round_to - 1;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  constexpr int64_t truncate_bitmask = ~(round_to - 1);</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  constexpr int64_t max_roundable_num = std::numeric_limits<int64_t>::max() - round_to;</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">if</span> (num <= max_roundable_num) { <span class="keywordflow">return</span> (num + force_carry_addend) & truncate_bitmask; }</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="comment">// handle overflow case. This should result in a malloc error upstream</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="keywordflow">return</span> num;</div><div class="line"><a name="l00115"></a><span class="l
ineno"> 115</span> }</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="keywordtype">void</span> <a class="code" href="namespacearrow_1_1_bit_util.html#af9b78659f3d02ccfebdd1e592add36c8">BytesToBits</a>(<span class="keyword">const</span> std::vector<uint8_t>& bytes, uint8_t* bits);</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> <a class="code" href="visibility_8h.html#a7060b7b5f11fc11ce77a4d30b37619ef">ARROW_EXPORT</a> <a class="code" href="classarrow_1_1_status.html">Status</a> <a class="code" href="namespacearrow_1_1_bit_util.html#af9b78659f3d02ccfebdd1e592add36c8">BytesToBits</a>(<span class="keyword">const</span> std::vector<uint8_t>&, std::shared_ptr<Buffer>*);</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"><
/a><span class="lineno"> 120</span> } <span class="comment">// namespace BitUtil</span></div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span> </div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> <span class="comment">// ----------------------------------------------------------------------</span></div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment">// Bitmap utilities</span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <a class="code" href="classarrow_1_1_status.html">Status</a> <a class="code" href="visibility_8h.html#a7060b7b5f11fc11ce77a4d30b37619ef">ARROW_EXPORT</a> <a class="code" href="namespacearrow.html#aad55168cd9074fddb1ce5f103d29c26f">GetEmptyBitmap</a>(</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> 
; <a class="code" href="classarrow_1_1_memory_pool.html">MemoryPool</a>* pool, int64_t length, std::shared_ptr<MutableBuffer>* result);</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <a class="code" href="classarrow_1_1_status.html">Status</a> <a class="code" href="visibility_8h.html#a7060b7b5f11fc11ce77a4d30b37619ef">ARROW_EXPORT</a> <a class="code" href="namespacearrow.html#a5e8c95adb60525560e52951a7c9d425b">CopyBitmap</a>(<a class="code" href="classarrow_1_1_memory_pool.html">MemoryPool</a>* pool, <span class="keyword">const</span> uint8_t* bitmap, int64_t offset,</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  int64_t length, std::shared_ptr<Buffer>* out);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div><div class="line"><a name="l00147"></a><span class="lineno"> 147
</span> int64_t <a class="code" href="visibility_8h.html#a7060b7b5f11fc11ce77a4d30b37619ef">ARROW_EXPORT</a> <a class="code" href="namespacearrow.html#a3df27e2b05dde85e91db36fec4dd5728">CountSetBits</a>(</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keyword">const</span> uint8_t* data, int64_t bit_offset, int64_t length);</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span> </div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="keywordtype">bool</span> <a class="code" href="visibility_8h.html#a7060b7b5f11fc11ce77a4d30b37619ef">ARROW_EXPORT</a> <a class="code" href="namespacearrow.html#a6009c894cf619352dfc7bb26b7ac15b9">BitmapEquals</a>(<span class="keyword">const</span> uint8_t* left, int64_t left_offset,</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keyword">const</span> uint8_t* right, int64_t right
_offset, int64_t bit_length);</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> } <span class="comment">// namespace arrow</span></div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="preprocessor">#endif // ARROW_UTIL_BIT_UTIL_H</span></div><div class="ttc" id="namespacearrow_html_a6009c894cf619352dfc7bb26b7ac15b9"><div class="ttname"><a href="namespacearrow.html#a6009c894cf619352dfc7bb26b7ac15b9">arrow::BitmapEquals</a></div><div class="ttdeci">bool BitmapEquals(const uint8_t *left, int64_t left_offset, const uint8_t *right, int64_t right_offset, int64_t bit_length)</div><div class="ttdef"><b>Definition:</b> bit-util.cc:113</div></div>
-<div class="ttc" id="namespacearrow_1_1_bit_util_html_a2f7b5bcced6e09a6b02315208dec7c5d"><div class="ttname"><a href="namespacearrow_1_1_bit_util.html#a2f7b5bcced6e09a6b02315208dec7c5d">arrow::BitUtil::RoundUpToMultipleOf64</a></div><div class="ttdeci">int64_t RoundUpToMultipleOf64(int64_t num)</div><div class="ttdef"><b>Definition:</b> bit-util.h:105</div></div>
-<div class="ttc" id="namespacearrow_1_1_bit_util_html_a579a683813940e32133af9e6c6acb2c4"><div class="ttname"><a href="namespacearrow_1_1_bit_util.html#a579a683813940e32133af9e6c6acb2c4">arrow::BitUtil::RoundUp</a></div><div class="ttdeci">int64_t RoundUp(int64_t value, int64_t factor)</div><div class="ttdoc">Returns &#39;value&#39; rounded up to the nearest multiple of &#39;factor&#39;. </div><div class="ttdef"><b>Definition:</b> bit-util.h:101</div></div>
-<div class="ttc" id="classarrow_1_1_status_html"><div class="ttname"><a href="classarrow_1_1_status.html">arrow::Status</a></div><div class="ttdef"><b>Definition:</b> status.h:75</div></div>
+<a href="bit-util_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Licensed to the Apache Software Foundation (ASF) under one</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// or more contributor license agreements. See the NOTICE file</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// distributed with this work for additional information</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// regarding copyright ownership. The ASF licenses this file</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// to you under the Apache License, Version 2.0 (the</span></div><div class="line"><a name="l00006"></a><span clas
s="lineno"> 6</span> <span class="comment">// "License"); you may not use this file except in compliance</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// with the License. You may obtain a copy of the License at</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">//</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">//</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// Unless required by applicable law or agreed to in writing,</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// software distributed
under the License is distributed on an</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// KIND, either express or implied. See the License for the</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// specific language governing permissions and limitations</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// under the License.</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> </div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#ifndef ARROW_UTIL_BIT_UTIL_H</span></div><div class="line"><a name="l00019"></a><span class="linen
o"> 19</span> <span class="preprocessor">#define ARROW_UTIL_BIT_UTIL_H</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> </div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="preprocessor">#if defined(__APPLE__)</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="preprocessor">#include <machine/endian.h></span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="preprocessor">#elif defined(_WIN32)</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="preprocessor">#define __LITTLE_ENDIAN 1</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="preprocessor">#include <endian.h&
gt;</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> </div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="preprocessor">#if defined(_MSC_VER)</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#define ARROW_BYTE_SWAP64 _byteswap_uint64</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#define ARROW_BYTE_SWAP32 _byteswap_ulong</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00033"></a><span class="lineno"><a class="line" href="bit-util_8h.html#a582fbf29e9f0fbf6dd39031af11a8894"> 33</a></span> <span class="preprocessor">#define A
RROW_BYTE_SWAP64 __builtin_bswap64</span></div><div class="line"><a name="l00034"></a><span class="lineno"><a class="line" href="bit-util_8h.html#a4fabecc746b1f8c287ca27cebdfb3eee"> 34</a></span> <span class="preprocessor">#define ARROW_BYTE_SWAP32 __builtin_bswap32</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> </div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <cstdint></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include <limits></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include <memory></span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <
span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#include "<a class="code" href="compiler-util_8h.html">arrow/util/compiler-util.h</a>"</span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include "<a class="code" href="visibility_8h.html">arrow/util/visibility.h</a>"</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> </div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#ifdef ARROW_USE_SSE</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#include "<a class="code" href="cpu-info_8h.html">arrow/util/cpu-info.h</a>"</span></div><di
v class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#include "<a class="code" href="sse-util_8h.html">arrow/util/sse-util.h</a>"</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> </div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="keyword">namespace </span><a class="code" href="namespacearrow.html">arrow</a> {</div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> </div><div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="bit-util_8h.html#a760bf109287895672418b5a7855d4464"> 52</a></span> <span class="preprocessor">#define INIT_BITSET(valid_bits_vector, valid_bits_index) \</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53<
/span> <span class="preprocessor"> int byte_offset_##valid_bits_vector = (valid_bits_index) / 8; \</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor"> int bit_offset_##valid_bits_vector = (valid_bits_index) % 8; \</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor"> uint8_t bitset_##valid_bits_vector = valid_bits_vector[byte_offset_##valid_bits_vector];</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> </div><div class="line"><a name="l00057"></a><span class="lineno"><a class="line" href="bit-util_8h.html#abd53b6fe5d0ee60b928d2813f89422cf"> 57</a></span> <span class="preprocessor">#define READ_NEXT_BITSET(valid_bits_vector) \</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor"> bit_offset_##val
id_bits_vector++; \</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor"> if (bit_offset_##valid_bits_vector == 8) { \</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor"> bit_offset_##valid_bits_vector = 0; \</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor"> byte_offset_##valid_bits_vector++; \</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor"> bitset_##valid_bits_vector = valid_bits_vector[byte_offset_##valid_bits_vector]; \</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preproces
sor"> }</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="comment">// TODO(wesm): The source from Impala was depending on boost::make_unsigned</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment">//</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment">// We add a partial stub implementation here</span></div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> </div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00070"></a><span class="lineno"><a class="line" href="structarrow_1_1make__unsigned.html"> 70</a></span> <span class="keyword">struct </span><a
class="code" href="structarrow_1_1make__unsigned.html">make_unsigned</a> {};</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span> </div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="structarrow_1_1make__unsigned_3_01int8__t_01_4.html"> 73</a></span> <span class="keyword">struct </span><a class="code" href="structarrow_1_1make__unsigned.html">make_unsigned</a><int8_t> {</div><div class="line"><a name="l00074"></a><span class="lineno"><a class="line" href="structarrow_1_1make__unsigned_3_01int8__t_01_4.html#a2b83283128495aa14ff52b75c6465fa6"> 74</a></span>  <span class="keyword">typedef</span> uint8_t <a class="code" href="structarrow_1_1make__unsigned_3_01int8__t_01_4.html#a2b83283128495aa14ff52b75c6465fa6">type</a>;</div><div class="line"><a name="l00075"></a><span clas
s="lineno"> 75</span> };</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00078"></a><span class="lineno"><a class="line" href="structarrow_1_1make__unsigned_3_01int16__t_01_4.html"> 78</a></span> <span class="keyword">struct </span><a class="code" href="structarrow_1_1make__unsigned.html">make_unsigned</a><int16_t> {</div><div class="line"><a name="l00079"></a><span class="lineno"><a class="line" href="structarrow_1_1make__unsigned_3_01int16__t_01_4.html#aacfa12cf56b6a68fbdab84cb1e1f8117"> 79</a></span>  <span class="keyword">typedef</span> uint16_t <a class="code" href="structarrow_1_1make__unsigned_3_01int16__t_01_4.html#aacfa12cf56b6a68fbdab84cb1e1f8117">type</a>;</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> };</div><di
v class="line"><a name="l00081"></a><span class="lineno"> 81</span> </div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="structarrow_1_1make__unsigned_3_01int32__t_01_4.html"> 83</a></span> <span class="keyword">struct </span><a class="code" href="structarrow_1_1make__unsigned.html">make_unsigned</a><int32_t> {</div><div class="line"><a name="l00084"></a><span class="lineno"><a class="line" href="structarrow_1_1make__unsigned_3_01int32__t_01_4.html#aefb494edac60b1ba6e5faabbd6941844"> 84</a></span>  <span class="keyword">typedef</span> uint32_t <a class="code" href="structarrow_1_1make__unsigned_3_01int32__t_01_4.html#aefb494edac60b1ba6e5faabbd6941844">type</a>;</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> };</div><div class="line"><a name="l00086"></a><spa
n class="lineno"> 86</span> </div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span> <span class="keyword">template</span> <></div><div class="line"><a name="l00088"></a><span class="lineno"><a class="line" href="structarrow_1_1make__unsigned_3_01int64__t_01_4.html"> 88</a></span> <span class="keyword">struct </span><a class="code" href="structarrow_1_1make__unsigned.html">make_unsigned</a><int64_t> {</div><div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="structarrow_1_1make__unsigned_3_01int64__t_01_4.html#a962df4bc5a90afb6f2597247e0ae0b40"> 89</a></span>  <span class="keyword">typedef</span> uint64_t <a class="code" href="structarrow_1_1make__unsigned_3_01int64__t_01_4.html#a962df4bc5a90afb6f2597247e0ae0b40">type</a>;</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> };</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span> </div
><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span class="keyword">class </span><a class="code" href="classarrow_1_1_buffer.html">Buffer</a>;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="keyword">class </span><a class="code" href="classarrow_1_1_memory_pool.html">MemoryPool</a>;</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span> <span class="keyword">class </span><a class="code" href="classarrow_1_1_mutable_buffer.html">MutableBuffer</a>;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> <span class="keyword">class </span><a class="code" href="classarrow_1_1_status.html">Status</a>;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> </div><div class="line"><a name="l00097"></a><span class="lineno"><a class="line" href="namespacearrow_1_1_bit_util.html"> 97</a></span> <span class="keyword">namespac
e </span>BitUtil {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> </div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="keyword">static</span> constexpr uint8_t kBitmask[] = {1, 2, 4, 8, 16, 32, 64, 128};</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> <span class="comment">// the ~i byte version of kBitmaks</span></div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span> <span class="keyword">static</span> constexpr uint8_t kFlippedBitmask[] = {254, 253, 251, 247, 239, 223, 191, 127};</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t CeilByte(int64_t size) {</div><div c
lass="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">return</span> (size + 7) & ~7;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> }</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t BytesForBits(int64_t size) {</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">return</span> CeilByte(size) / 8;</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span> }</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t Ceil2Bytes(int64_t size)
{</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  <span class="keywordflow">return</span> (size + 15) & ~15;</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span> }</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span> </div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> GetBit(<span class="keyword">const</span> uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="keywordflow">return</span> (bits[i / 8] & kBitmask[i % 8]) != 0;</div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span> }</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> </div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>&
#160;<span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> BitNotSet(<span class="keyword">const</span> uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> (bits[i / 8] & kBitmask[i % 8]) == 0;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> }</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> </div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> ClearBit(uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  bits[i / 8] &= kFlippedBitmask[i % 8];</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span> }</div><div class="line"><a name
="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> SetBit(uint8_t* bits, int64_t i) {</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  bits[i / 8] |= kBitmask[i % 8];</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> }</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span> </div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> SetArrayBit(uint8_t* bits, <span class="keywordtype">int</span> i, <span class="keywordtype">bool</span> is_set) {</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="keywordflow">if</span>
(is_set) { SetBit(bits, i); }</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span> }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> SetBitTo(uint8_t* bits, int64_t i, <span class="keywordtype">bool</span> bit_is_set) {</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="comment">// TODO: speed up. See https://graphics.stanford.edu/~seander/bithacks.html</span></div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="comment">// "Conditionally set or clear bits without branching"</span></div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  <span class="keywordflow">if</span> (bit_is_set) {</div><div cla
ss="line"><a name="l00141"></a><span class="lineno"> 141</span>  SetBit(bits, i);</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  ClearBit(bits, i);</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> }</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span> </div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="comment">// Returns the minimum number of bits needed to represent the value of 'x'</span></div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> NumRequiredBits(uint64_t x) {<
/div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 63; i >= 0; --i) {</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <span class="keywordflow">if</span> (x & (UINT64_C(1) << i)) <span class="keywordflow">return</span> i + 1;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  }</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> }</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> </div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t NextPower2(int64_t n) {</div><div class="line"><a name="l00
160"></a><span class="lineno"> 160</span>  n--;</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  n |= n >> 1;</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  n |= n >> 2;</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  n |= n >> 4;</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  n |= n >> 8;</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  n |= n >> 16;</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  n |= n >> 32;</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  n++;</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordflow">return</span> n;</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> }</div><div cla
ss="line"><a name="l00170"></a><span class="lineno"> 170</span> </div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> IsMultipleOf64(int64_t n) {</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  <span class="keywordflow">return</span> (n & 63) == 0;</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> }</div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span> </div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> IsMultipleOf8(int64_t n) {</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="keywordflow">return</span> (n & 7) == 0;</div><div class="line"><a nam
e="l00177"></a><span class="lineno"> 177</span> }</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t Ceil(int64_t value, int64_t divisor) {</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">return</span> value / divisor + (value % divisor != 0);</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span> }</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span> </div><div class="line"><a name="l00185"></a><span class="lineno"><a class="line" href="namespacearrow_1_1_bit_util.html#a579a683813940e32133af9e6c6acb2c4"> 185</a></span> <span class="keyword">inline</span> int64_t <a class="code" href="namespacearrow_1_1_bit_util.html#a579a683813940e32133af9e6c6acb2c4">RoundUp<
/a>(int64_t value, int64_t factor) {</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">return</span> (value + (factor - 1)) / factor * factor;</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span> }</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t RoundDown(int64_t value, int64_t factor) {</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  <span class="keywordflow">return</span> (value / factor) * factor;</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span> }</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span> </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="k
eyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> RoundUpToPowerOf2(<span class="keywordtype">int</span> value, <span class="keywordtype">int</span> factor) {</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="comment">// DCHECK((factor > 0) && ((factor & (factor - 1)) == 0));</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">return</span> (value + (factor - 1)) & ~(factor - 1);</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> }</div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> </div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> RoundDownToPowerOf2(<span class="keywordtype">int</span> value, <span class
="keywordtype">int</span> factor) {</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="comment">// DCHECK((factor > 0) && ((factor & (factor - 1)) == 0));</span></div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordflow">return</span> value & ~(factor - 1);</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span> }</div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span> </div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundUpNumBytes(uint32_t bits) {</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keywordflow">return</span> (bits + 7) >> 3;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> }</div><div class="line"
><a name="l00212"></a><span class="lineno"> 212</span> </div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundDownNumBytes(uint32_t bits) {</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">return</span> bits >> 3;</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> }</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span> </div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundUpNumi32(uint32_t bits) {</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">return</span> (bits + 31) >> 5;</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>
0;}</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundDownNumi32(uint32_t bits) {</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">return</span> bits >> 5;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span> }</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span> </div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundUpNumi64(uint32_t bits) {</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordflow">return</span> (bits + 63) >> 6;</div><div class="line"><a name="l00231"></a><span class="
lineno"> 231</span> }</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span> </div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint32_t RoundDownNumi64(uint32_t bits) {</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordflow">return</span> bits >> 6;</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> }</div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> </div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t RoundUpToMultipleOf64(int64_t num) {</div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  <span class="comment">// TODO(wesm): is this definitely needed?</span></div><div class="line
"><a name="l00240"></a><span class="lineno"> 240</span>  <span class="comment">// DCHECK_GE(num, 0);</span></div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  constexpr int64_t round_to = 64;</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  constexpr int64_t force_carry_addend = round_to - 1;</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  constexpr int64_t truncate_bitmask = ~(round_to - 1);</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  constexpr int64_t max_roundable_num = std::numeric_limits<int64_t>::max() - round_to;</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  <span class="keywordflow">if</span> (num <= max_roundable_num) { <span class="keywordflow">return</span> (num + force_carry_addend) & truncate_bitmask; }</div><div class="line"><a name="l00246"></a><span class="lineno"
> 246</span>  <span class="comment">// handle overflow case. This should result in a malloc error upstream</span></div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  <span class="keywordflow">return</span> num;</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span> }</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span> </div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> PopcountNoHw(uint64_t x) {</div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="keywordtype">int</span> count = 0;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="keywordflow">for</span> (; x != 0; ++count)</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span> 
; x &= x - 1;</div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">return</span> count;</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span> }</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span> </div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> Popcount(uint64_t x) {</div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="preprocessor">#ifdef ARROW_USE_SSE</span></div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">if</span> (<a class="code" href="compiler-util_8h.html#a262afcfe437f4addb13fb1b47a6a7086">LIKELY</a>(<a class="code" href="classarrow_1_1_cpu_info.html#ad111f08ae6a89fcc8c47b4fac7a32a3f">CpuInfo::IsSupported</a>
(<a class="code" href="classarrow_1_1_cpu_info.html#ae342a62dfe1a66ddf9dfd8c2b5374a39">CpuInfo::POPCNT</a>))) {</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">return</span> POPCNT_popcnt_u64(x);</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span>  } <span class="keywordflow">else</span> {</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span>  <span class="keywordflow">return</span> PopcountNoHw(x);</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  }</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="keywordflow">return</span> PopcountNoHw(x);</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="preprocessor">#en
dif</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment">// Compute correct population count for various-width signed integers</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> PopcountSigned(T v) {</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// Converting to same-width unsigned then extending preserves the bit pattern.</span></div><div class="line"><a name="l00277"></a><span class="li
neno"> 277</span>  <span class="keywordflow">return</span> BitUtil::Popcount(<span class="keyword">static_cast<</span>typename <a class="code" href="structarrow_1_1make__unsigned.html">make_unsigned<T>::type</a><span class="keyword">></span>(v));</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span> }</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint64_t TrailingBits(uint64_t v, <span class="keywordtype">int</span> num_bits) {</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">if</span> (<a class="code" href="compiler-util_8h.html#a9acc330d508b9a3b775cfdf7ce405e7d">UNLIKELY</a>(num_bits == 0)) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00283"></a><span c
lass="lineno"> 283</span>  <span class="keywordflow">if</span> (<a class="code" href="compiler-util_8h.html#a9acc330d508b9a3b775cfdf7ce405e7d">UNLIKELY</a>(num_bits >= 64)) <span class="keywordflow">return</span> v;</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="keywordtype">int</span> n = 64 - num_bits;</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keywordflow">return</span> (v << n) >> n;</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span> }</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span> </div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">int</span> Log2(uint64_t x) {</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="
comment">// DCHECK_GT(x, 0);</span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="keywordflow">if</span> (x == 1) <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">// Compute result = ceil(log2(x))</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">// = floor(log2(x - 1)) + 1, for x > 1</span></div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">// by finding the position of the most significant bit (1-indexed) of x - 1</span></div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// (floor(log2(n)) = MSB(n) (0-indexed))</span></div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  --x;</div><div class="line"><a name="l0
0299"></a><span class="lineno"> 299</span>  <span class="keywordtype">int</span> result = 1;</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">while</span> (x >>= 1)</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  ++result;</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span> }</div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span> </div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t ByteSwap(int64_t value) {</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keywordflow">return</span> <a class="code" href="bit-util_8h.html#a582f
bf29e9f0fbf6dd39031af11a8894">ARROW_BYTE_SWAP64</a>(value);</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> }</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint64_t ByteSwap(uint64_t value) {</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>uint64_t<span class="keyword">></span>(<a class="code" href="bit-util_8h.html#a582fbf29e9f0fbf6dd39031af11a8894">ARROW_BYTE_SWAP64</a>(value));</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span> }</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="keyword">static</span> <span class="keyword">inline</span> int32_t ByteSwap(int32_t value) {</div><div class="line"><a name="l00313"></a><span class="lineno"> 313<
/span>  <span class="keywordflow">return</span> <a class="code" href="bit-util_8h.html#a4fabecc746b1f8c287ca27cebdfb3eee">ARROW_BYTE_SWAP32</a>(value);</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> }</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint32_t ByteSwap(uint32_t value) {</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>uint32_t<span class="keyword">></span>(<a class="code" href="bit-util_8h.html#a4fabecc746b1f8c287ca27cebdfb3eee">ARROW_BYTE_SWAP32</a>(value));</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> }</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="keyword">static</span> <span class="keyword">inline</span> int16_t
ByteSwap(int16_t value) {</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  constexpr int16_t m = <span class="keyword">static_cast<</span>int16_t<span class="keyword">></span>(0xff);</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>int16_t<span class="keyword">></span>(((value >> 8) & m) | ((value & m) << 8));</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> }</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint16_t ByteSwap(uint16_t value) {</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>uint16_t<span class="keyword">></span>(ByteSwap(sta
tic_cast<int16_t>(value)));</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> }</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> </div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> ByteSwap(<span class="keywordtype">void</span>* dst, <span class="keyword">const</span> <span class="keywordtype">void</span>* src, <span class="keywordtype">int</span> len) {</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">switch</span> (len) {</div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="keywordflow">case</span> 1:</div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  *<span class="keyword">reinterpret_cast<</span>int8_t*<span class="keywo
rd">></span>(dst) = *reinterpret_cast<const int8_t*>(src);</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">case</span> 2:</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  *<span class="keyword">reinterpret_cast<</span>int16_t*<span class="keyword">></span>(dst) = ByteSwap(*reinterpret_cast<const int16_t*>(src));</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keywordflow">case</span> 4:</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  *<span class="keyword">reinterpret_cast<</span>int32_t*<span class="keyword">
></span>(dst) = ByteSwap(*reinterpret_cast<const int32_t*>(src));</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">case</span> 8:</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  *<span class="keyword">reinterpret_cast<</span>int64_t*<span class="keyword">></span>(dst) = ByteSwap(*reinterpret_cast<const int64_t*>(src));</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="
l00343"></a><span class="lineno"> 343</span>  }</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span> </div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  uint8_t* d = <span class="keyword">reinterpret_cast<</span>uint8_t*<span class="keyword">></span>(dst);</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <span class="keyword">const</span> uint8_t* s = <span class="keyword">reinterpret_cast<</span><span class="keyword">const </span>uint8_t*<span class="keyword">></span>(src);</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < len; ++i) {</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  d[i] = s[len - i - 1];</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  }</div><div class
="line"><a name="l00350"></a><span class="lineno"> 350</span> }</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span> </div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="preprocessor">#if __BYTE_ORDER == __LITTLE_ENDIAN</span></div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t ToBigEndian(int64_t value) {</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> }</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint64_t ToBigEndian(uint64_t value) {</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>
  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span> }</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="keyword">static</span> <span class="keyword">inline</span> int32_t ToBigEndian(int32_t value) {</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span> }</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint32_t ToBigEndian(uint32_t value) {</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span> }</div><d
iv class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="keyword">static</span> <span class="keyword">inline</span> int16_t ToBigEndian(int16_t value) {</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span> }</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint16_t ToBigEndian(uint16_t value) {</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> }</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00374"><
/a><span class="lineno"> 374</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t ToBigEndian(int64_t val) {</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span> }</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint64_t ToBigEndian(uint64_t val) {</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span> }</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="keyword">static</span> <span class="keyword">inline</span> int32_t ToBigEndian(int32_t val) {</div><div class="line"><a name="l003
81"></a><span class="lineno"> 381</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> }</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint32_t ToBigEndian(uint32_t val) {</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> }</div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="keyword">static</span> <span class="keyword">inline</span> int16_t ToBigEndian(int16_t val) {</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> }</div><
div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint16_t ToBigEndian(uint16_t val) {</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> }</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span> </div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span> <span class="preprocessor">#if __BYTE_ORDER == __LITTLE_ENDIAN</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t FromBigEndian(int64_t value) {</div><div class="line"><a name="l00397"><
/a><span class="lineno"> 397</span>  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span> }</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint64_t FromBigEndian(uint64_t value) {</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span> }</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span> <span class="keyword">static</span> <span class="keyword">inline</span> int32_t FromBigEndian(int32_t value) {</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00404"></a><span cl
ass="lineno"> 404</span> }</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint32_t FromBigEndian(uint32_t value) {</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> }</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="keyword">static</span> <span class="keyword">inline</span> int16_t FromBigEndian(int16_t value) {</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span> }</div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span> <span class="keyword">static</span> <
span class="keyword">inline</span> uint16_t FromBigEndian(uint16_t value) {</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span>  <span class="keywordflow">return</span> ByteSwap(value);</div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span> }</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="preprocessor">#else</span></div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="keyword">static</span> <span class="keyword">inline</span> int64_t FromBigEndian(int64_t val) {</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span> }</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint64_t
FromBigEndian(uint64_t val) {</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> }</div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="keyword">static</span> <span class="keyword">inline</span> int32_t FromBigEndian(int32_t val) {</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> }</div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint32_t FromBigEndian(uint32_t val) {</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  <span class="keywordflow">return</span> val;</div><div class="line
"><a name="l00426"></a><span class="lineno"> 426</span> }</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="keyword">static</span> <span class="keyword">inline</span> int16_t FromBigEndian(int16_t val) {</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> }</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span> <span class="keyword">static</span> <span class="keyword">inline</span> uint16_t FromBigEndian(uint16_t val) {</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keywordflow">return</span> val;</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> }</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="preprocessor">#endif<
/span></div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span> </div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span> <span class="comment">// Logical right shift for signed integer types</span></div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> <span class="comment">// This is needed because the C >> operator does arithmetic right shift</span></div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> <span class="comment">// Negative shift amounts lead to undefined behavior</span></div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="keyword">template</span> <<span class="keyword">typename</span> T></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="keyword">static</span> T ShiftRightLogical(T v, <span class="keywordtype">int</span> shift) {</div><div class="line"><a name="
l00440"></a><span class="lineno"> 440</span>  <span class="comment">// Conversion to unsigned ensures most significant bits always filled with 0's</span></div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>typename <a class="code" href="structarrow_1_1make__unsigned.html">make_unsigned<T>::type</a><span class="keyword">></span>(v) >> shift;</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span> }</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span> </div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span> <span class="keywordtype">void</span> <a class="code" href="namespacearrow_1_1_bit_util.html#aabb775a4d6129fb8e33a7b24e8b412dd">FillBitsFromBytes</a>(<span class="keyword">const</span> std::vector<uint8_t>& bytes, uint8_t* bits);</div><div class="li
ne"><a name="l00445"></a><span class="lineno"> 445</span> <a class="code" href="visibility_8h.html#a7060b7b5f11fc11ce77a4d30b37619ef">ARROW_EXPORT</a> <a class="code" href="classarrow_1_1_status.html">Status</a> <a class="code" href="namespacearrow_1_1_bit_util.html#adb2da8e090e9456b4e8ca6b05d6448f5">BytesToBits</a>(<span class="keyword">const</span> std::vector<uint8_t>&, std::shared_ptr<Buffer>*);</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span> </div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span> } <span class="comment">// namespace BitUtil</span></div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> </div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="comment">// ----------------------------------------------------------------------</span></div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> 
;<span class="comment">// Bitmap utilities</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span> </div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span> <a class="code" href="classarrow_1_1_status.html">Status</a> <a class="code" href="visibility_8h.html#a7060b7b5f11fc11ce77a4d30b37619ef">ARROW_EXPORT</a> <a class="code" href="namespacearrow.html#aad55168cd9074fddb1ce5f103d29c26f">GetEmptyBitmap</a>(</div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <a class="code" href="classarrow_1_1_memory_pool.html">MemoryPool</a>* pool, int64_t length, std::shared_ptr<MutableBuffer>* result);</div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span> </div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <a class="code" href="classarrow_1_1_status.html">Status</a> <a class="code" href="visibility_8h.html#a7060b7b5f11fc11ce77a4d30b37619ef
">ARROW_EXPORT</a> <a class="code" href="namespacearrow.html#a5e8c95adb60525560e52951a
<TRUNCATED>