You are viewing a plain text version of this content. The canonical link for it is here.
Posted to notifications@commons.apache.org by ch...@apache.org on 2018/09/22 23:12:34 UTC
svn commit: r1035574 [9/47] - in
/websites/production/commons/content/proper/commons-lang: ./ apidocs/
apidocs/org/apache/commons/lang3/ apidocs/org/apache/commons/lang3/arch/
apidocs/org/apache/commons/lang3/arch/class-use/
apidocs/org/apache/commons/...
Modified: websites/production/commons/content/proper/commons-lang/apidocs/src-html/org/apache/commons/lang3/Conversion.html
==============================================================================
--- websites/production/commons/content/proper/commons-lang/apidocs/src-html/org/apache/commons/lang3/Conversion.html (original)
+++ websites/production/commons/content/proper/commons-lang/apidocs/src-html/org/apache/commons/lang3/Conversion.html Sat Sep 22 23:12:29 2018
@@ -6,1571 +6,1569 @@
</head>
<body>
<div class="sourceContainer">
-<pre><span class="sourceLineNo">001</span>/*******************************************************************************<a name="line.1"></a>
-<span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a>
-<span class="sourceLineNo">003</span> * or more contributor license agreements. See the NOTICE file<a name="line.3"></a>
-<span class="sourceLineNo">004</span> * distributed with this work for additional information<a name="line.4"></a>
-<span class="sourceLineNo">005</span> * regarding copyright ownership. The ASF licenses this file<a name="line.5"></a>
-<span class="sourceLineNo">006</span> * to you under the Apache License, Version 2.0 (the<a name="line.6"></a>
-<span class="sourceLineNo">007</span> * "License"); you may not use this file except in compliance<a name="line.7"></a>
-<span class="sourceLineNo">008</span> * with the License. You may obtain a copy of the License at<a name="line.8"></a>
-<span class="sourceLineNo">009</span> *<a name="line.9"></a>
-<span class="sourceLineNo">010</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a>
-<span class="sourceLineNo">011</span> *<a name="line.11"></a>
-<span class="sourceLineNo">012</span> * Unless required by applicable law or agreed to in writing,<a name="line.12"></a>
-<span class="sourceLineNo">013</span> * software distributed under the License is distributed on an<a name="line.13"></a>
-<span class="sourceLineNo">014</span> * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY<a name="line.14"></a>
-<span class="sourceLineNo">015</span> * KIND, either express or implied. See the License for the<a name="line.15"></a>
-<span class="sourceLineNo">016</span> * specific language governing permissions and limitations<a name="line.16"></a>
-<span class="sourceLineNo">017</span> * under the License.<a name="line.17"></a>
-<span class="sourceLineNo">018</span> *******************************************************************************/<a name="line.18"></a>
-<span class="sourceLineNo">019</span>package org.apache.commons.lang3;<a name="line.19"></a>
+<pre><span class="sourceLineNo">001</span>/*<a name="line.1"></a>
+<span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one or more<a name="line.2"></a>
+<span class="sourceLineNo">003</span> * contributor license agreements. See the NOTICE file distributed with<a name="line.3"></a>
+<span class="sourceLineNo">004</span> * this work for additional information regarding copyright ownership.<a name="line.4"></a>
+<span class="sourceLineNo">005</span> * The ASF licenses this file to You under the Apache License, Version 2.0<a name="line.5"></a>
+<span class="sourceLineNo">006</span> * (the "License"); you may not use this file except in compliance with<a name="line.6"></a>
+<span class="sourceLineNo">007</span> * the License. You may obtain a copy of the License at<a name="line.7"></a>
+<span class="sourceLineNo">008</span> *<a name="line.8"></a>
+<span class="sourceLineNo">009</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.9"></a>
+<span class="sourceLineNo">010</span> *<a name="line.10"></a>
+<span class="sourceLineNo">011</span> * Unless required by applicable law or agreed to in writing, software<a name="line.11"></a>
+<span class="sourceLineNo">012</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.12"></a>
+<span class="sourceLineNo">013</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.13"></a>
+<span class="sourceLineNo">014</span> * See the License for the specific language governing permissions and<a name="line.14"></a>
+<span class="sourceLineNo">015</span> * limitations under the License.<a name="line.15"></a>
+<span class="sourceLineNo">016</span> */<a name="line.16"></a>
+<span class="sourceLineNo">017</span>package org.apache.commons.lang3;<a name="line.17"></a>
+<span class="sourceLineNo">018</span><a name="line.18"></a>
+<span class="sourceLineNo">019</span>import java.util.UUID;<a name="line.19"></a>
<span class="sourceLineNo">020</span><a name="line.20"></a>
-<span class="sourceLineNo">021</span>import java.util.UUID;<a name="line.21"></a>
-<span class="sourceLineNo">022</span><a name="line.22"></a>
-<span class="sourceLineNo">023</span><a name="line.23"></a>
-<span class="sourceLineNo">024</span>/**<a name="line.24"></a>
-<span class="sourceLineNo">025</span> * <p><a name="line.25"></a>
-<span class="sourceLineNo">026</span> * Static methods to convert a type into another, with endianness and bit ordering awareness.<a name="line.26"></a>
-<span class="sourceLineNo">027</span> * </p><a name="line.27"></a>
-<span class="sourceLineNo">028</span> * <p><a name="line.28"></a>
-<span class="sourceLineNo">029</span> * The methods names follow a naming rule:<br><a name="line.29"></a>
-<span class="sourceLineNo">030</span> * {@code <source type>[source endianness][source bit ordering]To<destination type>[destination endianness][destination bit ordering]}<a name="line.30"></a>
-<span class="sourceLineNo">031</span> * </p><a name="line.31"></a>
-<span class="sourceLineNo">032</span> * <p><a name="line.32"></a>
-<span class="sourceLineNo">033</span> * Source/destination type fields is one of the following:<a name="line.33"></a>
-<span class="sourceLineNo">034</span> * </p><a name="line.34"></a>
-<span class="sourceLineNo">035</span> * <ul><a name="line.35"></a>
-<span class="sourceLineNo">036</span> * <li>binary: an array of booleans</li><a name="line.36"></a>
-<span class="sourceLineNo">037</span> * <li>byte or byteArray</li><a name="line.37"></a>
-<span class="sourceLineNo">038</span> * <li>int or intArray</li><a name="line.38"></a>
-<span class="sourceLineNo">039</span> * <li>long or longArray</li><a name="line.39"></a>
-<span class="sourceLineNo">040</span> * <li>hex: a String containing hexadecimal digits (lowercase in destination)</li><a name="line.40"></a>
-<span class="sourceLineNo">041</span> * <li>hexDigit: a Char containing a hexadecimal digit (lowercase in destination)</li><a name="line.41"></a>
-<span class="sourceLineNo">042</span> * <li>uuid</li><a name="line.42"></a>
-<span class="sourceLineNo">043</span> * </ul><a name="line.43"></a>
-<span class="sourceLineNo">044</span> * <p><a name="line.44"></a>
-<span class="sourceLineNo">045</span> * Endianness field: little endian is the default, in this case the field is absent. In case of<a name="line.45"></a>
-<span class="sourceLineNo">046</span> * big endian, the field is "Be".<br> Bit ordering: Lsb0 is the default, in this case the field<a name="line.46"></a>
-<span class="sourceLineNo">047</span> * is absent. In case of Msb0, the field is "Msb0".<a name="line.47"></a>
-<span class="sourceLineNo">048</span> * </p><a name="line.48"></a>
-<span class="sourceLineNo">049</span> * <p><a name="line.49"></a>
-<span class="sourceLineNo">050</span> * Example: intBeMsb0ToHex convert an int with big endian byte order and Msb0 bit order into its<a name="line.50"></a>
-<span class="sourceLineNo">051</span> * hexadecimal string representation<a name="line.51"></a>
-<span class="sourceLineNo">052</span> * </p><a name="line.52"></a>
-<span class="sourceLineNo">053</span> * <p><a name="line.53"></a>
-<span class="sourceLineNo">054</span> * Most of the methods provide only default encoding for destination, this limits the number of<a name="line.54"></a>
-<span class="sourceLineNo">055</span> * ways to do one thing. Unless you are dealing with data from/to outside of the JVM platform,<a name="line.55"></a>
-<span class="sourceLineNo">056</span> * you should not need to use "Be" and "Msb0" methods.<a name="line.56"></a>
-<span class="sourceLineNo">057</span> * </p><a name="line.57"></a>
-<span class="sourceLineNo">058</span> * <p><a name="line.58"></a>
-<span class="sourceLineNo">059</span> * Development status: work on going, only a part of the little endian, Lsb0 methods implemented<a name="line.59"></a>
-<span class="sourceLineNo">060</span> * so far.<a name="line.60"></a>
-<span class="sourceLineNo">061</span> * </p><a name="line.61"></a>
-<span class="sourceLineNo">062</span> *<a name="line.62"></a>
-<span class="sourceLineNo">063</span> * @since 3.2<a name="line.63"></a>
-<span class="sourceLineNo">064</span> */<a name="line.64"></a>
+<span class="sourceLineNo">021</span><a name="line.21"></a>
+<span class="sourceLineNo">022</span>/**<a name="line.22"></a>
+<span class="sourceLineNo">023</span> * <p><a name="line.23"></a>
+<span class="sourceLineNo">024</span> * Static methods to convert a type into another, with endianness and bit ordering awareness.<a name="line.24"></a>
+<span class="sourceLineNo">025</span> * </p><a name="line.25"></a>
+<span class="sourceLineNo">026</span> * <p><a name="line.26"></a>
+<span class="sourceLineNo">027</span> * The methods names follow a naming rule:<br><a name="line.27"></a>
+<span class="sourceLineNo">028</span> * {@code <source type>[source endianness][source bit ordering]To<destination type>[destination endianness][destination bit ordering]}<a name="line.28"></a>
+<span class="sourceLineNo">029</span> * </p><a name="line.29"></a>
+<span class="sourceLineNo">030</span> * <p><a name="line.30"></a>
+<span class="sourceLineNo">031</span> * Source/destination type fields is one of the following:<a name="line.31"></a>
+<span class="sourceLineNo">032</span> * </p><a name="line.32"></a>
+<span class="sourceLineNo">033</span> * <ul><a name="line.33"></a>
+<span class="sourceLineNo">034</span> * <li>binary: an array of booleans</li><a name="line.34"></a>
+<span class="sourceLineNo">035</span> * <li>byte or byteArray</li><a name="line.35"></a>
+<span class="sourceLineNo">036</span> * <li>int or intArray</li><a name="line.36"></a>
+<span class="sourceLineNo">037</span> * <li>long or longArray</li><a name="line.37"></a>
+<span class="sourceLineNo">038</span> * <li>hex: a String containing hexadecimal digits (lowercase in destination)</li><a name="line.38"></a>
+<span class="sourceLineNo">039</span> * <li>hexDigit: a Char containing a hexadecimal digit (lowercase in destination)</li><a name="line.39"></a>
+<span class="sourceLineNo">040</span> * <li>uuid</li><a name="line.40"></a>
+<span class="sourceLineNo">041</span> * </ul><a name="line.41"></a>
+<span class="sourceLineNo">042</span> * <p><a name="line.42"></a>
+<span class="sourceLineNo">043</span> * Endianness field: little endian is the default, in this case the field is absent. In case of<a name="line.43"></a>
+<span class="sourceLineNo">044</span> * big endian, the field is "Be".<br> Bit ordering: Lsb0 is the default, in this case the field<a name="line.44"></a>
+<span class="sourceLineNo">045</span> * is absent. In case of Msb0, the field is "Msb0".<a name="line.45"></a>
+<span class="sourceLineNo">046</span> * </p><a name="line.46"></a>
+<span class="sourceLineNo">047</span> * <p><a name="line.47"></a>
+<span class="sourceLineNo">048</span> * Example: intBeMsb0ToHex convert an int with big endian byte order and Msb0 bit order into its<a name="line.48"></a>
+<span class="sourceLineNo">049</span> * hexadecimal string representation<a name="line.49"></a>
+<span class="sourceLineNo">050</span> * </p><a name="line.50"></a>
+<span class="sourceLineNo">051</span> * <p><a name="line.51"></a>
+<span class="sourceLineNo">052</span> * Most of the methods provide only default encoding for destination, this limits the number of<a name="line.52"></a>
+<span class="sourceLineNo">053</span> * ways to do one thing. Unless you are dealing with data from/to outside of the JVM platform,<a name="line.53"></a>
+<span class="sourceLineNo">054</span> * you should not need to use "Be" and "Msb0" methods.<a name="line.54"></a>
+<span class="sourceLineNo">055</span> * </p><a name="line.55"></a>
+<span class="sourceLineNo">056</span> * <p><a name="line.56"></a>
+<span class="sourceLineNo">057</span> * Development status: work on going, only a part of the little endian, Lsb0 methods implemented<a name="line.57"></a>
+<span class="sourceLineNo">058</span> * so far.<a name="line.58"></a>
+<span class="sourceLineNo">059</span> * </p><a name="line.59"></a>
+<span class="sourceLineNo">060</span> *<a name="line.60"></a>
+<span class="sourceLineNo">061</span> * @since 3.2<a name="line.61"></a>
+<span class="sourceLineNo">062</span> */<a name="line.62"></a>
+<span class="sourceLineNo">063</span><a name="line.63"></a>
+<span class="sourceLineNo">064</span>public class Conversion {<a name="line.64"></a>
<span class="sourceLineNo">065</span><a name="line.65"></a>
-<span class="sourceLineNo">066</span>public class Conversion {<a name="line.66"></a>
-<span class="sourceLineNo">067</span><a name="line.67"></a>
-<span class="sourceLineNo">068</span> private static final boolean[] TTTT = {true, true, true, true};<a name="line.68"></a>
-<span class="sourceLineNo">069</span> private static final boolean[] FTTT = {false, true, true, true};<a name="line.69"></a>
-<span class="sourceLineNo">070</span> private static final boolean[] TFTT = {true, false, true, true};<a name="line.70"></a>
-<span class="sourceLineNo">071</span> private static final boolean[] FFTT = {false, false, true, true};<a name="line.71"></a>
-<span class="sourceLineNo">072</span> private static final boolean[] TTFT = {true, true, false, true};<a name="line.72"></a>
-<span class="sourceLineNo">073</span> private static final boolean[] FTFT = {false, true, false, true};<a name="line.73"></a>
-<span class="sourceLineNo">074</span> private static final boolean[] TFFT = {true, false, false, true};<a name="line.74"></a>
-<span class="sourceLineNo">075</span> private static final boolean[] FFFT = {false, false, false, true};<a name="line.75"></a>
-<span class="sourceLineNo">076</span> private static final boolean[] TTTF = {true, true, true, false};<a name="line.76"></a>
-<span class="sourceLineNo">077</span> private static final boolean[] FTTF = {false, true, true, false};<a name="line.77"></a>
-<span class="sourceLineNo">078</span> private static final boolean[] TFTF = {true, false, true, false};<a name="line.78"></a>
-<span class="sourceLineNo">079</span> private static final boolean[] FFTF = {false, false, true, false};<a name="line.79"></a>
-<span class="sourceLineNo">080</span> private static final boolean[] TTFF = {true, true, false, false};<a name="line.80"></a>
-<span class="sourceLineNo">081</span> private static final boolean[] FTFF = {false, true, false, false};<a name="line.81"></a>
-<span class="sourceLineNo">082</span> private static final boolean[] TFFF = {true, false, false, false};<a name="line.82"></a>
-<span class="sourceLineNo">083</span> private static final boolean[] FFFF = {false, false, false, false};<a name="line.83"></a>
-<span class="sourceLineNo">084</span><a name="line.84"></a>
-<span class="sourceLineNo">085</span> /**<a name="line.85"></a>
-<span class="sourceLineNo">086</span> * <p><a name="line.86"></a>
-<span class="sourceLineNo">087</span> * Converts a hexadecimal digit into an int using the default (Lsb0) bit ordering.<a name="line.87"></a>
-<span class="sourceLineNo">088</span> * </p><a name="line.88"></a>
-<span class="sourceLineNo">089</span> * <p><a name="line.89"></a>
-<span class="sourceLineNo">090</span> * '1' is converted to 1<a name="line.90"></a>
-<span class="sourceLineNo">091</span> * </p><a name="line.91"></a>
-<span class="sourceLineNo">092</span> *<a name="line.92"></a>
-<span class="sourceLineNo">093</span> * @param hexDigit the hexadecimal digit to convert<a name="line.93"></a>
-<span class="sourceLineNo">094</span> * @return an int equals to {@code hexDigit}<a name="line.94"></a>
-<span class="sourceLineNo">095</span> * @throws IllegalArgumentException if {@code hexDigit} is not a hexadecimal digit<a name="line.95"></a>
-<span class="sourceLineNo">096</span> */<a name="line.96"></a>
-<span class="sourceLineNo">097</span> public static int hexDigitToInt(final char hexDigit) {<a name="line.97"></a>
-<span class="sourceLineNo">098</span> final int digit = Character.digit(hexDigit, 16);<a name="line.98"></a>
-<span class="sourceLineNo">099</span> if (digit < 0) {<a name="line.99"></a>
-<span class="sourceLineNo">100</span> throw new IllegalArgumentException("Cannot interpret '" + hexDigit + "' as a hexadecimal digit");<a name="line.100"></a>
-<span class="sourceLineNo">101</span> }<a name="line.101"></a>
-<span class="sourceLineNo">102</span> return digit;<a name="line.102"></a>
-<span class="sourceLineNo">103</span> }<a name="line.103"></a>
-<span class="sourceLineNo">104</span><a name="line.104"></a>
-<span class="sourceLineNo">105</span> /**<a name="line.105"></a>
-<span class="sourceLineNo">106</span> * <p><a name="line.106"></a>
-<span class="sourceLineNo">107</span> * Converts a hexadecimal digit into an int using the Msb0 bit ordering.<a name="line.107"></a>
-<span class="sourceLineNo">108</span> * </p><a name="line.108"></a>
-<span class="sourceLineNo">109</span> * <p><a name="line.109"></a>
-<span class="sourceLineNo">110</span> * '1' is converted to 8<a name="line.110"></a>
-<span class="sourceLineNo">111</span> * </p><a name="line.111"></a>
-<span class="sourceLineNo">112</span> *<a name="line.112"></a>
-<span class="sourceLineNo">113</span> * @param hexDigit the hexadecimal digit to convert<a name="line.113"></a>
-<span class="sourceLineNo">114</span> * @return an int equals to {@code hexDigit}<a name="line.114"></a>
-<span class="sourceLineNo">115</span> * @throws IllegalArgumentException if {@code hexDigit} is not a hexadecimal digit<a name="line.115"></a>
-<span class="sourceLineNo">116</span> */<a name="line.116"></a>
-<span class="sourceLineNo">117</span> public static int hexDigitMsb0ToInt(final char hexDigit) {<a name="line.117"></a>
-<span class="sourceLineNo">118</span> switch (hexDigit) {<a name="line.118"></a>
-<span class="sourceLineNo">119</span> case '0':<a name="line.119"></a>
-<span class="sourceLineNo">120</span> return 0x0;<a name="line.120"></a>
-<span class="sourceLineNo">121</span> case '1':<a name="line.121"></a>
-<span class="sourceLineNo">122</span> return 0x8;<a name="line.122"></a>
-<span class="sourceLineNo">123</span> case '2':<a name="line.123"></a>
-<span class="sourceLineNo">124</span> return 0x4;<a name="line.124"></a>
-<span class="sourceLineNo">125</span> case '3':<a name="line.125"></a>
-<span class="sourceLineNo">126</span> return 0xC;<a name="line.126"></a>
-<span class="sourceLineNo">127</span> case '4':<a name="line.127"></a>
-<span class="sourceLineNo">128</span> return 0x2;<a name="line.128"></a>
-<span class="sourceLineNo">129</span> case '5':<a name="line.129"></a>
-<span class="sourceLineNo">130</span> return 0xA;<a name="line.130"></a>
-<span class="sourceLineNo">131</span> case '6':<a name="line.131"></a>
-<span class="sourceLineNo">132</span> return 0x6;<a name="line.132"></a>
-<span class="sourceLineNo">133</span> case '7':<a name="line.133"></a>
-<span class="sourceLineNo">134</span> return 0xE;<a name="line.134"></a>
-<span class="sourceLineNo">135</span> case '8':<a name="line.135"></a>
-<span class="sourceLineNo">136</span> return 0x1;<a name="line.136"></a>
-<span class="sourceLineNo">137</span> case '9':<a name="line.137"></a>
-<span class="sourceLineNo">138</span> return 0x9;<a name="line.138"></a>
-<span class="sourceLineNo">139</span> case 'a':// fall through<a name="line.139"></a>
-<span class="sourceLineNo">140</span> case 'A':<a name="line.140"></a>
-<span class="sourceLineNo">141</span> return 0x5;<a name="line.141"></a>
-<span class="sourceLineNo">142</span> case 'b':// fall through<a name="line.142"></a>
-<span class="sourceLineNo">143</span> case 'B':<a name="line.143"></a>
-<span class="sourceLineNo">144</span> return 0xD;<a name="line.144"></a>
-<span class="sourceLineNo">145</span> case 'c':// fall through<a name="line.145"></a>
-<span class="sourceLineNo">146</span> case 'C':<a name="line.146"></a>
-<span class="sourceLineNo">147</span> return 0x3;<a name="line.147"></a>
-<span class="sourceLineNo">148</span> case 'd':// fall through<a name="line.148"></a>
-<span class="sourceLineNo">149</span> case 'D':<a name="line.149"></a>
-<span class="sourceLineNo">150</span> return 0xB;<a name="line.150"></a>
-<span class="sourceLineNo">151</span> case 'e':// fall through<a name="line.151"></a>
-<span class="sourceLineNo">152</span> case 'E':<a name="line.152"></a>
-<span class="sourceLineNo">153</span> return 0x7;<a name="line.153"></a>
-<span class="sourceLineNo">154</span> case 'f':// fall through<a name="line.154"></a>
-<span class="sourceLineNo">155</span> case 'F':<a name="line.155"></a>
-<span class="sourceLineNo">156</span> return 0xF;<a name="line.156"></a>
-<span class="sourceLineNo">157</span> default:<a name="line.157"></a>
-<span class="sourceLineNo">158</span> throw new IllegalArgumentException("Cannot interpret '" + hexDigit + "' as a hexadecimal digit");<a name="line.158"></a>
-<span class="sourceLineNo">159</span> }<a name="line.159"></a>
-<span class="sourceLineNo">160</span> }<a name="line.160"></a>
-<span class="sourceLineNo">161</span><a name="line.161"></a>
-<span class="sourceLineNo">162</span> /**<a name="line.162"></a>
-<span class="sourceLineNo">163</span> * <p><a name="line.163"></a>
-<span class="sourceLineNo">164</span> * Converts a hexadecimal digit into binary (represented as boolean array) using the default<a name="line.164"></a>
-<span class="sourceLineNo">165</span> * (Lsb0) bit ordering.<a name="line.165"></a>
-<span class="sourceLineNo">166</span> * </p><a name="line.166"></a>
-<span class="sourceLineNo">167</span> * <p><a name="line.167"></a>
-<span class="sourceLineNo">168</span> * '1' is converted as follow: (1, 0, 0, 0)<a name="line.168"></a>
-<span class="sourceLineNo">169</span> * </p><a name="line.169"></a>
-<span class="sourceLineNo">170</span> *<a name="line.170"></a>
-<span class="sourceLineNo">171</span> * @param hexDigit the hexadecimal digit to convert<a name="line.171"></a>
-<span class="sourceLineNo">172</span> * @return a boolean array with the binary representation of {@code hexDigit}<a name="line.172"></a>
-<span class="sourceLineNo">173</span> * @throws IllegalArgumentException if {@code hexDigit} is not a hexadecimal digit<a name="line.173"></a>
-<span class="sourceLineNo">174</span> */<a name="line.174"></a>
-<span class="sourceLineNo">175</span> public static boolean[] hexDigitToBinary(final char hexDigit) {<a name="line.175"></a>
-<span class="sourceLineNo">176</span> switch (hexDigit) {<a name="line.176"></a>
-<span class="sourceLineNo">177</span> case '0':<a name="line.177"></a>
-<span class="sourceLineNo">178</span> return FFFF.clone();<a name="line.178"></a>
-<span class="sourceLineNo">179</span> case '1':<a name="line.179"></a>
-<span class="sourceLineNo">180</span> return TFFF.clone();<a name="line.180"></a>
-<span class="sourceLineNo">181</span> case '2':<a name="line.181"></a>
-<span class="sourceLineNo">182</span> return FTFF.clone();<a name="line.182"></a>
-<span class="sourceLineNo">183</span> case '3':<a name="line.183"></a>
-<span class="sourceLineNo">184</span> return TTFF.clone();<a name="line.184"></a>
-<span class="sourceLineNo">185</span> case '4':<a name="line.185"></a>
-<span class="sourceLineNo">186</span> return FFTF.clone();<a name="line.186"></a>
-<span class="sourceLineNo">187</span> case '5':<a name="line.187"></a>
-<span class="sourceLineNo">188</span> return TFTF.clone();<a name="line.188"></a>
-<span class="sourceLineNo">189</span> case '6':<a name="line.189"></a>
-<span class="sourceLineNo">190</span> return FTTF.clone();<a name="line.190"></a>
-<span class="sourceLineNo">191</span> case '7':<a name="line.191"></a>
-<span class="sourceLineNo">192</span> return TTTF.clone();<a name="line.192"></a>
-<span class="sourceLineNo">193</span> case '8':<a name="line.193"></a>
-<span class="sourceLineNo">194</span> return FFFT.clone();<a name="line.194"></a>
-<span class="sourceLineNo">195</span> case '9':<a name="line.195"></a>
-<span class="sourceLineNo">196</span> return TFFT.clone();<a name="line.196"></a>
-<span class="sourceLineNo">197</span> case 'a':// fall through<a name="line.197"></a>
-<span class="sourceLineNo">198</span> case 'A':<a name="line.198"></a>
-<span class="sourceLineNo">199</span> return FTFT.clone();<a name="line.199"></a>
-<span class="sourceLineNo">200</span> case 'b':// fall through<a name="line.200"></a>
-<span class="sourceLineNo">201</span> case 'B':<a name="line.201"></a>
-<span class="sourceLineNo">202</span> return TTFT.clone();<a name="line.202"></a>
-<span class="sourceLineNo">203</span> case 'c':// fall through<a name="line.203"></a>
-<span class="sourceLineNo">204</span> case 'C':<a name="line.204"></a>
-<span class="sourceLineNo">205</span> return FFTT.clone();<a name="line.205"></a>
-<span class="sourceLineNo">206</span> case 'd':// fall through<a name="line.206"></a>
-<span class="sourceLineNo">207</span> case 'D':<a name="line.207"></a>
-<span class="sourceLineNo">208</span> return TFTT.clone();<a name="line.208"></a>
-<span class="sourceLineNo">209</span> case 'e':// fall through<a name="line.209"></a>
-<span class="sourceLineNo">210</span> case 'E':<a name="line.210"></a>
-<span class="sourceLineNo">211</span> return FTTT.clone();<a name="line.211"></a>
-<span class="sourceLineNo">212</span> case 'f':// fall through<a name="line.212"></a>
-<span class="sourceLineNo">213</span> case 'F':<a name="line.213"></a>
-<span class="sourceLineNo">214</span> return TTTT.clone();<a name="line.214"></a>
-<span class="sourceLineNo">215</span> default:<a name="line.215"></a>
-<span class="sourceLineNo">216</span> throw new IllegalArgumentException("Cannot interpret '" + hexDigit + "' as a hexadecimal digit");<a name="line.216"></a>
-<span class="sourceLineNo">217</span> }<a name="line.217"></a>
-<span class="sourceLineNo">218</span> }<a name="line.218"></a>
-<span class="sourceLineNo">219</span><a name="line.219"></a>
-<span class="sourceLineNo">220</span> /**<a name="line.220"></a>
-<span class="sourceLineNo">221</span> * <p><a name="line.221"></a>
-<span class="sourceLineNo">222</span> * Converts a hexadecimal digit into binary (represented as boolean array) using the Msb0<a name="line.222"></a>
-<span class="sourceLineNo">223</span> * bit ordering.<a name="line.223"></a>
-<span class="sourceLineNo">224</span> * </p><a name="line.224"></a>
-<span class="sourceLineNo">225</span> * <p><a name="line.225"></a>
-<span class="sourceLineNo">226</span> * '1' is converted as follow: (0, 0, 0, 1)<a name="line.226"></a>
-<span class="sourceLineNo">227</span> * </p><a name="line.227"></a>
-<span class="sourceLineNo">228</span> *<a name="line.228"></a>
-<span class="sourceLineNo">229</span> * @param hexDigit the hexadecimal digit to convert<a name="line.229"></a>
-<span class="sourceLineNo">230</span> * @return a boolean array with the binary representation of {@code hexDigit}<a name="line.230"></a>
-<span class="sourceLineNo">231</span> * @throws IllegalArgumentException if {@code hexDigit} is not a hexadecimal digit<a name="line.231"></a>
-<span class="sourceLineNo">232</span> */<a name="line.232"></a>
-<span class="sourceLineNo">233</span> public static boolean[] hexDigitMsb0ToBinary(final char hexDigit) {<a name="line.233"></a>
-<span class="sourceLineNo">234</span> switch (hexDigit) {<a name="line.234"></a>
-<span class="sourceLineNo">235</span> case '0':<a name="line.235"></a>
-<span class="sourceLineNo">236</span> return FFFF.clone();<a name="line.236"></a>
-<span class="sourceLineNo">237</span> case '1':<a name="line.237"></a>
-<span class="sourceLineNo">238</span> return FFFT.clone();<a name="line.238"></a>
-<span class="sourceLineNo">239</span> case '2':<a name="line.239"></a>
-<span class="sourceLineNo">240</span> return FFTF.clone();<a name="line.240"></a>
-<span class="sourceLineNo">241</span> case '3':<a name="line.241"></a>
-<span class="sourceLineNo">242</span> return FFTT.clone();<a name="line.242"></a>
-<span class="sourceLineNo">243</span> case '4':<a name="line.243"></a>
-<span class="sourceLineNo">244</span> return FTFF.clone();<a name="line.244"></a>
-<span class="sourceLineNo">245</span> case '5':<a name="line.245"></a>
-<span class="sourceLineNo">246</span> return FTFT.clone();<a name="line.246"></a>
-<span class="sourceLineNo">247</span> case '6':<a name="line.247"></a>
-<span class="sourceLineNo">248</span> return FTTF.clone();<a name="line.248"></a>
-<span class="sourceLineNo">249</span> case '7':<a name="line.249"></a>
-<span class="sourceLineNo">250</span> return FTTT.clone();<a name="line.250"></a>
-<span class="sourceLineNo">251</span> case '8':<a name="line.251"></a>
-<span class="sourceLineNo">252</span> return TFFF.clone();<a name="line.252"></a>
-<span class="sourceLineNo">253</span> case '9':<a name="line.253"></a>
-<span class="sourceLineNo">254</span> return TFFT.clone();<a name="line.254"></a>
-<span class="sourceLineNo">255</span> case 'a':// fall through<a name="line.255"></a>
-<span class="sourceLineNo">256</span> case 'A':<a name="line.256"></a>
-<span class="sourceLineNo">257</span> return TFTF.clone();<a name="line.257"></a>
-<span class="sourceLineNo">258</span> case 'b':// fall through<a name="line.258"></a>
-<span class="sourceLineNo">259</span> case 'B':<a name="line.259"></a>
-<span class="sourceLineNo">260</span> return TFTT.clone();<a name="line.260"></a>
-<span class="sourceLineNo">261</span> case 'c':// fall through<a name="line.261"></a>
-<span class="sourceLineNo">262</span> case 'C':<a name="line.262"></a>
-<span class="sourceLineNo">263</span> return TTFF.clone();<a name="line.263"></a>
-<span class="sourceLineNo">264</span> case 'd':// fall through<a name="line.264"></a>
-<span class="sourceLineNo">265</span> case 'D':<a name="line.265"></a>
-<span class="sourceLineNo">266</span> return TTFT.clone();<a name="line.266"></a>
-<span class="sourceLineNo">267</span> case 'e':// fall through<a name="line.267"></a>
-<span class="sourceLineNo">268</span> case 'E':<a name="line.268"></a>
-<span class="sourceLineNo">269</span> return TTTF.clone();<a name="line.269"></a>
-<span class="sourceLineNo">270</span> case 'f':// fall through<a name="line.270"></a>
-<span class="sourceLineNo">271</span> case 'F':<a name="line.271"></a>
-<span class="sourceLineNo">272</span> return TTTT.clone();<a name="line.272"></a>
-<span class="sourceLineNo">273</span> default:<a name="line.273"></a>
-<span class="sourceLineNo">274</span> throw new IllegalArgumentException("Cannot interpret '" + hexDigit + "' as a hexadecimal digit");<a name="line.274"></a>
-<span class="sourceLineNo">275</span> }<a name="line.275"></a>
-<span class="sourceLineNo">276</span> }<a name="line.276"></a>
-<span class="sourceLineNo">277</span><a name="line.277"></a>
-<span class="sourceLineNo">278</span> /**<a name="line.278"></a>
-<span class="sourceLineNo">279</span> * <p><a name="line.279"></a>
-<span class="sourceLineNo">280</span> * Converts binary (represented as boolean array) to a hexadecimal digit using the default<a name="line.280"></a>
-<span class="sourceLineNo">281</span> * (Lsb0) bit ordering.<a name="line.281"></a>
-<span class="sourceLineNo">282</span> * </p><a name="line.282"></a>
-<span class="sourceLineNo">283</span> * <p><a name="line.283"></a>
-<span class="sourceLineNo">284</span> * (1, 0, 0, 0) is converted as follow: '1'<a name="line.284"></a>
-<span class="sourceLineNo">285</span> * </p><a name="line.285"></a>
-<span class="sourceLineNo">286</span> *<a name="line.286"></a>
-<span class="sourceLineNo">287</span> * @param src the binary to convert<a name="line.287"></a>
-<span class="sourceLineNo">288</span> * @return a hexadecimal digit representing the selected bits<a name="line.288"></a>
-<span class="sourceLineNo">289</span> * @throws IllegalArgumentException if {@code src} is empty<a name="line.289"></a>
-<span class="sourceLineNo">290</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.290"></a>
-<span class="sourceLineNo">291</span> */<a name="line.291"></a>
-<span class="sourceLineNo">292</span> public static char binaryToHexDigit(final boolean[] src) {<a name="line.292"></a>
-<span class="sourceLineNo">293</span> return binaryToHexDigit(src, 0);<a name="line.293"></a>
-<span class="sourceLineNo">294</span> }<a name="line.294"></a>
-<span class="sourceLineNo">295</span><a name="line.295"></a>
-<span class="sourceLineNo">296</span> /**<a name="line.296"></a>
-<span class="sourceLineNo">297</span> * <p><a name="line.297"></a>
-<span class="sourceLineNo">298</span> * Converts binary (represented as boolean array) to a hexadecimal digit using the default<a name="line.298"></a>
-<span class="sourceLineNo">299</span> * (Lsb0) bit ordering.<a name="line.299"></a>
-<span class="sourceLineNo">300</span> * </p><a name="line.300"></a>
-<span class="sourceLineNo">301</span> * <p><a name="line.301"></a>
-<span class="sourceLineNo">302</span> * (1, 0, 0, 0) is converted as follow: '1'<a name="line.302"></a>
-<span class="sourceLineNo">303</span> * </p><a name="line.303"></a>
-<span class="sourceLineNo">304</span> *<a name="line.304"></a>
-<span class="sourceLineNo">305</span> * @param src the binary to convert<a name="line.305"></a>
-<span class="sourceLineNo">306</span> * @param srcPos the position of the lsb to start the conversion<a name="line.306"></a>
-<span class="sourceLineNo">307</span> * @return a hexadecimal digit representing the selected bits<a name="line.307"></a>
-<span class="sourceLineNo">308</span> * @throws IllegalArgumentException if {@code src} is empty<a name="line.308"></a>
-<span class="sourceLineNo">309</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.309"></a>
-<span class="sourceLineNo">310</span> */<a name="line.310"></a>
-<span class="sourceLineNo">311</span> public static char binaryToHexDigit(final boolean[] src, final int srcPos) {<a name="line.311"></a>
-<span class="sourceLineNo">312</span> if (src.length == 0) {<a name="line.312"></a>
-<span class="sourceLineNo">313</span> throw new IllegalArgumentException("Cannot convert an empty array.");<a name="line.313"></a>
-<span class="sourceLineNo">314</span> }<a name="line.314"></a>
-<span class="sourceLineNo">315</span> if (src.length > srcPos + 3 && src[srcPos + 3]) {<a name="line.315"></a>
-<span class="sourceLineNo">316</span> if (src.length > srcPos + 2 && src[srcPos + 2]) {<a name="line.316"></a>
-<span class="sourceLineNo">317</span> if (src.length > srcPos + 1 && src[srcPos + 1]) {<a name="line.317"></a>
-<span class="sourceLineNo">318</span> return src[srcPos] ? 'f' : 'e';<a name="line.318"></a>
-<span class="sourceLineNo">319</span> }<a name="line.319"></a>
-<span class="sourceLineNo">320</span> return src[srcPos] ? 'd' : 'c';<a name="line.320"></a>
-<span class="sourceLineNo">321</span> }<a name="line.321"></a>
-<span class="sourceLineNo">322</span> if (src.length > srcPos + 1 && src[srcPos + 1]) {<a name="line.322"></a>
-<span class="sourceLineNo">323</span> return src[srcPos] ? 'b' : 'a';<a name="line.323"></a>
-<span class="sourceLineNo">324</span> }<a name="line.324"></a>
-<span class="sourceLineNo">325</span> return src[srcPos] ? '9' : '8';<a name="line.325"></a>
-<span class="sourceLineNo">326</span> }<a name="line.326"></a>
-<span class="sourceLineNo">327</span> if (src.length > srcPos + 2 && src[srcPos + 2]) {<a name="line.327"></a>
-<span class="sourceLineNo">328</span> if (src.length > srcPos + 1 && src[srcPos + 1]) {<a name="line.328"></a>
-<span class="sourceLineNo">329</span> return src[srcPos] ? '7' : '6';<a name="line.329"></a>
-<span class="sourceLineNo">330</span> }<a name="line.330"></a>
-<span class="sourceLineNo">331</span> return src[srcPos] ? '5' : '4';<a name="line.331"></a>
-<span class="sourceLineNo">332</span> }<a name="line.332"></a>
-<span class="sourceLineNo">333</span> if (src.length > srcPos + 1 && src[srcPos + 1]) {<a name="line.333"></a>
-<span class="sourceLineNo">334</span> return src[srcPos] ? '3' : '2';<a name="line.334"></a>
-<span class="sourceLineNo">335</span> }<a name="line.335"></a>
-<span class="sourceLineNo">336</span> return src[srcPos] ? '1' : '0';<a name="line.336"></a>
-<span class="sourceLineNo">337</span> }<a name="line.337"></a>
-<span class="sourceLineNo">338</span><a name="line.338"></a>
-<span class="sourceLineNo">339</span> /**<a name="line.339"></a>
-<span class="sourceLineNo">340</span> * <p><a name="line.340"></a>
-<span class="sourceLineNo">341</span> * Converts binary (represented as boolean array) to a hexadecimal digit using the Msb0 bit<a name="line.341"></a>
-<span class="sourceLineNo">342</span> * ordering.<a name="line.342"></a>
-<span class="sourceLineNo">343</span> * </p><a name="line.343"></a>
-<span class="sourceLineNo">344</span> * <p><a name="line.344"></a>
-<span class="sourceLineNo">345</span> * (1, 0, 0, 0) is converted as follow: '8'<a name="line.345"></a>
-<span class="sourceLineNo">346</span> * </p><a name="line.346"></a>
-<span class="sourceLineNo">347</span> *<a name="line.347"></a>
-<span class="sourceLineNo">348</span> * @param src the binary to convert<a name="line.348"></a>
-<span class="sourceLineNo">349</span> * @return a hexadecimal digit representing the selected bits<a name="line.349"></a>
-<span class="sourceLineNo">350</span> * @throws IllegalArgumentException if {@code src} is empty, {@code src.length < 4} or<a name="line.350"></a>
-<span class="sourceLineNo">351</span> * {@code src.length > 8}<a name="line.351"></a>
-<span class="sourceLineNo">352</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.352"></a>
-<span class="sourceLineNo">353</span> */<a name="line.353"></a>
-<span class="sourceLineNo">354</span> public static char binaryToHexDigitMsb0_4bits(final boolean[] src) {<a name="line.354"></a>
-<span class="sourceLineNo">355</span> return binaryToHexDigitMsb0_4bits(src, 0);<a name="line.355"></a>
-<span class="sourceLineNo">356</span> }<a name="line.356"></a>
-<span class="sourceLineNo">357</span><a name="line.357"></a>
-<span class="sourceLineNo">358</span> /**<a name="line.358"></a>
-<span class="sourceLineNo">359</span> * <p><a name="line.359"></a>
-<span class="sourceLineNo">360</span> * Converts binary (represented as boolean array) to a hexadecimal digit using the Msb0 bit<a name="line.360"></a>
-<span class="sourceLineNo">361</span> * ordering.<a name="line.361"></a>
-<span class="sourceLineNo">362</span> * </p><a name="line.362"></a>
-<span class="sourceLineNo">363</span> * <p><a name="line.363"></a>
-<span class="sourceLineNo">364</span> * (1, 0, 0, 0) is converted as follow: '8' (1,0,0,1,1,0,1,0) with srcPos = 3 is converted<a name="line.364"></a>
-<span class="sourceLineNo">365</span> * to 'D'<a name="line.365"></a>
-<span class="sourceLineNo">366</span> * </p><a name="line.366"></a>
-<span class="sourceLineNo">367</span> *<a name="line.367"></a>
-<span class="sourceLineNo">368</span> * @param src the binary to convert<a name="line.368"></a>
-<span class="sourceLineNo">369</span> * @param srcPos the position of the lsb to start the conversion<a name="line.369"></a>
-<span class="sourceLineNo">370</span> * @return a hexadecimal digit representing the selected bits<a name="line.370"></a>
-<span class="sourceLineNo">371</span> * @throws IllegalArgumentException if {@code src} is empty, {@code src.length > 8} or<a name="line.371"></a>
-<span class="sourceLineNo">372</span> * {@code src.length - srcPos < 4}<a name="line.372"></a>
-<span class="sourceLineNo">373</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.373"></a>
-<span class="sourceLineNo">374</span> */<a name="line.374"></a>
-<span class="sourceLineNo">375</span> public static char binaryToHexDigitMsb0_4bits(final boolean[] src, final int srcPos) {<a name="line.375"></a>
-<span class="sourceLineNo">376</span> if (src.length > 8) {<a name="line.376"></a>
-<span class="sourceLineNo">377</span> throw new IllegalArgumentException("src.length>8: src.length=" + src.length);<a name="line.377"></a>
-<span class="sourceLineNo">378</span> }<a name="line.378"></a>
-<span class="sourceLineNo">379</span> if (src.length - srcPos < 4) {<a name="line.379"></a>
-<span class="sourceLineNo">380</span> throw new IllegalArgumentException("src.length-srcPos<4: src.length=" + src.length + ", srcPos=" + srcPos);<a name="line.380"></a>
-<span class="sourceLineNo">381</span> }<a name="line.381"></a>
-<span class="sourceLineNo">382</span> if (src[srcPos + 3]) {<a name="line.382"></a>
-<span class="sourceLineNo">383</span> if (src[srcPos + 2]) {<a name="line.383"></a>
-<span class="sourceLineNo">384</span> if (src[srcPos + 1]) {<a name="line.384"></a>
-<span class="sourceLineNo">385</span> return src[srcPos] ? 'f' : '7';<a name="line.385"></a>
-<span class="sourceLineNo">386</span> }<a name="line.386"></a>
-<span class="sourceLineNo">387</span> return src[srcPos] ? 'b' : '3';<a name="line.387"></a>
-<span class="sourceLineNo">388</span> }<a name="line.388"></a>
-<span class="sourceLineNo">389</span> if (src[srcPos + 1]) {<a name="line.389"></a>
-<span class="sourceLineNo">390</span> return src[srcPos] ? 'd' : '5';<a name="line.390"></a>
-<span class="sourceLineNo">391</span> }<a name="line.391"></a>
-<span class="sourceLineNo">392</span> return src[srcPos] ? '9' : '1';<a name="line.392"></a>
-<span class="sourceLineNo">393</span> }<a name="line.393"></a>
-<span class="sourceLineNo">394</span> if (src[srcPos + 2]) {<a name="line.394"></a>
-<span class="sourceLineNo">395</span> if (src[srcPos + 1]) {<a name="line.395"></a>
-<span class="sourceLineNo">396</span> return src[srcPos] ? 'e' : '6';<a name="line.396"></a>
-<span class="sourceLineNo">397</span> }<a name="line.397"></a>
-<span class="sourceLineNo">398</span> return src[srcPos] ? 'a' : '2';<a name="line.398"></a>
-<span class="sourceLineNo">399</span> }<a name="line.399"></a>
-<span class="sourceLineNo">400</span> if (src[srcPos + 1]) {<a name="line.400"></a>
-<span class="sourceLineNo">401</span> return src[srcPos] ? 'c' : '4';<a name="line.401"></a>
-<span class="sourceLineNo">402</span> }<a name="line.402"></a>
-<span class="sourceLineNo">403</span> return src[srcPos] ? '8' : '0';<a name="line.403"></a>
-<span class="sourceLineNo">404</span> }<a name="line.404"></a>
-<span class="sourceLineNo">405</span><a name="line.405"></a>
-<span class="sourceLineNo">406</span> /**<a name="line.406"></a>
-<span class="sourceLineNo">407</span> * <p><a name="line.407"></a>
-<span class="sourceLineNo">408</span> * Converts the first 4 bits of a binary (represented as boolean array) in big endian Msb0<a name="line.408"></a>
-<span class="sourceLineNo">409</span> * bit ordering to a hexadecimal digit.<a name="line.409"></a>
-<span class="sourceLineNo">410</span> * </p><a name="line.410"></a>
-<span class="sourceLineNo">411</span> * <p><a name="line.411"></a>
-<span class="sourceLineNo">412</span> * (1, 0, 0, 0) is converted as follow: '8' (1,0,0,0,0,0,0,0, 0,0,0,0,0,1,0,0) is converted<a name="line.412"></a>
-<span class="sourceLineNo">413</span> * to '4'<a name="line.413"></a>
-<span class="sourceLineNo">414</span> * </p><a name="line.414"></a>
-<span class="sourceLineNo">415</span> *<a name="line.415"></a>
-<span class="sourceLineNo">416</span> * @param src the binary to convert<a name="line.416"></a>
-<span class="sourceLineNo">417</span> * @return a hexadecimal digit representing the selected bits<a name="line.417"></a>
-<span class="sourceLineNo">418</span> * @throws IllegalArgumentException if {@code src} is empty<a name="line.418"></a>
-<span class="sourceLineNo">419</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.419"></a>
-<span class="sourceLineNo">420</span> */<a name="line.420"></a>
-<span class="sourceLineNo">421</span> public static char binaryBeMsb0ToHexDigit(final boolean[] src) {<a name="line.421"></a>
-<span class="sourceLineNo">422</span> return binaryBeMsb0ToHexDigit(src, 0);<a name="line.422"></a>
-<span class="sourceLineNo">423</span> }<a name="line.423"></a>
-<span class="sourceLineNo">424</span><a name="line.424"></a>
-<span class="sourceLineNo">425</span> /**<a name="line.425"></a>
-<span class="sourceLineNo">426</span> * <p><a name="line.426"></a>
-<span class="sourceLineNo">427</span> * Converts a binary (represented as boolean array) in big endian Msb0 bit ordering to a<a name="line.427"></a>
-<span class="sourceLineNo">428</span> * hexadecimal digit.<a name="line.428"></a>
-<span class="sourceLineNo">429</span> * </p><a name="line.429"></a>
-<span class="sourceLineNo">430</span> * <p><a name="line.430"></a>
-<span class="sourceLineNo">431</span> * (1, 0, 0, 0) with srcPos = 0 is converted as follow: '8' (1,0,0,0,0,0,0,0,<a name="line.431"></a>
-<span class="sourceLineNo">432</span> * 0,0,0,1,0,1,0,0) with srcPos = 2 is converted to '5'<a name="line.432"></a>
-<span class="sourceLineNo">433</span> * </p><a name="line.433"></a>
-<span class="sourceLineNo">434</span> *<a name="line.434"></a>
-<span class="sourceLineNo">435</span> * @param src the binary to convert<a name="line.435"></a>
-<span class="sourceLineNo">436</span> * @param srcPos the position of the lsb to start the conversion<a name="line.436"></a>
-<span class="sourceLineNo">437</span> * @return a hexadecimal digit representing the selected bits<a name="line.437"></a>
-<span class="sourceLineNo">438</span> * @throws IllegalArgumentException if {@code src} is empty<a name="line.438"></a>
-<span class="sourceLineNo">439</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.439"></a>
-<span class="sourceLineNo">440</span> */<a name="line.440"></a>
-<span class="sourceLineNo">441</span> public static char binaryBeMsb0ToHexDigit(boolean[] src, int srcPos) {<a name="line.441"></a>
-<span class="sourceLineNo">442</span> if (src.length == 0) {<a name="line.442"></a>
-<span class="sourceLineNo">443</span> throw new IllegalArgumentException("Cannot convert an empty array.");<a name="line.443"></a>
-<span class="sourceLineNo">444</span> }<a name="line.444"></a>
-<span class="sourceLineNo">445</span> final int beSrcPos = src.length - 1 - srcPos;<a name="line.445"></a>
-<span class="sourceLineNo">446</span> final int srcLen = Math.min(4, beSrcPos + 1);<a name="line.446"></a>
-<span class="sourceLineNo">447</span> final boolean[] paddedSrc = new boolean[4];<a name="line.447"></a>
-<span class="sourceLineNo">448</span> System.arraycopy(src, beSrcPos + 1 - srcLen, paddedSrc, 4 - srcLen, srcLen);<a name="line.448"></a>
-<span class="sourceLineNo">449</span> src = paddedSrc;<a name="line.449"></a>
-<span class="sourceLineNo">450</span> srcPos = 0;<a name="line.450"></a>
-<span class="sourceLineNo">451</span> if (src[srcPos]) {<a name="line.451"></a>
-<span class="sourceLineNo">452</span> if (src.length > srcPos + 1 && src[srcPos + 1]) {<a name="line.452"></a>
-<span class="sourceLineNo">453</span> if (src.length > srcPos + 2 && src[srcPos + 2]) {<a name="line.453"></a>
-<span class="sourceLineNo">454</span> return src.length > srcPos + 3 && src[srcPos + 3] ? 'f' : 'e';<a name="line.454"></a>
-<span class="sourceLineNo">455</span> }<a name="line.455"></a>
-<span class="sourceLineNo">456</span> return src.length > srcPos + 3 && src[srcPos + 3] ? 'd' : 'c';<a name="line.456"></a>
-<span class="sourceLineNo">457</span> }<a name="line.457"></a>
-<span class="sourceLineNo">458</span> if (src.length > srcPos + 2 && src[srcPos + 2]) {<a name="line.458"></a>
-<span class="sourceLineNo">459</span> return src.length > srcPos + 3 && src[srcPos + 3] ? 'b' : 'a';<a name="line.459"></a>
-<span class="sourceLineNo">460</span> }<a name="line.460"></a>
-<span class="sourceLineNo">461</span> return src.length > srcPos + 3 && src[srcPos + 3] ? '9' : '8';<a name="line.461"></a>
-<span class="sourceLineNo">462</span> }<a name="line.462"></a>
-<span class="sourceLineNo">463</span> if (src.length > srcPos + 1 && src[srcPos + 1]) {<a name="line.463"></a>
-<span class="sourceLineNo">464</span> if (src.length > srcPos + 2 && src[srcPos + 2]) {<a name="line.464"></a>
-<span class="sourceLineNo">465</span> return src.length > srcPos + 3 && src[srcPos + 3] ? '7' : '6';<a name="line.465"></a>
-<span class="sourceLineNo">466</span> }<a name="line.466"></a>
-<span class="sourceLineNo">467</span> return src.length > srcPos + 3 && src[srcPos + 3] ? '5' : '4';<a name="line.467"></a>
-<span class="sourceLineNo">468</span> }<a name="line.468"></a>
-<span class="sourceLineNo">469</span> if (src.length > srcPos + 2 && src[srcPos + 2]) {<a name="line.469"></a>
-<span class="sourceLineNo">470</span> return src.length > srcPos + 3 && src[srcPos + 3] ? '3' : '2';<a name="line.470"></a>
-<span class="sourceLineNo">471</span> }<a name="line.471"></a>
-<span class="sourceLineNo">472</span> return src.length > srcPos + 3 && src[srcPos + 3] ? '1' : '0';<a name="line.472"></a>
-<span class="sourceLineNo">473</span> }<a name="line.473"></a>
-<span class="sourceLineNo">474</span><a name="line.474"></a>
-<span class="sourceLineNo">475</span> /**<a name="line.475"></a>
-<span class="sourceLineNo">476</span> * <p><a name="line.476"></a>
-<span class="sourceLineNo">477</span> * Converts the 4 lsb of an int to a hexadecimal digit.<a name="line.477"></a>
-<span class="sourceLineNo">478</span> * </p><a name="line.478"></a>
-<span class="sourceLineNo">479</span> * <p><a name="line.479"></a>
-<span class="sourceLineNo">480</span> * 0 returns '0'<a name="line.480"></a>
-<span class="sourceLineNo">481</span> * </p><a name="line.481"></a>
-<span class="sourceLineNo">482</span> * <p><a name="line.482"></a>
-<span class="sourceLineNo">483</span> * 1 returns '1'<a name="line.483"></a>
-<span class="sourceLineNo">484</span> * </p><a name="line.484"></a>
-<span class="sourceLineNo">485</span> * <p><a name="line.485"></a>
-<span class="sourceLineNo">486</span> * 10 returns 'A' and so on...<a name="line.486"></a>
-<span class="sourceLineNo">487</span> * </p><a name="line.487"></a>
-<span class="sourceLineNo">488</span> *<a name="line.488"></a>
-<span class="sourceLineNo">489</span> * @param nibble the 4 bits to convert<a name="line.489"></a>
-<span class="sourceLineNo">490</span> * @return a hexadecimal digit representing the 4 lsb of {@code nibble}<a name="line.490"></a>
-<span class="sourceLineNo">491</span> * @throws IllegalArgumentException if {@code nibble < 0} or {@code nibble > 15}<a name="line.491"></a>
-<span class="sourceLineNo">492</span> */<a name="line.492"></a>
-<span class="sourceLineNo">493</span> public static char intToHexDigit(final int nibble) {<a name="line.493"></a>
-<span class="sourceLineNo">494</span> final char c = Character.forDigit(nibble, 16);<a name="line.494"></a>
-<span class="sourceLineNo">495</span> if (c == Character.MIN_VALUE) {<a name="line.495"></a>
-<span class="sourceLineNo">496</span> throw new IllegalArgumentException("nibble value not between 0 and 15: " + nibble);<a name="line.496"></a>
-<span class="sourceLineNo">497</span> }<a name="line.497"></a>
-<span class="sourceLineNo">498</span> return c;<a name="line.498"></a>
-<span class="sourceLineNo">499</span> }<a name="line.499"></a>
-<span class="sourceLineNo">500</span><a name="line.500"></a>
-<span class="sourceLineNo">501</span> /**<a name="line.501"></a>
-<span class="sourceLineNo">502</span> * <p><a name="line.502"></a>
-<span class="sourceLineNo">503</span> * Converts the 4 lsb of an int to a hexadecimal digit encoded using the Msb0 bit ordering.<a name="line.503"></a>
-<span class="sourceLineNo">504</span> * </p><a name="line.504"></a>
-<span class="sourceLineNo">505</span> * <p><a name="line.505"></a>
-<span class="sourceLineNo">506</span> * 0 returns '0'<a name="line.506"></a>
-<span class="sourceLineNo">507</span> * </p><a name="line.507"></a>
-<span class="sourceLineNo">508</span> * <p><a name="line.508"></a>
-<span class="sourceLineNo">509</span> * 1 returns '8'<a name="line.509"></a>
-<span class="sourceLineNo">510</span> * </p><a name="line.510"></a>
-<span class="sourceLineNo">511</span> * <p><a name="line.511"></a>
-<span class="sourceLineNo">512</span> * 10 returns '5' and so on...<a name="line.512"></a>
-<span class="sourceLineNo">513</span> * </p><a name="line.513"></a>
-<span class="sourceLineNo">514</span> *<a name="line.514"></a>
-<span class="sourceLineNo">515</span> * @param nibble the 4 bits to convert<a name="line.515"></a>
-<span class="sourceLineNo">516</span> * @return a hexadecimal digit representing the 4 lsb of {@code nibble}<a name="line.516"></a>
-<span class="sourceLineNo">517</span> * @throws IllegalArgumentException if {@code nibble < 0} or {@code nibble > 15}<a name="line.517"></a>
-<span class="sourceLineNo">518</span> */<a name="line.518"></a>
-<span class="sourceLineNo">519</span> public static char intToHexDigitMsb0(final int nibble) {<a name="line.519"></a>
-<span class="sourceLineNo">520</span> switch (nibble) {<a name="line.520"></a>
-<span class="sourceLineNo">521</span> case 0x0:<a name="line.521"></a>
-<span class="sourceLineNo">522</span> return '0';<a name="line.522"></a>
-<span class="sourceLineNo">523</span> case 0x1:<a name="line.523"></a>
-<span class="sourceLineNo">524</span> return '8';<a name="line.524"></a>
-<span class="sourceLineNo">525</span> case 0x2:<a name="line.525"></a>
-<span class="sourceLineNo">526</span> return '4';<a name="line.526"></a>
-<span class="sourceLineNo">527</span> case 0x3:<a name="line.527"></a>
-<span class="sourceLineNo">528</span> return 'c';<a name="line.528"></a>
-<span class="sourceLineNo">529</span> case 0x4:<a name="line.529"></a>
-<span class="sourceLineNo">530</span> return '2';<a name="line.530"></a>
-<span class="sourceLineNo">531</span> case 0x5:<a name="line.531"></a>
-<span class="sourceLineNo">532</span> return 'a';<a name="line.532"></a>
-<span class="sourceLineNo">533</span> case 0x6:<a name="line.533"></a>
-<span class="sourceLineNo">534</span> return '6';<a name="line.534"></a>
-<span class="sourceLineNo">535</span> case 0x7:<a name="line.535"></a>
-<span class="sourceLineNo">536</span> return 'e';<a name="line.536"></a>
-<span class="sourceLineNo">537</span> case 0x8:<a name="line.537"></a>
-<span class="sourceLineNo">538</span> return '1';<a name="line.538"></a>
-<span class="sourceLineNo">539</span> case 0x9:<a name="line.539"></a>
-<span class="sourceLineNo">540</span> return '9';<a name="line.540"></a>
-<span class="sourceLineNo">541</span> case 0xA:<a name="line.541"></a>
-<span class="sourceLineNo">542</span> return '5';<a name="line.542"></a>
-<span class="sourceLineNo">543</span> case 0xB:<a name="line.543"></a>
-<span class="sourceLineNo">544</span> return 'd';<a name="line.544"></a>
-<span class="sourceLineNo">545</span> case 0xC:<a name="line.545"></a>
-<span class="sourceLineNo">546</span> return '3';<a name="line.546"></a>
-<span class="sourceLineNo">547</span> case 0xD:<a name="line.547"></a>
-<span class="sourceLineNo">548</span> return 'b';<a name="line.548"></a>
-<span class="sourceLineNo">549</span> case 0xE:<a name="line.549"></a>
-<span class="sourceLineNo">550</span> return '7';<a name="line.550"></a>
-<span class="sourceLineNo">551</span> case 0xF:<a name="line.551"></a>
-<span class="sourceLineNo">552</span> return 'f';<a name="line.552"></a>
-<span class="sourceLineNo">553</span> default:<a name="line.553"></a>
-<span class="sourceLineNo">554</span> throw new IllegalArgumentException("nibble value not between 0 and 15: " + nibble);<a name="line.554"></a>
-<span class="sourceLineNo">555</span> }<a name="line.555"></a>
-<span class="sourceLineNo">556</span> }<a name="line.556"></a>
-<span class="sourceLineNo">557</span><a name="line.557"></a>
-<span class="sourceLineNo">558</span> /**<a name="line.558"></a>
-<span class="sourceLineNo">559</span> * <p><a name="line.559"></a>
-<span class="sourceLineNo">560</span> * Converts an array of int into a long using the default (little endian, Lsb0) byte and bit<a name="line.560"></a>
-<span class="sourceLineNo">561</span> * ordering.<a name="line.561"></a>
-<span class="sourceLineNo">562</span> * </p><a name="line.562"></a>
-<span class="sourceLineNo">563</span> *<a name="line.563"></a>
-<span class="sourceLineNo">564</span> * @param src the int array to convert<a name="line.564"></a>
-<span class="sourceLineNo">565</span> * @param srcPos the position in {@code src}, in int unit, from where to start the<a name="line.565"></a>
-<span class="sourceLineNo">566</span> * conversion<a name="line.566"></a>
-<span class="sourceLineNo">567</span> * @param dstInit initial value of the destination long<a name="line.567"></a>
-<span class="sourceLineNo">568</span> * @param dstPos the position of the lsb, in bits, in the result long<a name="line.568"></a>
-<span class="sourceLineNo">569</span> * @param nInts the number of ints to convert<a name="line.569"></a>
-<span class="sourceLineNo">570</span> * @return a long containing the selected bits<a name="line.570"></a>
-<span class="sourceLineNo">571</span> * @throws IllegalArgumentException if {@code (nInts-1)*32+dstPos >= 64}<a name="line.571"></a>
-<span class="sourceLineNo">572</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.572"></a>
-<span class="sourceLineNo">573</span> * @throws ArrayIndexOutOfBoundsException if {@code srcPos + nInts > src.length}<a name="line.573"></a>
-<span class="sourceLineNo">574</span> */<a name="line.574"></a>
-<span class="sourceLineNo">575</span> public static long intArrayToLong(final int[] src, final int srcPos, final long dstInit, final int dstPos,<a name="line.575"></a>
-<span class="sourceLineNo">576</span> final int nInts) {<a name="line.576"></a>
-<span class="sourceLineNo">577</span> if (src.length == 0 && srcPos == 0 || 0 == nInts) {<a name="line.577"></a>
-<span class="sourceLineNo">578</span> return dstInit;<a name="line.578"></a>
-<span class="sourceLineNo">579</span> }<a name="line.579"></a>
-<span class="sourceLineNo">580</span> if ((nInts - 1) * 32 + dstPos >= 64) {<a name="line.580"></a>
-<span class="sourceLineNo">581</span> throw new IllegalArgumentException("(nInts-1)*32+dstPos is greater or equal to than 64");<a name="line.581"></a>
-<span class="sourceLineNo">582</span> }<a name="line.582"></a>
-<span class="sourceLineNo">583</span> long out = dstInit;<a name="line.583"></a>
-<span class="sourceLineNo">584</span> for (int i = 0; i < nInts; i++) {<a name="line.584"></a>
-<span class="sourceLineNo">585</span> final int shift = i * 32 + dstPos;<a name="line.585"></a>
-<span class="sourceLineNo">586</span> final long bits = (0xffffffffL & src[i + srcPos]) << shift;<a name="line.586"></a>
-<span class="sourceLineNo">587</span> final long mask = 0xffffffffL << shift;<a name="line.587"></a>
-<span class="sourceLineNo">588</span> out = (out & ~mask) | bits;<a name="line.588"></a>
-<span class="sourceLineNo">589</span> }<a name="line.589"></a>
-<span class="sourceLineNo">590</span> return out;<a name="line.590"></a>
-<span class="sourceLineNo">591</span> }<a name="line.591"></a>
-<span class="sourceLineNo">592</span><a name="line.592"></a>
-<span class="sourceLineNo">593</span> /**<a name="line.593"></a>
-<span class="sourceLineNo">594</span> * <p><a name="line.594"></a>
-<span class="sourceLineNo">595</span> * Converts an array of short into a long using the default (little endian, Lsb0) byte and<a name="line.595"></a>
-<span class="sourceLineNo">596</span> * bit ordering.<a name="line.596"></a>
-<span class="sourceLineNo">597</span> * </p><a name="line.597"></a>
-<span class="sourceLineNo">598</span> *<a name="line.598"></a>
-<span class="sourceLineNo">599</span> * @param src the short array to convert<a name="line.599"></a>
-<span class="sourceLineNo">600</span> * @param srcPos the position in {@code src}, in short unit, from where to start the<a name="line.600"></a>
-<span class="sourceLineNo">601</span> * conversion<a name="line.601"></a>
-<span class="sourceLineNo">602</span> * @param dstInit initial value of the destination long<a name="line.602"></a>
-<span class="sourceLineNo">603</span> * @param dstPos the position of the lsb, in bits, in the result long<a name="line.603"></a>
-<span class="sourceLineNo">604</span> * @param nShorts the number of shorts to convert<a name="line.604"></a>
-<span class="sourceLineNo">605</span> * @return a long containing the selected bits<a name="line.605"></a>
-<span class="sourceLineNo">606</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.606"></a>
-<span class="sourceLineNo">607</span> * @throws IllegalArgumentException if {@code (nShorts-1)*16+dstPos >= 64}<a name="line.607"></a>
-<span class="sourceLineNo">608</span> * @throws ArrayIndexOutOfBoundsException if {@code srcPos + nShorts > src.length}<a name="line.608"></a>
-<span class="sourceLineNo">609</span> */<a name="line.609"></a>
-<span class="sourceLineNo">610</span> public static long shortArrayToLong(final short[] src, final int srcPos, final long dstInit, final int dstPos,<a name="line.610"></a>
-<span class="sourceLineNo">611</span> final int nShorts) {<a name="line.611"></a>
-<span class="sourceLineNo">612</span> if (src.length == 0 && srcPos == 0 || 0 == nShorts) {<a name="line.612"></a>
-<span class="sourceLineNo">613</span> return dstInit;<a name="line.613"></a>
-<span class="sourceLineNo">614</span> }<a name="line.614"></a>
-<span class="sourceLineNo">615</span> if ((nShorts - 1) * 16 + dstPos >= 64) {<a name="line.615"></a>
-<span class="sourceLineNo">616</span> throw new IllegalArgumentException("(nShorts-1)*16+dstPos is greater or equal to than 64");<a name="line.616"></a>
-<span class="sourceLineNo">617</span> }<a name="line.617"></a>
-<span class="sourceLineNo">618</span> long out = dstInit;<a name="line.618"></a>
-<span class="sourceLineNo">619</span> for (int i = 0; i < nShorts; i++) {<a name="line.619"></a>
-<span class="sourceLineNo">620</span> final int shift = i * 16 + dstPos;<a name="line.620"></a>
-<span class="sourceLineNo">621</span> final long bits = (0xffffL & src[i + srcPos]) << shift;<a name="line.621"></a>
-<span class="sourceLineNo">622</span> final long mask = 0xffffL << shift;<a name="line.622"></a>
-<span class="sourceLineNo">623</span> out = (out & ~mask) | bits;<a name="line.623"></a>
-<span class="sourceLineNo">624</span> }<a name="line.624"></a>
-<span class="sourceLineNo">625</span> return out;<a name="line.625"></a>
-<span class="sourceLineNo">626</span> }<a name="line.626"></a>
-<span class="sourceLineNo">627</span><a name="line.627"></a>
-<span class="sourceLineNo">628</span> /**<a name="line.628"></a>
-<span class="sourceLineNo">629</span> * <p><a name="line.629"></a>
-<span class="sourceLineNo">630</span> * Converts an array of short into an int using the default (little endian, Lsb0) byte and<a name="line.630"></a>
-<span class="sourceLineNo">631</span> * bit ordering.<a name="line.631"></a>
-<span class="sourceLineNo">632</span> * </p><a name="line.632"></a>
-<span class="sourceLineNo">633</span> *<a name="line.633"></a>
-<span class="sourceLineNo">634</span> * @param src the short array to convert<a name="line.634"></a>
-<span class="sourceLineNo">635</span> * @param srcPos the position in {@code src}, in short unit, from where to start the<a name="line.635"></a>
-<span class="sourceLineNo">636</span> * conversion<a name="line.636"></a>
-<span class="sourceLineNo">637</span> * @param dstInit initial value of the destination int<a name="line.637"></a>
-<span class="sourceLineNo">638</span> * @param dstPos the position of the lsb, in bits, in the result int<a name="line.638"></a>
-<span class="sourceLineNo">639</span> * @param nShorts the number of shorts to convert<a name="line.639"></a>
-<span class="sourceLineNo">640</span> * @return an int containing the selected bits<a name="line.640"></a>
-<span class="sourceLineNo">641</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.641"></a>
-<span class="sourceLineNo">642</span> * @throws IllegalArgumentException if {@code (nShorts-1)*16+dstPos >= 32}<a name="line.642"></a>
-<span class="sourceLineNo">643</span> * @throws ArrayIndexOutOfBoundsException if {@code srcPos + nShorts > src.length}<a name="line.643"></a>
-<span class="sourceLineNo">644</span> */<a name="line.644"></a>
-<span class="sourceLineNo">645</span> public static int shortArrayToInt(final short[] src, final int srcPos, final int dstInit, final int dstPos,<a name="line.645"></a>
-<span class="sourceLineNo">646</span> final int nShorts) {<a name="line.646"></a>
-<span class="sourceLineNo">647</span> if (src.length == 0 && srcPos == 0 || 0 == nShorts) {<a name="line.647"></a>
-<span class="sourceLineNo">648</span> return dstInit;<a name="line.648"></a>
-<span class="sourceLineNo">649</span> }<a name="line.649"></a>
-<span class="sourceLineNo">650</span> if ((nShorts - 1) * 16 + dstPos >= 32) {<a name="line.650"></a>
-<span class="sourceLineNo">651</span> throw new IllegalArgumentException("(nShorts-1)*16+dstPos is greater or equal to than 32");<a name="line.651"></a>
-<span class="sourceLineNo">652</span> }<a name="line.652"></a>
-<span class="sourceLineNo">653</span> int out = dstInit;<a name="line.653"></a>
-<span class="sourceLineNo">654</span> for (int i = 0; i < nShorts; i++) {<a name="line.654"></a>
-<span class="sourceLineNo">655</span> final int shift = i * 16 + dstPos;<a name="line.655"></a>
-<span class="sourceLineNo">656</span> final int bits = (0xffff & src[i + srcPos]) << shift;<a name="line.656"></a>
-<span class="sourceLineNo">657</span> final int mask = 0xffff << shift;<a name="line.657"></a>
-<span class="sourceLineNo">658</span> out = (out & ~mask) | bits;<a name="line.658"></a>
-<span class="sourceLineNo">659</span> }<a name="line.659"></a>
-<span class="sourceLineNo">660</span> return out;<a name="line.660"></a>
-<span class="sourceLineNo">661</span> }<a name="line.661"></a>
-<span class="sourceLineNo">662</span><a name="line.662"></a>
-<span class="sourceLineNo">663</span> /**<a name="line.663"></a>
-<span class="sourceLineNo">664</span> * <p><a name="line.664"></a>
-<span class="sourceLineNo">665</span> * Converts an array of byte into a long using the default (little endian, Lsb0) byte and<a name="line.665"></a>
-<span class="sourceLineNo">666</span> * bit ordering.<a name="line.666"></a>
-<span class="sourceLineNo">667</span> * </p><a name="line.667"></a>
-<span class="sourceLineNo">668</span> *<a name="line.668"></a>
-<span class="sourceLineNo">669</span> * @param src the byte array to convert<a name="line.669"></a>
-<span class="sourceLineNo">670</span> * @param srcPos the position in {@code src}, in byte unit, from where to start the<a name="line.670"></a>
-<span class="sourceLineNo">671</span> * conversion<a name="line.671"></a>
-<span class="sourceLineNo">672</span> * @param dstInit initial value of the destination long<a name="line.672"></a>
-<span class="sourceLineNo">673</span> * @param dstPos the position of the lsb, in bits, in the result long<a name="line.673"></a>
-<span class="sourceLineNo">674</span> * @param nBytes the number of bytes to convert<a name="line.674"></a>
-<span class="sourceLineNo">675</span> * @return a long containing the selected bits<a name="line.675"></a>
-<span class="sourceLineNo">676</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.676"></a>
-<span class="sourceLineNo">677</span> * @throws IllegalArgumentException if {@code (nBytes-1)*8+dstPos >= 64}<a name="line.677"></a>
-<span class="sourceLineNo">678</span> * @throws ArrayIndexOutOfBoundsException if {@code srcPos + nBytes > src.length}<a name="line.678"></a>
-<span class="sourceLineNo">679</span> */<a name="line.679"></a>
-<span class="sourceLineNo">680</span> public static long byteArrayToLong(final byte[] src, final int srcPos, final long dstInit, final int dstPos,<a name="line.680"></a>
-<span class="sourceLineNo">681</span> final int nBytes) {<a name="line.681"></a>
-<span class="sourceLineNo">682</span> if (src.length == 0 && srcPos == 0 || 0 == nBytes) {<a name="line.682"></a>
-<span class="sourceLineNo">683</span> return dstInit;<a name="line.683"></a>
-<span class="sourceLineNo">684</span> }<a name="line.684"></a>
-<span class="sourceLineNo">685</span> if ((nBytes - 1) * 8 + dstPos >= 64) {<a name="line.685"></a>
-<span class="sourceLineNo">686</span> throw new IllegalArgumentException("(nBytes-1)*8+dstPos is greater or equal to than 64");<a name="line.686"></a>
-<span class="sourceLineNo">687</span> }<a name="line.687"></a>
-<span class="sourceLineNo">688</span> long out = dstInit;<a name="line.688"></a>
-<span class="sourceLineNo">689</span> for (int i = 0; i < nBytes; i++) {<a name="line.689"></a>
-<span class="sourceLineNo">690</span> final int shift = i * 8 + dstPos;<a name="line.690"></a>
-<span class="sourceLineNo">691</span> final long bits = (0xffL & src[i + srcPos]) << shift;<a name="line.691"></a>
-<span class="sourceLineNo">692</span> final long mask = 0xffL << shift;<a name="line.692"></a>
-<span class="sourceLineNo">693</span> out = (out & ~mask) | bits;<a name="line.693"></a>
-<span class="sourceLineNo">694</span> }<a name="line.694"></a>
-<span class="sourceLineNo">695</span> return out;<a name="line.695"></a>
-<span class="sourceLineNo">696</span> }<a name="line.696"></a>
-<span class="sourceLineNo">697</span><a name="line.697"></a>
-<span class="sourceLineNo">698</span> /**<a name="line.698"></a>
-<span class="sourceLineNo">699</span> * <p><a name="line.699"></a>
-<span class="sourceLineNo">700</span> * Converts an array of byte into an int using the default (little endian, Lsb0) byte and bit<a name="line.700"></a>
-<span class="sourceLineNo">701</span> * ordering.<a name="line.701"></a>
-<span class="sourceLineNo">702</span> * </p><a name="line.702"></a>
-<span class="sourceLineNo">703</span> *<a name="line.703"></a>
-<span class="sourceLineNo">704</span> * @param src the byte array to convert<a name="line.704"></a>
-<span class="sourceLineNo">705</span> * @param srcPos the position in {@code src}, in byte unit, from where to start the<a name="line.705"></a>
-<span class="sourceLineNo">706</span> * conversion<a name="line.706"></a>
-<span class="sourceLineNo">707</span> * @param dstInit initial value of the destination int<a name="line.707"></a>
-<span class="sourceLineNo">708</span> * @param dstPos the position of the lsb, in bits, in the result int<a name="line.708"></a>
-<span class="sourceLineNo">709</span> * @param nBytes the number of bytes to convert<a name="line.709"></a>
-<span class="sourceLineNo">710</span> * @return an int containing the selected bits<a name="line.710"></a>
-<span class="sourceLineNo">711</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.711"></a>
-<span class="sourceLineNo">712</span> * @throws IllegalArgumentException if {@code (nBytes-1)*8+dstPos >= 32}<a name="line.712"></a>
-<span class="sourceLineNo">713</span> * @throws ArrayIndexOutOfBoundsException if {@code srcPos + nBytes > src.length}<a name="line.713"></a>
-<span class="sourceLineNo">714</span> */<a name="line.714"></a>
-<span class="sourceLineNo">715</span> public static int byteArrayToInt(final byte[] src, final int srcPos, final int dstInit, final int dstPos,<a name="line.715"></a>
-<span class="sourceLineNo">716</span> final int nBytes) {<a name="line.716"></a>
-<span class="sourceLineNo">717</span> if (src.length == 0 && srcPos == 0 || 0 == nBytes) {<a name="line.717"></a>
-<span class="sourceLineNo">718</span> return dstInit;<a name="line.718"></a>
-<span class="sourceLineNo">719</span> }<a name="line.719"></a>
-<span class="sourceLineNo">720</span> if ((nBytes - 1) * 8 + dstPos >= 32) {<a name="line.720"></a>
-<span class="sourceLineNo">721</span> throw new IllegalArgumentException("(nBytes-1)*8+dstPos is greater or equal to than 32");<a name="line.721"></a>
-<span class="sourceLineNo">722</span> }<a name="line.722"></a>
-<span class="sourceLineNo">723</span> int out = dstInit;<a name="line.723"></a>
-<span class="sourceLineNo">724</span> for (int i = 0; i < nBytes; i++) {<a name="line.724"></a>
-<span class="sourceLineNo">725</span> final int shift = i * 8 + dstPos;<a name="line.725"></a>
-<span class="sourceLineNo">726</span> final int bits = (0xff & src[i + srcPos]) << shift;<a name="line.726"></a>
-<span class="sourceLineNo">727</span> final int mask = 0xff << shift;<a name="line.727"></a>
-<span class="sourceLineNo">728</span> out = (out & ~mask) | bits;<a name="line.728"></a>
-<span class="sourceLineNo">729</span> }<a name="line.729"></a>
-<span class="sourceLineNo">730</span> return out;<a name="line.730"></a>
-<span class="sourceLineNo">731</span> }<a name="line.731"></a>
-<span class="sourceLineNo">732</span><a name="line.732"></a>
-<span class="sourceLineNo">733</span> /**<a name="line.733"></a>
-<span class="sourceLineNo">734</span> * <p><a name="line.734"></a>
-<span class="sourceLineNo">735</span> * Converts an array of byte into a short using the default (little endian, Lsb0) byte and<a name="line.735"></a>
-<span class="sourceLineNo">736</span> * bit ordering.<a name="line.736"></a>
-<span class="sourceLineNo">737</span> * </p><a name="line.737"></a>
-<span class="sourceLineNo">738</span> *<a name="line.738"></a>
-<span class="sourceLineNo">739</span> * @param src the byte array to convert<a name="line.739"></a>
-<span class="sourceLineNo">740</span> * @param srcPos the position in {@code src}, in byte unit, from where to start the<a name="line.740"></a>
-<span class="sourceLineNo">741</span> * conversion<a name="line.741"></a>
-<span class="sourceLineNo">742</span> * @param dstInit initial value of the destination short<a name="line.742"></a>
-<span class="sourceLineNo">743</span> * @param dstPos the position of the lsb, in bits, in the result short<a name="line.743"></a>
-<span class="sourceLineNo">744</span> * @param nBytes the number of bytes to convert<a name="line.744"></a>
-<span class="sourceLineNo">745</span> * @return a short containing the selected bits<a name="line.745"></a>
-<span class="sourceLineNo">746</span> * @throws NullPointerException if {@code src} is {@code null}<a name="line.746"></a>
-<span class="sourceLineNo">747</span> * @throws IllegalArgumentException if {@code (nBytes-1)*8+dstPos >= 16}<a name="line.747"></a>
-<span class="sourceLineNo">748</span> * @throws ArrayIndexOutOfBoundsException if {@code srcPos + nBytes > src.length}<a name="line.748"></a>
-<span class="sourceLineNo">749</span> */<a name="line.749"></a>
-<span class="sourceLineNo">750</span> public static short byteArrayToShort(final byte[] src, final int srcPos, final short dstInit, final int dstPos,<a name="line.750"></a>
-<span class="sourceLineNo">751</span> final int nBytes) {<a name="line.751"></a>
-<span class="sourceLineNo">752</span> if (src.length == 0 && srcPos == 0 || 0 == nBytes) {<a name="line.752"></a>
-<span class="sourceLineNo">753</span> return dstInit;<a name="line.753"></a>
-<span class="sourceLineNo">754</span> }<a name="line.754"></a>
-<span class="sourceLineNo">755</span> if ((nBytes - 1) * 8 + dstPos >= 16) {<a name="line.755"></a>
-<span class="sourceLineNo">756</span> throw new IllegalArgumentException("(nBytes-1)*8+dstPos is greater or equal to than 16");<a name="line.756"></a>
-<span class="sourceLineNo">757</span> }<a name="line.757"></a>
-<span class="sourceLineNo">758</span> short out = dstInit;<a name="line.758"></a>
-<span class="sourceLineNo">759</span> for (int i = 0; i < nBytes; i++) {<a name="line.759"></a>
-<span class="sourceLineNo">760</span> final int shift = i * 8 + dstPos;<a name="line.760"></a>
-<span class="sourceLineNo">761</span> final int bits = (0xff & src[i + srcPos]) << shift;<a name="line.761"></a>
-<span class="sourceLineNo">762</span> final int mask = 0xff << shift;<a name="line.762"></a>
-<span class="sourceLineNo">763</span> out = (short) ((out & ~mask) | bits);<a name="line.763"></a>
-<span class="sourceLineNo">764</span> }<a name="line.764"></a>
-<span class="sourceLineNo">765</span> return out;<a name="line.765"></a>
-<span class="sourceLineNo">766</span> }<a name="line.766"></a>
-<span class="sourceLineNo">767</span><a name="line.767"></a>
-<span class="sourceLineNo">768</span> /**<a name="line.768"></a>
-<span class="sourceLineNo">769</span> * <p><a name="line.769"></a>
-<span class="sourceLineNo">770</span> * Converts an array of Char into a long using the default (little endian, Lsb0) byte and<a name="line.770"></a>
-<span class="sourceLineNo">771</span> * bit ordering.<a name="line.771"></a>
-<span class="sourceLineNo">772</span> * </p><a name="line.772"></a>
-<span class="sourceLineNo">773</span> *<a name="line.773"></a>
-<span class="sourceLineNo">774</span> * @param src the hex string to convert<a name="line.774"></a>
-<span class="sourceLineNo">775</span> * @param srcPos the position in {@code src}, in Char unit, from where to start the<a name="line.775"></a>
-<span class="sourceLineNo">776</span> * conversion<a name="line.776"></a>
-<span class="sourceLineNo">777</span> * @param dstInit initial value of the destination long<a name="line.777"></a>
-<span class="sourceLineNo">778</span> * @param dstPos the position of the lsb, in bits, in the result long<a name="line.778"></a>
-<span class="sourceLineNo">779</span> * @param nHex the number of Chars to convert<a name="line.779"></a>
-<span class="sourceLineNo">780</span> * @return a long containing the selected bits<a name="line.780"></a>
-<span class="sourceLineNo">781</span> * @throws IllegalArgumentException if {@code (nHexs-1)*4+dstPos >= 64}<a name="line.781"></a>
-<span class="sourceLineNo">782</span> */<a name="line.782"></a>
-<span class="sourceLineNo">783</span> public static long hexToLong(final String src, final int srcPos, final long dstInit, final int dstPos,<a name="line.783"></a>
-<span class="sourceLineNo">784</span> final int nHex) {<a name="line.784"></a>
-<span class="sourceLineNo">785</span> if (0 == nHex) {<a name="line.785"></a>
-<span class="sourceLineNo">786</span> return dstInit;<a name="line.786"></a>
-<span class="sourceLineNo">787</span> }<a name="line.787"></a>
-<span class="sourceLineNo">788</span> if ((nHex - 1) * 4 + dstPos >= 64) {<a name="line.788"></a>
-<span class="sourceLineNo">789</span> throw new IllegalArgumentException("(nHexs-1)*4+dstPos is greater or equal to than 64");<a name="line.789"></a>
-<span class="sourceLineNo">790</span> }<a name="line.790"></a>
-<span class="sourceLineNo">791</span> long out = dstInit;<a name="line.791"></a>
-<span class="sourceLineNo">792</span> for (int i = 0; i < nHex; i++) {<a name="line.792"></a>
-<span class="sourceLineNo">793</span> final int shift = i * 4 + dstPos;<a name="line.793"></a>
-<span class="sourceLineNo">794</span> final long bits = (0xfL & hexDigitToInt(src.charAt(i + srcPos))) << shift;<a name="line.794"></a>
-<span class="sourceLineNo">795</span> final long mask = 0xfL << shift;<a name="line.795"></a>
-<span class="sourceLineNo">796</span> out = (out & ~mask) | bits;<a name="line.796"></a>
-<span class="sourceLineNo">797</span> }<a name="line.797"></a>
-<span class="sourceLineNo">798</span> return out;<a name="line.798"></a>
-<span class="sourceLineNo">799</span> }<a name="line.799"></a>
-<span class="sourceLineNo">800</span><a name="line.800"></a>
-<span class="sourceLineNo">801</span> /**<a name="line.801"></a>
-<span class="sourceLineNo">802</span> * <p><a name="line.802"></a>
-<span class="sourceLineNo">803</span> * Converts an array of Char into an int using the default (little endian, Lsb0) byte and bit<a name="line.803"></a>
-<span class="sourceLineNo">804</span> * ordering.<a name="line.804"></a>
-<span class="sourceLineNo">805</span> * </p><a name="line.805"></a>
-<span class="sourceLineNo">806</span> *<a name="line.806"></a>
-<span class="sourceLineNo">807</span> * @param src the hex string to convert<a name="line.807"></a>
-<span class="sourceLineNo">808</span> * @param srcPos the position in {@code src}, in Char unit, from where to start the<a name="line.808"></a>
-<span class="sourceLineNo">809</span> * conversion<a name="line.809"></a>
-<span class="sourceLineNo">810</span> * @param dstInit initial value of the destination int<a name="line.810"></a>
-<span class="sourceLineNo">811</span> * @param dstPos the position of the lsb, in bits, in the result int<a name="line.811"></a>
-<span class="sourceLineNo">812</span> * @param nHex the number of Chars to convert<a name="line.812"></a>
-<span class="sourceLineNo">813</span> * @return an int containing the selected bits<a name="line.813"></a>
-<span class="sourceLineNo">814</span> * @throws IllegalArgumentException if {@code (nHexs-1)*4+dstPos >= 32}<a name="line.814"></a>
-<span class="sourceLineNo">815</span> */<a name="line.815"></a>
-<span class="sourceLineNo">816</span> public static int hexToInt(final String src, final int srcPos, final int dstInit, final int dstPos, final int nHex) {<a name="line.816"></a>
-<span class="sourceLineNo">817</span> if (0 == nHex) {<a name="line.817"></a>
-<span class="sourceLineNo">818</span> return dstInit;<a name="line.818"></a>
-<span class="sourceLineNo">819</span> }<a name="line.819"></a>
-<span class="sourceLineNo">820</span> if ((nHex - 1) * 4 + dstPos >= 32) {<a name="line.820"></a>
-<span class="sourceLineNo">821</span> throw new IllegalArgumentException("(nHexs-1)*4+dstPos is greater or equal to than 32");<a name="line.821"></a>
-<span class="sourceLineNo">822</span> }<a name="line.822"></a>
-<span class="sourceLineNo">823</span> int out = dstInit;<a name="line.823"></a>
-<span class="sourceLineNo">824</span> for (int i = 0; i < nHex; i++) {<a name="line.824"></a>
-<span class="sourceLineNo">825</span> final int shift = i * 4 + dstPos;<a name="line.825"></a>
-<span class="sourceLineNo">826</span> final int bits = (0xf & hexDigitToInt(src.charAt(i + srcPos))) << shift;<a name="line.826"></a>
-<span class="sourceLineNo">827</span> final int mask = 0xf << shift;<a name="line.827"></a>
-<span class="sourceLineNo">828</span> out = (out & ~mask) | bits;<a name="line.828"></a>
-<span class="sourceLineNo">829</span> }<a name="line.829"></a>
-<span class="sourceLineNo">830</span> return out;<a name="line.830"></a>
-<span class="sourceLineNo">831</span> }<a name="line.831"></a>
-<span class="sourceLineNo">832</span><a name="line.832"></a>
-<span class="sourceLineNo">833</span> /**<a name="line.833"></a>
-<span class="sourceLineNo">834</span> * <p><a name="line.834"></a>
-<span class="sourceLineNo">835</span> * Converts an array of Char into a short using the default (little endian, Lsb0) byte and<a name="line.835"></a>
-<span class="sourceLineNo">836</span> * bit ordering.<a name="line.836"></a>
-<span class="sourceLineNo">837</span> * </p><a name="line.837"></a>
-<span class="sourceLineNo">838</span> *<a name="line.838"></a>
[... 2229 lines stripped ...]