~ubuntu-branches/ubuntu/trusty/bmagic/trusty

<h1>bmtrans.h</h1><a href="a00096.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 #ifndef BMTRANS__H__INCLUDED__

<a name="l00002"></a>00002 #define BMTRANS__H__INCLUDED__

<a name="l00003"></a>00003

<a name="l00004"></a>00004 /*

<a name="l00006"></a>00006

<a name="l00007"></a>00007 Permission is hereby granted, free of charge, to any person

<a name="l00008"></a>00008 obtaining a copy of this software and associated documentation

<a name="l00009"></a>00009 files (the "Software"), to deal in the Software without restriction,

<a name="l00010"></a>00010 including without limitation the rights to use, copy, modify, merge,

<a name="l00011"></a>00011 publish, distribute, sublicense, and/or sell copies of the Software,

<a name="l00012"></a>00012 and to permit persons to whom the Software is furnished to do so,

<a name="l00013"></a>00013 subject to the following conditions:

<a name="l00014"></a>00014

<a name="l00015"></a>00015 The above copyright notice and this permission notice shall be included

<a name="l00016"></a>00016 in all copies or substantial portions of the Software.

<a name="l00017"></a>00017

<a name="l00018"></a>00018 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,

<a name="l00019"></a>00019 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES

<a name="l00020"></a>00020 OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.

<a name="l00021"></a>00021 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,

<a name="l00022"></a>00022 DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,

<a name="l00023"></a>00023 ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR

<a name="l00024"></a>00024 OTHER DEALINGS IN THE SOFTWARE.

<a name="l00025"></a>00025

<a name="l00026"></a>00026 For more information please visit: http://bmagic.sourceforge.net

<a name="l00027"></a>00027

<a name="l00028"></a>00028 */

<a name="l00029"></a>00029

<a name="l00030"></a>00030 namespace bm

<a name="l00031"></a>00031 {

<a name="l00032"></a>00032

<a name="l00033"></a>00033 /**

<a name="l00034"></a>00034 Mini-matrix for bit transposition purposes

<a name="l00035"></a>00035 @internal

<a name="l00036"></a>00036 */

<a name="l00037"></a>00037 template<typename T, unsigned ROWS, unsigned COLS>

<a name="l00038"></a><a class="code" href="a00083.html">00038</a> struct <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>

<a name="l00039"></a>00039 {

<a name="l00040"></a><a class="code" href="a00083.html#a5261ed0fee487db11632487086788a3c">00040</a> typedef T <a class="code" href="a00083.html#a5261ed0fee487db11632487086788a3c">value_type</a>;

<a name="l00041"></a>00041

<a name="l00042"></a><a class="code" href="a00083.html#ad8fc0d5caf424ea3624ddb56001c1ce1">00042</a> T BM_ALIGN16 value[ROWS][COLS] <a class="code" href="a00083.html#ad8fc0d5caf424ea3624ddb56001c1ce1">BM_ALIGN16ATTR</a>;

<a name="l00043"></a>00043

<a name="l00044"></a><a class="code" href="a00083.html#aa11586df7bfd7ba53e15858e2d28f10b">00044</a> static unsigned <a class="code" href="a00083.html#aa11586df7bfd7ba53e15858e2d28f10b">rows</a>() { return ROWS; }

<a name="l00045"></a><a class="code" href="a00083.html#a0a2c77e2e93fd819773719788be7b6f0">00045</a> static unsigned <a class="code" href="a00083.html#a0a2c77e2e93fd819773719788be7b6f0">cols</a>() { return COLS; }

<a name="l00046"></a>00046

<a name="l00047"></a><a class="code" href="a00083.html#a4c8acc2e96ee64c814b5544036d30d62">00047</a> const T* <a class="code" href="a00083.html#a4c8acc2e96ee64c814b5544036d30d62">row</a>(unsigned row_idx) const { return value[row_idx]; }

<a name="l00048"></a>00048 };

<a name="l00049"></a>00049

<a name="l00050"></a>00050

<a name="l00051"></a>00051 /*!

<a name="l00052"></a>00052 Bit array grabber - template specitialization for various basic types

<a name="l00053"></a>00053 @internal

<a name="l00054"></a>00054 */

<a name="l00055"></a>00055 template<typename T, unsigned BPC>

<a name="l00056"></a><a class="code" href="a00024.html">00056</a> struct <a class="code" href="a00024.html">bit_grabber</a>

<a name="l00057"></a>00057 {

<a name="l00058"></a>00058 static

<a name="l00059"></a><a class="code" href="a00024.html#ae4e83826a695d2cf8dbdc39a789bf456">00059</a> unsigned get(const T*, unsigned)

<a name="l00060"></a>00060 {

<a name="l00061"></a>00061 <a class="code" href="a00089.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0); return 0;

<a name="l00062"></a>00062 }

<a name="l00063"></a>00063 };

<h1>bmserial.h</h1><a href="a00096.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 #ifndef BMSERIAL__H__INCLUDED__

<a name="l00002"></a>00002 #define BMSERIAL__H__INCLUDED__

<a name="l00003"></a>00003 /*

<a name="l00005"></a>00005

<a name="l00006"></a>00006 Permission is hereby granted, free of charge, to any person

<a name="l00007"></a>00007 obtaining a copy of this software and associated documentation

<a name="l00008"></a>00008 files (the "Software"), to deal in the Software without restriction,

<a name="l00009"></a>00009 including without limitation the rights to use, copy, modify, merge,

<a name="l00010"></a>00010 publish, distribute, sublicense, and/or sell copies of the Software,

<a name="l00011"></a>00011 and to permit persons to whom the Software is furnished to do so,

<a name="l00012"></a>00012 subject to the following conditions:

<a name="l00013"></a>00013

<a name="l00014"></a>00014 The above copyright notice and this permission notice shall be included

<a name="l00015"></a>00015 in all copies or substantial portions of the Software.

<a name="l00016"></a>00016

<a name="l00017"></a>00017 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,

<a name="l00018"></a>00018 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES

<a name="l00019"></a>00019 OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.

<a name="l00020"></a>00020 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,

<a name="l00021"></a>00021 DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,

<a name="l00022"></a>00022 ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR

<a name="l00023"></a>00023 OTHER DEALINGS IN THE SOFTWARE.

<a name="l00024"></a>00024

<a name="l00025"></a>00025 For more information please visit: http://bmagic.sourceforge.net

<a name="l00026"></a>00026

<a name="l00027"></a>00027 */

<a name="l00028"></a>00028

<a name="l00029"></a>00029

<a name="l00030"></a>00030 /*! \defgroup bvserial bvector serialization

<a name="l00031"></a>00031 * bvector serialization

<a name="l00032"></a>00032 * \ingroup bmagic

<a name="l00033"></a>00033 *

<a name="l00034"></a>00034 */

<a name="l00035"></a>00035

<a name="l00036"></a>00036 #ifndef BM__H__INCLUDED__

<a name="l00037"></a>00037 #define BM__H__INCLUDED__

<a name="l00038"></a>00038

<a name="l00039"></a>00039 #include "<a class="code" href="a00087.html">bm.h</a>"

<a name="l00040"></a>00040

<a name="l00041"></a>00041 #endif

<a name="l00042"></a>00042

<a name="l00043"></a>00043 #ifdef _MSC_VER

<a name="l00044"></a>00044 #pragma warning( disable : 4311 4312)

<a name="l00045"></a>00045 #endif

<a name="l00046"></a>00046

<a name="l00047"></a>00047

<a name="l00048"></a>00048

<a name="l00049"></a>00049 #include "<a class="code" href="a00104.html">encoding.h</a>"

<a name="l00050"></a>00050 #include "<a class="code" href="a00092.html">bmdef.h</a>"

<a name="l00051"></a>00051 #include "<a class="code" href="a00093.html">bmfunc.h</a>"

<a name="l00052"></a>00052 #include "<a class="code" href="a00100.html">bmtrans.h</a>"

<a name="l00053"></a>00053 #include "<a class="code" href="a00089.html">bmalgo_impl.h</a>"

<a name="l00054"></a>00054 #include "<a class="code" href="a00102.html">bmutil.h</a>"

<a name="l00055"></a>00055

<a name="l00056"></a>00056 //#include "bmgamma.h"

<a name="l00057"></a>00057

<a name="l00058"></a>00058

<a name="l00059"></a>00059 namespace bm

<a name="l00060"></a>00060 {

<a name="l00061"></a>00061

<a name="l00062"></a>00062

<a name="l00063"></a>00063 // Serialization stream markup constants

<a name="l00064"></a>00064

<a name="l00065"></a>00065 template<>

<a name="l00066"></a><a class="code" href="a00027.html">00066</a> struct <a class="code" href="a00024.html">bit_grabber</a><unsigned, 32>

<a name="l00067"></a>00067 {

<a name="l00068"></a>00068 static

<a name="l00069"></a><a class="code" href="a00027.html#a68466209bbb94e443715725099b359f3">00069</a> unsigned get(const unsigned* arr, unsigned j)

<a name="l00070"></a>00070 {

<a name="l00071"></a>00071 return (((arr[0] >> j) & 1) << 0) |

<a name="l00072"></a>00072 (((arr[1] >> j) & 1) << 1) |

100

<a name="l00073"></a>00073 (((arr[2] >> j) & 1) << 2) |

101

<a name="l00074"></a>00074 (((arr[3] >> j) & 1) << 3) |

102

<a name="l00075"></a>00075 (((arr[4] >> j) & 1) << 4) |

103

<a name="l00076"></a>00076 (((arr[5] >> j) & 1) << 5) |

104

<a name="l00077"></a>00077 (((arr[6] >> j) & 1) << 6) |

105

<a name="l00078"></a>00078 (((arr[7] >> j) & 1) << 7) |

106

<a name="l00079"></a>00079 (((arr[8] >> j) & 1) << 8) |

107

<a name="l00080"></a>00080 (((arr[9] >> j) & 1) << 9) |

108

<a name="l00081"></a>00081 (((arr[10]>> j) & 1) << 10)|

109

<a name="l00082"></a>00082 (((arr[11]>> j) & 1) << 11)|

110

<a name="l00083"></a>00083 (((arr[12]>> j) & 1) << 12)|

111

<a name="l00084"></a>00084 (((arr[13]>> j) & 1) << 13)|

112

<a name="l00085"></a>00085 (((arr[14]>> j) & 1) << 14)|

113

<a name="l00086"></a>00086 (((arr[15]>> j) & 1) << 15)|

114

<a name="l00087"></a>00087 (((arr[16]>> j) & 1) << 16)|

115

<a name="l00088"></a>00088 (((arr[17]>> j) & 1) << 17)|

116

<a name="l00089"></a>00089 (((arr[18]>> j) & 1) << 18)|

117

<a name="l00090"></a>00090 (((arr[19]>> j) & 1) << 19)|

118

<a name="l00091"></a>00091 (((arr[20]>> j) & 1) << 20)|

119

<a name="l00092"></a>00092 (((arr[21]>> j) & 1) << 21)|

120

<a name="l00093"></a>00093 (((arr[22]>> j) & 1) << 22)|

121

<a name="l00094"></a>00094 (((arr[23]>> j) & 1) << 23)|

122

<a name="l00095"></a>00095 (((arr[24]>> j) & 1) << 24)|

123

<a name="l00096"></a>00096 (((arr[25]>> j) & 1) << 25)|

124

<a name="l00097"></a>00097 (((arr[26]>> j) & 1) << 26)|

125

<a name="l00098"></a>00098 (((arr[27]>> j) & 1) << 27)|

126

<a name="l00099"></a>00099 (((arr[28]>> j) & 1) << 28)|

127

<a name="l00100"></a>00100 (((arr[29]>> j) & 1) << 29)|

128

<a name="l00101"></a>00101 (((arr[30]>> j) & 1) << 30)|

129

<a name="l00102"></a>00102 (((arr[31]>> j) & 1) << 31);

130

<a name="l00103"></a>00103 }

131

<a name="l00104"></a>00104 };

132

<a name="l00105"></a>00105

133

<a name="l00106"></a>00106 template<>

134

<a name="l00107"></a><a class="code" href="a00026.html">00107</a> struct <a class="code" href="a00024.html">bit_grabber</a><unsigned short, 16>

135

<a name="l00108"></a>00108 {

136

<a name="l00109"></a>00109 static

137

<a name="l00110"></a><a class="code" href="a00026.html#a3dd630fb60384045851f4a9b8fbba747">00110</a> unsigned get(const unsigned short* arr, unsigned j)

138

<a name="l00111"></a>00111 {

139

<a name="l00112"></a>00112 return (((arr[0] >> j) & 1) << 0) |

140

<a name="l00113"></a>00113 (((arr[1] >> j) & 1) << 1) |

141

<a name="l00114"></a>00114 (((arr[2] >> j) & 1) << 2) |

142

<a name="l00115"></a>00115 (((arr[3] >> j) & 1) << 3) |

143

<a name="l00116"></a>00116 (((arr[4] >> j) & 1) << 4) |

144

<a name="l00117"></a>00117 (((arr[5] >> j) & 1) << 5) |

145

<a name="l00118"></a>00118 (((arr[6] >> j) & 1) << 6) |

146

<a name="l00119"></a>00119 (((arr[7] >> j) & 1) << 7) |

147

<a name="l00120"></a>00120 (((arr[8] >> j) & 1) << 8) |

148

<a name="l00121"></a>00121 (((arr[9] >> j) & 1) << 9) |

149

<a name="l00122"></a>00122 (((arr[10]>> j) & 1) << 10)|

150

<a name="l00123"></a>00123 (((arr[11]>> j) & 1) << 11)|

151

<a name="l00124"></a>00124 (((arr[12]>> j) & 1) << 12)|

152

<a name="l00125"></a>00125 (((arr[13]>> j) & 1) << 13)|

153

<a name="l00126"></a>00126 (((arr[14]>> j) & 1) << 14)|

154

<a name="l00127"></a>00127 (((arr[15]>> j) & 1) << 15);

155

<a name="l00128"></a>00128 }

156

<a name="l00129"></a>00129 };

157

<a name="l00130"></a>00130

158

<a name="l00131"></a>00131

159

<a name="l00132"></a>00132 template<>

160

<a name="l00133"></a><a class="code" href="a00025.html">00133</a> struct <a class="code" href="a00024.html">bit_grabber</a><unsigned char, 8>

161

<a name="l00134"></a>00134 {

162

<a name="l00135"></a>00135 static

163

<a name="l00136"></a><a class="code" href="a00025.html#a8753317c8359b848499c9395b3320320">00136</a> unsigned get(const unsigned char* arr, unsigned j)

164

<a name="l00137"></a>00137 {

165

<a name="l00138"></a>00138 return (((arr[0] >> j) & 1) << 0) |

166

<a name="l00139"></a>00139 (((arr[1] >> j) & 1) << 1) |

167

<a name="l00140"></a>00140 (((arr[2] >> j) & 1) << 2) |

168

<a name="l00141"></a>00141 (((arr[3] >> j) & 1) << 3) |

169

<a name="l00142"></a>00142 (((arr[4] >> j) & 1) << 4) |

170

<a name="l00143"></a>00143 (((arr[5] >> j) & 1) << 5) |

171

<a name="l00144"></a>00144 (((arr[6] >> j) & 1) << 6) |

172

<a name="l00145"></a>00145 (((arr[7] >> j) & 1) << 7);

173

<a name="l00146"></a>00146 }

174

<a name="l00147"></a>00147 };

175

<a name="l00148"></a>00148

176

<a name="l00149"></a>00149

177

<a name="l00150"></a>00150 /*!

178

<a name="l00151"></a>00151 Bit transpose matrix grabber - template specitialization for various basic types

179

<a name="l00152"></a>00152 @internal

180

<a name="l00153"></a>00153 */

181

<a name="l00154"></a>00154 template<typename T, unsigned BPC, unsigned BPS>

182

<a name="l00155"></a><a class="code" href="a00032.html">00155</a> struct <a class="code" href="a00032.html">bit_trans_grabber</a>

183

<a name="l00156"></a>00156 {

184

<a name="l00157"></a>00157 static

185

<a name="l00158"></a><a class="code" href="a00032.html#a28c57c0d9ac1055cc799afe5e888abb5">00158</a> T get(const T <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[BPC][BPS], unsigned i, unsigned j)

186

<a name="l00159"></a>00159 {

187

<a name="l00160"></a>00160 T w = 0;

188

<a name="l00161"></a>00161

189

<a name="l00162"></a>00162 // Next code hopes that compiler will completely

190

<a name="l00163"></a>00163 // eliminate ifs (all conditions are known at compile time)

191

<a name="l00164"></a>00164 // ( typically C++ compilers are smart to do that)

192

<a name="l00165"></a>00165

193

<a name="l00166"></a>00166 // 8-bit (minimum)

194

<a name="l00167"></a>00167 w |=

195

<a name="l00168"></a>00168 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[0][i] >> j) & 1) << 0) |

196

<a name="l00169"></a>00169 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[1][i] >> j) & 1) << 1) |

197

<a name="l00170"></a>00170 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[2][i] >> j) & 1) << 2) |

198

<a name="l00171"></a>00171 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[3][i] >> j) & 1) << 3) |

199

<a name="l00172"></a>00172 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[4][i] >> j) & 1) << 4) |

200

<a name="l00173"></a>00173 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[5][i] >> j) & 1) << 5) |

201

<a name="l00174"></a>00174 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[6][i] >> j) & 1) << 6) |

202

<a name="l00175"></a>00175 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[7][i] >> j) & 1) << 7);

203

<a name="l00176"></a>00176

204

<a name="l00177"></a>00177 // 16-bit

205

<a name="l00178"></a>00178 if (BPC > 8)

206

<a name="l00179"></a>00179 {

207

<a name="l00180"></a>00180 w |=

208

<a name="l00181"></a>00181 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[8][i] >> j) & 1) << 8) |

209

<a name="l00182"></a>00182 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[9][i] >> j) & 1) << 9) |

210

<a name="l00183"></a>00183 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[10][i] >> j) & 1) << 10) |

211

<a name="l00184"></a>00184 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[11][i] >> j) & 1) << 11) |

212

<a name="l00185"></a>00185 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[12][i] >> j) & 1) << 12) |

213

<a name="l00186"></a>00186 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[13][i] >> j) & 1) << 13) |

214

<a name="l00187"></a>00187 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[14][i] >> j) & 1) << 14) |

215

<a name="l00188"></a>00188 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[15][i] >> j) & 1) << 15);

216

<a name="l00189"></a>00189 }

217

<a name="l00190"></a>00190

218

<a name="l00191"></a>00191 // 32-bit

219

<a name="l00192"></a>00192 if (BPC > 16)

220

<a name="l00193"></a>00193 {

221

<a name="l00194"></a>00194 w |=

222

<a name="l00195"></a>00195 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[16][i] >> j) & 1) << 16) |

223

<a name="l00196"></a>00196 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[17][i] >> j) & 1) << 17) |

224

<a name="l00197"></a>00197 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[18][i] >> j) & 1) << 18) |

225

<a name="l00198"></a>00198 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[19][i] >> j) & 1) << 19) |

226

<a name="l00199"></a>00199 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[20][i] >> j) & 1) << 20) |

227

<a name="l00200"></a>00200 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[21][i] >> j) & 1) << 21) |

228

<a name="l00201"></a>00201 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[22][i] >> j) & 1) << 22) |

229

<a name="l00202"></a>00202 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[23][i] >> j) & 1) << 23) |

230

<a name="l00203"></a>00203 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[24][i] >> j) & 1) << 24) |

231

<a name="l00204"></a>00204 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[25][i] >> j) & 1) << 25) |

232

<a name="l00205"></a>00205 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[26][i] >> j) & 1) << 26) |

233

<a name="l00206"></a>00206 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[27][i] >> j) & 1) << 27) |

234

<a name="l00207"></a>00207 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[28][i] >> j) & 1) << 28) |

235

<a name="l00208"></a>00208 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[29][i] >> j) & 1) << 29) |

236

<a name="l00209"></a>00209 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[30][i] >> j) & 1) << 30) |

237

<a name="l00210"></a>00210 (((<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[31][i] >> j) & 1) << 31);

238

<a name="l00211"></a>00211 }

239

<a name="l00212"></a>00212 return w;

240

<a name="l00213"></a>00213 }

241

<a name="l00214"></a>00214 };

242

<a name="l00215"></a>00215

243

<a name="l00216"></a>00216 /*

244

<a name="l00217"></a>00217 template<>

245

<a name="l00218"></a>00218 struct bit_trans_grabber<unsigned, 32, bm::set_block_plain_size>

246

<a name="l00219"></a>00219 {

247

<a name="l00220"></a>00220 static

248

<a name="l00221"></a>00221 unsigned get(const unsigned tmatrix[32][bm::set_block_plain_size], unsigned i, unsigned j)

249

<a name="l00222"></a>00222 {

250

<a name="l00223"></a>00223 return

251

<a name="l00224"></a>00224 (((tmatrix[0][i] >> j) & 1) << 0) |

252

<a name="l00225"></a>00225 (((tmatrix[1][i] >> j) & 1) << 1) |

253

<a name="l00226"></a>00226 (((tmatrix[2][i] >> j) & 1) << 2) |

254

<a name="l00227"></a>00227 (((tmatrix[3][i] >> j) & 1) << 3) |

255

<a name="l00228"></a>00228 (((tmatrix[4][i] >> j) & 1) << 4) |

256

<a name="l00229"></a>00229 (((tmatrix[5][i] >> j) & 1) << 5) |

257

<a name="l00230"></a>00230 (((tmatrix[6][i] >> j) & 1) << 6) |

258

<a name="l00231"></a>00231 (((tmatrix[7][i] >> j) & 1) << 7) |

259

<a name="l00232"></a>00232 (((tmatrix[8][i] >> j) & 1) << 8) |

260

<a name="l00233"></a>00233 (((tmatrix[9][i] >> j) & 1) << 9) |

261

<a name="l00234"></a>00234 (((tmatrix[10][i] >> j) & 1) << 10) |

262

<a name="l00235"></a>00235 (((tmatrix[11][i] >> j) & 1) << 11) |

263

<a name="l00236"></a>00236 (((tmatrix[12][i] >> j) & 1) << 12) |

264

<a name="l00237"></a>00237 (((tmatrix[13][i] >> j) & 1) << 13) |

265

<a name="l00238"></a>00238 (((tmatrix[14][i] >> j) & 1) << 14) |

266

<a name="l00239"></a>00239 (((tmatrix[15][i] >> j) & 1) << 15) |

267

<a name="l00240"></a>00240 (((tmatrix[16][i] >> j) & 1) << 16) |

268

<a name="l00241"></a>00241 (((tmatrix[17][i] >> j) & 1) << 17) |

269

<a name="l00242"></a>00242 (((tmatrix[18][i] >> j) & 1) << 18) |

270

<a name="l00243"></a>00243 (((tmatrix[19][i] >> j) & 1) << 19) |

271

<a name="l00244"></a>00244 (((tmatrix[20][i] >> j) & 1) << 20) |

272

<a name="l00245"></a>00245 (((tmatrix[21][i] >> j) & 1) << 21) |

273

<a name="l00246"></a>00246 (((tmatrix[22][i] >> j) & 1) << 22) |

274

<a name="l00247"></a>00247 (((tmatrix[23][i] >> j) & 1) << 23) |

275

<a name="l00248"></a>00248 (((tmatrix[24][i] >> j) & 1) << 24) |

276

<a name="l00249"></a>00249 (((tmatrix[25][i] >> j) & 1) << 25) |

277

<a name="l00250"></a>00250 (((tmatrix[26][i] >> j) & 1) << 26) |

278

<a name="l00251"></a>00251 (((tmatrix[27][i] >> j) & 1) << 27) |

279

<a name="l00252"></a>00252 (((tmatrix[28][i] >> j) & 1) << 28) |

280

<a name="l00253"></a>00253 (((tmatrix[29][i] >> j) & 1) << 29) |

281

<a name="l00254"></a>00254 (((tmatrix[30][i] >> j) & 1) << 30) |

282

<a name="l00255"></a>00255 (((tmatrix[31][i] >> j) & 1) << 31);

283

<a name="l00256"></a>00256 }

284

<a name="l00257"></a>00257 };

285

<a name="l00258"></a>00258 */

286

<a name="l00259"></a>00259

287

<a name="l00260"></a>00260

288

<a name="l00261"></a>00261

289

<a name="l00262"></a>00262 /**

290

<a name="l00263"></a>00263 Generic bit-array transposition function

291

<a name="l00264"></a>00264 T - array type (any int)

292

<a name="l00265"></a>00265 BPC - bit plain count

293

<a name="l00266"></a>00266 BPS - bit plain size

294

<a name="l00267"></a>00267

295

<a name="l00268"></a>00268 \param arr - source array start

296

<a name="l00269"></a>00269 \param arr_size - source array size

297

<a name="l00270"></a>00270 \param tmatrix - destination bit matrix

298

<a name="l00271"></a>00271

299

<a name="l00272"></a>00272 */

300

<a name="l00273"></a>00273 template<typename T, unsigned BPC, unsigned BPS>

301

<a name="l00274"></a><a class="code" href="a00110.html#a2e3af9c9f2eb481130d240ba4cd6fd68">00274</a> void <a class="code" href="a00110.html#a2e3af9c9f2eb481130d240ba4cd6fd68" title="Generic bit-array transposition function T - array type (any int) BPC - bit plain...">vect_bit_transpose</a>(const T* arr,

302

<a name="l00275"></a>00275 unsigned arr_size,

303

<a name="l00276"></a>00276 T <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[BPC][BPS])

304

<a name="l00277"></a>00277 {

305

<a name="l00278"></a>00278 <a class="code" href="a00089.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(sizeof(T)*8 == BPC);

306

<a name="l00279"></a>00279

307

<a name="l00280"></a>00280 unsigned col = 0;

308

<a name="l00281"></a>00281 for (unsigned i = 0; i < arr_size;

309

<a name="l00282"></a>00282 i+=BPC, arr+=BPC,

310

<a name="l00283"></a>00283 ++col)

311

<a name="l00284"></a>00284 {

312

<a name="l00285"></a>00285 for (unsigned j = 0; j < BPC; ++j)

313

<a name="l00286"></a>00286 {

314

<a name="l00287"></a>00287 unsigned w =

315

<a name="l00288"></a>00288 <a class="code" href="a00024.html">bm::bit_grabber<T, BPC>::get</a>(arr, j);

316

<a name="l00289"></a>00289 T* row = <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[j];

317

<a name="l00290"></a>00290 row[col] = (T)w;

318

<a name="l00291"></a>00291 } // for j

319

<a name="l00292"></a>00292 } // for i

320

<a name="l00293"></a>00293 }

<a name="l00065"></a>00065

<a name="l00066"></a><a class="code" href="a00115.html#aa24e7c08930cf959d383c6b930fb0508">00066</a> const unsigned char <a class="code" href="a00115.html#aa24e7c08930cf959d383c6b930fb0508" title="End of serialization.">set_block_end</a> = 0; //!< End of serialization

<a name="l00067"></a><a class="code" href="a00115.html#a9e9cf918ca2ebec84eaf844d0e4c8bdb">00067</a> const unsigned char <a class="code" href="a00115.html#a9e9cf918ca2ebec84eaf844d0e4c8bdb" title="One all-zero block.">set_block_1zero</a> = 1; //!< One all-zero block

<a name="l00068"></a><a class="code" href="a00115.html#a715131318a361bcccf59fc0b1e41d444">00068</a> const unsigned char <a class="code" href="a00115.html#a715131318a361bcccf59fc0b1e41d444" title="One block all-set (1111...).">set_block_1one</a> = 2; //!< One block all-set (1111...)

<a name="l00069"></a><a class="code" href="a00115.html#ac9b85b261ab49b37d5e15b84ed2d8b99">00069</a> const unsigned char <a class="code" href="a00115.html#ac9b85b261ab49b37d5e15b84ed2d8b99" title="Up to 256 zero blocks.">set_block_8zero</a> = 3; //!< Up to 256 zero blocks

<a name="l00070"></a><a class="code" href="a00115.html#a57ad1090d6f380cf5de5f98c699b5a75">00070</a> const unsigned char <a class="code" href="a00115.html#a57ad1090d6f380cf5de5f98c699b5a75" title="Up to 256 all-set blocks.">set_block_8one</a> = 4; //!< Up to 256 all-set blocks

<a name="l00071"></a><a class="code" href="a00115.html#aef47eda6538ebf2624c1612d35694c01">00071</a> const unsigned char <a class="code" href="a00115.html#aef47eda6538ebf2624c1612d35694c01" title="Up to 65536 zero blocks.">set_block_16zero</a> = 5; //!< Up to 65536 zero blocks

<a name="l00072"></a><a class="code" href="a00115.html#a3fad4a939708df59b1201910c7d37e30">00072</a> const unsigned char <a class="code" href="a00115.html#a3fad4a939708df59b1201910c7d37e30" title="UP to 65536 all-set blocks.">set_block_16one</a> = 6; //!< UP to 65536 all-set blocks

100

<a name="l00073"></a><a class="code" href="a00115.html#ac7dfbd94a0534df88849bbce9e6c419a">00073</a> const unsigned char <a class="code" href="a00115.html#ac7dfbd94a0534df88849bbce9e6c419a" title="Up to 4G zero blocks.">set_block_32zero</a> = 7; //!< Up to 4G zero blocks

101

<a name="l00074"></a><a class="code" href="a00115.html#a5b87c58ae617ad1f104b4c6bc3ed6447">00074</a> const unsigned char <a class="code" href="a00115.html#a5b87c58ae617ad1f104b4c6bc3ed6447" title="UP to 4G all-set blocks.">set_block_32one</a> = 8; //!< UP to 4G all-set blocks

102

<a name="l00075"></a><a class="code" href="a00115.html#ae87b5c61d7ba6e2e592a279db0b21cc0">00075</a> const unsigned char <a class="code" href="a00115.html#ae87b5c61d7ba6e2e592a279db0b21cc0" title="All other blocks zero.">set_block_azero</a> = 9; //!< All other blocks zero

103

<a name="l00076"></a><a class="code" href="a00115.html#ad506b63262c52870758432a95e71907e">00076</a> const unsigned char <a class="code" href="a00115.html#ad506b63262c52870758432a95e71907e" title="All other blocks one.">set_block_aone</a> = 10; //!< All other blocks one

104

<a name="l00077"></a><a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b">00077</a> const unsigned char <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a> = 11; //!< Plain bit block

105

<a name="l00078"></a><a class="code" href="a00115.html#afe4b1011b09271c5f3882b926e250d39">00078</a> const unsigned char <a class="code" href="a00115.html#afe4b1011b09271c5f3882b926e250d39" title="SGAP compressed bitblock.">set_block_sgapbit</a> = 12; //!< SGAP compressed bitblock

106

<a name="l00079"></a><a class="code" href="a00115.html#ab3a8d57c0b898c3c5a23cd27a8f856ad">00079</a> const unsigned char <a class="code" href="a00115.html#ab3a8d57c0b898c3c5a23cd27a8f856ad" title="SGAP compressed GAP block.">set_block_sgapgap</a> = 13; //!< SGAP compressed GAP block

107

<a name="l00080"></a><a class="code" href="a00115.html#a09b8c4b17b7d6f613c237c46d04a9cd6">00080</a> const unsigned char <a class="code" href="a00115.html#a09b8c4b17b7d6f613c237c46d04a9cd6" title="Plain GAP block.">set_block_gap</a> = 14; //!< Plain GAP block

108

<a name="l00081"></a><a class="code" href="a00115.html#a77dc965397e31a1d39c3d8e628792779">00081</a> const unsigned char <a class="code" href="a00115.html#a77dc965397e31a1d39c3d8e628792779" title="GAP compressed bitblock.">set_block_gapbit</a> = 15; //!< GAP compressed bitblock

109

<a name="l00082"></a><a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923">00082</a> const unsigned char <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a> = 16; //!< List of bits ON

110

<a name="l00083"></a><a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce">00083</a> const unsigned char <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a> = 17; //!< Interval block

111

<a name="l00084"></a><a class="code" href="a00115.html#aae33ceefae804cdd94412beee8c52720">00084</a> const unsigned char <a class="code" href="a00115.html#aae33ceefae804cdd94412beee8c52720" title="List of bits ON (GAP block).">set_block_arrgap</a> = 18; //!< List of bits ON (GAP block)

112

<a name="l00085"></a><a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc">00085</a> const unsigned char <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a> = 19; //!< Bit block with 1 bit ON

113

<a name="l00086"></a><a class="code" href="a00115.html#ac47dea3917e15264ed3ba0cf4055adbe">00086</a> const unsigned char <a class="code" href="a00115.html#ac47dea3917e15264ed3ba0cf4055adbe" title="Gamma compressed GAP block.">set_block_gap_egamma</a> = 20; //!< Gamma compressed GAP block

114

<a name="l00087"></a><a class="code" href="a00115.html#a9674ddb1b9ee66948465249688708188">00087</a> const unsigned char <a class="code" href="a00115.html#a9674ddb1b9ee66948465249688708188" title="Gamma compressed delta GAP array.">set_block_arrgap_egamma</a> = 21; //!< Gamma compressed delta GAP array

115

<a name="l00088"></a><a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e">00088</a> const unsigned char <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a> = 22; //!< Bit block with encoded zero intervals

116

<a name="l00089"></a><a class="code" href="a00115.html#a1caddb62b332a568ba590794800610f6">00089</a> const unsigned char <a class="code" href="a00115.html#a1caddb62b332a568ba590794800610f6" title="Gamma compressed inverted delta GAP array.">set_block_arrgap_egamma_inv</a> = 23; //!< Gamma compressed inverted delta GAP array

117

<a name="l00090"></a><a class="code" href="a00115.html#a746a03f6f5563cc8c75db93bba40095d">00090</a> const unsigned char <a class="code" href="a00115.html#a746a03f6f5563cc8c75db93bba40095d" title="List of bits OFF (GAP block).">set_block_arrgap_inv</a> = 24; //!< List of bits OFF (GAP block)

118

<a name="l00091"></a>00091

119

<a name="l00092"></a>00092

120

<a name="l00093"></a>00093 /// \internal

121

<a name="l00094"></a>00094 /// \ingroup bvserial

122

<a name="l00095"></a><a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0">00095</a> enum <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0">serialization_header_mask</a> {

123

<a name="l00096"></a><a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a97434d6617bb5f0d6f3bf44491f712ca">00096</a> <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a97434d6617bb5f0d6f3bf44491f712ca">BM_HM_DEFAULT</a> = 1,

124

<a name="l00097"></a><a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0af4fbefa0ed0a8ff42dd664f120782c27">00097</a> <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0af4fbefa0ed0a8ff42dd664f120782c27" title="resized vector">BM_HM_RESIZE</a> = (1 << 1), ///< resized vector

125

<a name="l00098"></a><a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a64c44c57a6f8b8e89f0916db9e120d47">00098</a> <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a64c44c57a6f8b8e89f0916db9e120d47" title="id list stored">BM_HM_ID_LIST</a> = (1 << 2), ///< id list stored

126

<a name="l00099"></a><a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a6b127bde401907318702dd4827c8f74e">00099</a> <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a6b127bde401907318702dd4827c8f74e" title="no byte-order">BM_HM_NO_BO</a> = (1 << 3), ///< no byte-order

127

<a name="l00100"></a><a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a04c714af376c203bc8b082856ad622a3">00100</a> <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a04c714af376c203bc8b082856ad622a3" title="no GAP levels">BM_HM_NO_GAPL</a> = (1 << 4) ///< no GAP levels

128

<a name="l00101"></a>00101 };

129

<a name="l00102"></a>00102

130

<a name="l00103"></a>00103

131

<a name="l00104"></a>00104

132

<a name="l00105"></a><a class="code" href="a00096.html#a6a3d8841118b48dc31cf507ac70c763a">00105</a> #define SER_NEXT_GRP(enc, nb, B_1ZERO, B_8ZERO, B_16ZERO, B_32ZERO) \

133

<a name="l00106"></a>00106 if (nb == 1) \

134

<a name="l00107"></a>00107 enc.put_8(B_1ZERO); \

135

<a name="l00108"></a>00108 else if (nb < 256) \

136

<a name="l00109"></a>00109 { \

137

<a name="l00110"></a>00110 enc.put_8(B_8ZERO); \

138

<a name="l00111"></a>00111 enc.put_8((unsigned char)nb); \

139

<a name="l00112"></a>00112 } \

140

<a name="l00113"></a>00113 else if (nb < 65536) \

141

<a name="l00114"></a>00114 { \

142

<a name="l00115"></a>00115 enc.put_8(B_16ZERO); \

143

<a name="l00116"></a>00116 enc.put_16((unsigned short)nb); \

144

<a name="l00117"></a>00117 } \

145

<a name="l00118"></a>00118 else \

146

<a name="l00119"></a>00119 {\

147

<a name="l00120"></a>00120 enc.put_8(B_32ZERO); \

148

<a name="l00121"></a>00121 enc.put_32(nb); \

149

<a name="l00122"></a>00122 }

150

<a name="l00123"></a>00123

151

<a name="l00124"></a>00124

152

<a name="l00125"></a><a class="code" href="a00096.html#a045ab59db462c831654a8acefdf65443">00125</a> #define BM_SET_ONE_BLOCKS(x) \

153

<a name="l00126"></a>00126 {\

154

<a name="l00127"></a>00127 unsigned end_block = i + x; \

155

<a name="l00128"></a>00128 for (;i < end_block; ++i) \

156

<a name="l00129"></a>00129 bman.set_block_all_set(i); \

157

<a name="l00130"></a>00130 } \

158

<a name="l00131"></a>00131 --i

159

<a name="l00132"></a>00132

160

<a name="l00133"></a>00133

161

<a name="l00134"></a>00134

162

<a name="l00135"></a>00135

163

<a name="l00136"></a>00136 /**

164

<a name="l00137"></a>00137 Bit-vector serialization class.

165

<a name="l00138"></a>00138

166

<a name="l00139"></a>00139 Class designed to convert sparse bit-vector into a block of memory

167

<a name="l00140"></a>00140 ready for file or database storage or network transfer.

168

<a name="l00141"></a>00141

169

<a name="l00142"></a>00142 @ingroup bvserial

170

<a name="l00143"></a>00143 */

171

<a name="l00144"></a>00144 template<class BV>

172

<a name="l00145"></a><a class="code" href="a00083.html">00145</a> class <a class="code" href="a00083.html" title="Bit-vector serialization class.">serializer</a>

173

<a name="l00146"></a>00146 {

174

<a name="l00147"></a>00147 public:

175

<a name="l00148"></a><a class="code" href="a00083.html#a59fca7741f95b36a196773ac1810c52c">00148</a> typedef typename BV::allocator_type <a class="code" href="a00083.html#a59fca7741f95b36a196773ac1810c52c">allocator_type</a>;

176

<a name="l00149"></a><a class="code" href="a00083.html#a33209dcd954f9cadff5a3379108d84e0">00149</a> typedef typename BV::blocks_manager_type <a class="code" href="a00083.html#a33209dcd954f9cadff5a3379108d84e0">blocks_manager_type</a>;

177

<a name="l00150"></a>00150 public:

178

<a name="l00151"></a>00151 <a class="code" href="a00083.html#a49b063cc7e0d53b8875f893bff37c7fa">serializer</a>(const <a class="code" href="a00083.html#a59fca7741f95b36a196773ac1810c52c">allocator_type</a>& alloc = <a class="code" href="a00083.html#a59fca7741f95b36a196773ac1810c52c">allocator_type</a>());

179

<a name="l00152"></a>00152 <a class="code" href="a00083.html#a6cb13dcbfb820fc7e90a959937f2f461">~serializer</a>();

180

<a name="l00153"></a>00153

181

<a name="l00154"></a>00154 /**

182

<a name="l00155"></a>00155 Set compression level. Higher compression takes more time to process.

183

<a name="l00156"></a>00156

184

<a name="l00157"></a>00157 @param clevel - compression level (0-4)

185

<a name="l00158"></a>00158 */

186

<a name="l00159"></a>00159 void <a class="code" href="a00083.html#ad433d790f07103d39c5f15a6caaf2823" title="Set compression level.">set_compression_level</a>(unsigned clevel);

187

<a name="l00160"></a>00160

188

<a name="l00161"></a>00161 /**

189

<a name="l00162"></a>00162 Get compression level

190

<a name="l00163"></a>00163 */

191

<a name="l00164"></a>00164 unsigned <a class="code" href="a00083.html#ada73fe9103470fc726968cd0e8dbe04f" title="Get compression level.">get_compression_level</a>() const;

192

<a name="l00165"></a>00165

193

<a name="l00166"></a>00166 /**

194

<a name="l00167"></a>00167 Bitvector serilization into memory block

195

<a name="l00168"></a>00168

196

<a name="l00169"></a>00169 @param bv - input bitvector

197

<a name="l00170"></a>00170 @param buf - out buffer (pre-allocated)

198

<a name="l00171"></a>00171 No range checking is done in this method.

199

<a name="l00172"></a>00172 It is responsibility of caller to allocate sufficient

200

<a name="l00173"></a>00173 amount of memory using information from calc_stat() function.

201

<a name="l00174"></a>00174

202

<a name="l00175"></a>00175 @param buf_size - size of the output buffer

203

<a name="l00176"></a>00176

204

<a name="l00177"></a>00177 @return Size of serialization block.

205

<a name="l00178"></a>00178 @sa calc_stat

206

<a name="l00179"></a>00179 */

207

<a name="l00180"></a>00180 unsigned <a class="code" href="a00083.html#af747ada0a8f77d79d73b34443595f4d4" title="Bitvector serilization into memory block.">serialize</a>(const BV& bv,

208

<a name="l00181"></a>00181 unsigned char* buf, unsigned buf_size);

209

<a name="l00182"></a>00182

210

<a name="l00183"></a>00183

211

<a name="l00184"></a>00184 /**

212

<a name="l00185"></a>00185 Set GAP length serialization (serializes GAP levels of the original vector)

213

<a name="l00186"></a>00186

214

<a name="l00187"></a>00187 @param value - when TRUE serialized vector includes GAP levels parameters

215

<a name="l00188"></a>00188 */

216

<a name="l00189"></a>00189 void <a class="code" href="a00083.html#a5b19026c2e928c639f09da4a4e1235ab" title="Set GAP length serialization (serializes GAP levels of the original vector).">gap_length_serialization</a>(bool value);

217

<a name="l00190"></a>00190 /**

218

<a name="l00191"></a>00191 Set byte-order serialization (for cross platform compatibility)

219

<a name="l00192"></a>00192

220

<a name="l00193"></a>00193 @param value - TRUE serialization format includes byte-order marker

221

<a name="l00194"></a>00194 */

222

<a name="l00195"></a>00195 void <a class="code" href="a00083.html#a892b124d42bb939485e47d197b8dc1ac" title="Set byte-order serialization (for cross platform compatibility).">byte_order_serialization</a>(bool value);

223

<a name="l00196"></a>00196

224

<a name="l00197"></a>00197 protected:

225

<a name="l00198"></a>00198 /**

226

<a name="l00199"></a>00199 Encode serialization header information

227

<a name="l00200"></a>00200 */

228

<a name="l00201"></a>00201 void <a class="code" href="a00083.html#a341d5819f2f1164172f4c0c4771ec941" title="Encode serialization header information.">encode_header</a>(const BV& bv, <a class="code" href="a00062.html" title="Memory encoding.">bm::encoder</a>& enc);

229

<a name="l00202"></a>00202

230

<a name="l00203"></a>00203 /**

231

<a name="l00204"></a>00204 Encode GAP block

232

<a name="l00205"></a>00205 */

233

<a name="l00206"></a>00206 void <a class="code" href="a00083.html#a77bfac165158b3a018654d88fbed0121" title="Encode GAP block.">encode_gap_block</a>(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* gap_block, <a class="code" href="a00062.html" title="Memory encoding.">bm::encoder</a>& enc);

234

<a name="l00207"></a>00207

235

<a name="l00208"></a>00208 /**

236

<a name="l00209"></a>00209 Encode GAP block with Elias Gamma coder

237

<a name="l00210"></a>00210 */

238

<a name="l00211"></a>00211 void <a class="code" href="a00083.html#aa7eac0e670c3ff98404a5f1dcec1ef33" title="Encode GAP block with Elias Gamma coder.">gamma_gap_block</a>(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* gap_block, <a class="code" href="a00062.html" title="Memory encoding.">bm::encoder</a>& enc);

239

<a name="l00212"></a>00212

240

<a name="l00213"></a>00213 /**

241

<a name="l00214"></a>00214 Encode GAP block as delta-array with Elias Gamma coder

242

<a name="l00215"></a>00215 */

243

<a name="l00216"></a>00216 void <a class="code" href="a00083.html#a88e75dd5bc8234634b21c7d3dcddc8c6" title="Encode GAP block as delta-array with Elias Gamma coder.">gamma_gap_array</a>(const <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* gap_block,

244

<a name="l00217"></a>00217 unsigned arr_len,

245

<a name="l00218"></a>00218 <a class="code" href="a00062.html" title="Memory encoding.">bm::encoder</a>& enc,

246

<a name="l00219"></a>00219 bool inverted = false);

247

<a name="l00220"></a>00220

248

<a name="l00221"></a>00221 /**

249

<a name="l00222"></a>00222 Encode BIT block with repeatable runs of zeroes

250

<a name="l00223"></a>00223 */

251

<a name="l00224"></a>00224 void <a class="code" href="a00083.html#a2c005feac8bc059af3333234c52739ed" title="Encode BIT block with repeatable runs of zeroes.">encode_bit_interval</a>(const <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk,

252

<a name="l00225"></a>00225 <a class="code" href="a00062.html" title="Memory encoding.">bm::encoder</a>& enc,

253

<a name="l00226"></a>00226 unsigned size_control);

254

<a name="l00227"></a>00227

255

<a name="l00228"></a>00228 private:

256

<a name="l00229"></a>00229 <a class="code" href="a00083.html#a49b063cc7e0d53b8875f893bff37c7fa">serializer</a>(const <a class="code" href="a00083.html" title="Bit-vector serialization class.">serializer</a>&);

257

<a name="l00230"></a>00230 <a class="code" href="a00083.html" title="Bit-vector serialization class.">serializer</a>& operator=(const <a class="code" href="a00083.html" title="Bit-vector serialization class.">serializer</a>&);

258

<a name="l00231"></a>00231

259

<a name="l00232"></a>00232 private:

260

<a name="l00233"></a>00233

261

<a name="l00234"></a>00234 typedef <a class="code" href="a00031.html" title="Byte based writer for un-aligned bit streaming.">bm::bit_out<bm::encoder></a> <a class="code" href="a00031.html" title="Byte based writer for un-aligned bit streaming.">bit_out_type</a>;

262

<a name="l00235"></a>00235 typedef <a class="code" href="a00066.html" title="Functor for Elias Gamma encoding.">bm::gamma_encoder<bm::gap_word_t, bit_out_type></a> <a class="code" href="a00066.html" title="Functor for Elias Gamma encoding.">gamma_encoder_func</a>;

263

<a name="l00236"></a>00236

264

<a name="l00237"></a>00237 private:

265

<a name="l00238"></a>00238 <a class="code" href="a00083.html#a59fca7741f95b36a196773ac1810c52c">allocator_type</a> alloc_;

266

<a name="l00239"></a>00239 bool gap_serial_;

267

<a name="l00240"></a>00240 bool byte_order_serial_;

268

<a name="l00241"></a>00241 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_block_;

269

<a name="l00242"></a>00242 unsigned compression_level_;

270

<a name="l00243"></a>00243 };

271

<a name="l00244"></a>00244

272

<a name="l00245"></a>00245 /**

273

<a name="l00246"></a>00246 Base deserialization class

274

<a name="l00247"></a>00247 \ingroup bvserial

275

<a name="l00248"></a>00248 */

276

<a name="l00249"></a>00249 template<class DEC>

277

<a name="l00250"></a><a class="code" href="a00058.html">00250</a> class <a class="code" href="a00058.html" title="Base deserialization class.">deseriaizer_base</a>

278

<a name="l00251"></a>00251 {

279

<a name="l00252"></a>00252 public:

280

<a name="l00253"></a><a class="code" href="a00058.html#ae453292ecf6fc43678d2308cedf50772">00253</a> typedef DEC <a class="code" href="a00058.html#ae453292ecf6fc43678d2308cedf50772">decoder_type</a>;

281

<a name="l00254"></a>00254 protected:

282

<a name="l00255"></a><a class="code" href="a00058.html#a931719914a0bea3491b2ba5ebf97cb03">00255</a> <a class="code" href="a00058.html#a931719914a0bea3491b2ba5ebf97cb03">deseriaizer_base</a>(){}

283

<a name="l00256"></a>00256

284

<a name="l00257"></a>00257 /// Read GAP block from the stream

285

<a name="l00258"></a>00258 void <a class="code" href="a00058.html#abbd0f97d8c8bd1017cd65885870c2426" title="Read GAP block from the stream.">read_gap_block</a>(<a class="code" href="a00058.html#ae453292ecf6fc43678d2308cedf50772">decoder_type</a>& <a class="code" href="a00054.html" title="Class for decoding data from memory buffer.">decoder</a>,

286

<a name="l00259"></a>00259 unsigned block_type,

287

<a name="l00260"></a>00260 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* dst_block,

288

<a name="l00261"></a>00261 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>& gap_head);

289

<a name="l00262"></a>00262 };

290

<a name="l00263"></a>00263

291

<a name="l00264"></a>00264 /**

292

<a name="l00265"></a>00265 Class deserializer

293

<a name="l00266"></a>00266 \ingroup bvserial

294

<a name="l00267"></a>00267 */

295

<a name="l00268"></a>00268 template<class BV, class DEC>

296

<a name="l00269"></a><a class="code" href="a00059.html">00269</a> class <a class="code" href="a00059.html" title="Class deserializer.">deserializer</a> : protected <a class="code" href="a00058.html" title="Base deserialization class.">deseriaizer_base</a><DEC>

297

<a name="l00270"></a>00270 {

298

<a name="l00271"></a>00271 public:

299

<a name="l00272"></a><a class="code" href="a00059.html#a859605c730b53ed8e025220e6eec2dd6">00272</a> typedef BV <a class="code" href="a00059.html#a859605c730b53ed8e025220e6eec2dd6">bvector_type</a>;

300

<a name="l00273"></a><a class="code" href="a00059.html#a34d196efac18e976843727d6266cdf40">00273</a> typedef typename <a class="code" href="a00058.html" title="Base deserialization class.">deseriaizer_base<DEC>::decoder_type</a> <a class="code" href="a00059.html#a34d196efac18e976843727d6266cdf40">decoder_type</a>;

301

<a name="l00274"></a>00274 // typedef DEC decoder_type;

302

<a name="l00275"></a>00275 public:

303

<a name="l00276"></a><a class="code" href="a00059.html#a08e12ee7e89292068b1e62a43881a2f9">00276</a> <a class="code" href="a00059.html#a08e12ee7e89292068b1e62a43881a2f9">deserializer</a>() : <a class="code" href="a00059.html#ae59b9caa9b7ae36070561a4953d29b1c">temp_block_</a>(0) {}

304

<a name="l00277"></a>00277

305

<a name="l00278"></a>00278 unsigned <a class="code" href="a00059.html#ab92b3cd1e7289fe0aa7ac3038a4e0cbd">deserialize</a>(<a class="code" href="a00059.html#a859605c730b53ed8e025220e6eec2dd6">bvector_type</a>& bv,

306

<a name="l00279"></a>00279 const unsigned char* buf,

307

<a name="l00280"></a>00280 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_block);

308

<a name="l00281"></a>00281 protected:

309

<a name="l00282"></a><a class="code" href="a00059.html#aa65584010f05f3e9e0c38c725c37dabc">00282</a> typedef typename BV::blocks_manager_type <a class="code" href="a00059.html#aa65584010f05f3e9e0c38c725c37dabc">blocks_manager_type</a>;

310

<a name="l00283"></a><a class="code" href="a00059.html#a8bc2df325244a424472a05ece78ce414">00283</a> typedef typename BV::allocator_type <a class="code" href="a00059.html#a8bc2df325244a424472a05ece78ce414">allocator_type</a>;

311

<a name="l00284"></a>00284

312

<a name="l00285"></a>00285 protected:

313

<a name="l00286"></a>00286 void <a class="code" href="a00059.html#a6cb253af926d3b4562d538b6684fb99f">deserialize_gap</a>(unsigned char btype, <a class="code" href="a00059.html#a34d196efac18e976843727d6266cdf40">decoder_type</a>& dec,

314

<a name="l00287"></a>00287 <a class="code" href="a00059.html#a859605c730b53ed8e025220e6eec2dd6">bvector_type</a>& bv, <a class="code" href="a00059.html#aa65584010f05f3e9e0c38c725c37dabc">blocks_manager_type</a>& bman,

315

<a name="l00288"></a>00288 unsigned i,

316

<a name="l00289"></a>00289 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk);

317

<a name="l00290"></a>00290 protected:

318

<a name="l00291"></a><a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">00291</a> <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a> <a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a>[<a class="code" href="a00115.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a> * 3];

319

<a name="l00292"></a><a class="code" href="a00059.html#ae59b9caa9b7ae36070561a4953d29b1c">00292</a> <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00059.html#ae59b9caa9b7ae36070561a4953d29b1c">temp_block_</a>;

320

<a name="l00293"></a>00293 };

321

<a name="l00294"></a>00294

322

<a name="l00295"></a>00295

323

<a name="l00296"></a>00296 /**

324

<a name="l00297"></a>00297 Restore bit array from the transposition matrix

325

<a name="l00298"></a>00298 T - array type (any int)

326

<a name="l00299"></a>00299 BPC - bit plain count

327

<a name="l00300"></a>00300 BPS - bit plain size

328

<a name="l00301"></a>00301

329

<a name="l00302"></a>00302 \param arr - dest array

330

<a name="l00303"></a>00303 \param tmatrix - source bit-slice matrix

331

<a name="l00304"></a>00304

332

<a name="l00305"></a>00305 */

333

<a name="l00306"></a>00306 template<typename T, unsigned BPC, unsigned BPS>

334

<a name="l00307"></a><a class="code" href="a00110.html#a089ac7cd17ddca4bf3c661c96f749f3f">00307</a> void <a class="code" href="a00110.html#a089ac7cd17ddca4bf3c661c96f749f3f" title="Restore bit array from the transposition matrix T - array type (any int) BPC - bit...">vect_bit_trestore</a>(const T <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[BPC][BPS],

335

<a name="l00308"></a>00308 T* arr)

336

<a name="l00309"></a>00309 {

337

<a name="l00310"></a>00310 unsigned col = 0;

338

<a name="l00311"></a>00311 for (unsigned i = 0; i < BPS; ++i)

339

<a name="l00312"></a>00312 {

340

<a name="l00313"></a>00313 for (unsigned j = 0; j < BPC; ++j, ++col)

341

<a name="l00314"></a>00314 {

342

<a name="l00315"></a>00315 arr[col] =

343

<a name="l00316"></a>00316 <a class="code" href="a00032.html">bm::bit_trans_grabber<T, BPC, BPS>::get</a>(<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>, i, j);

344

<a name="l00317"></a>00317 } // for j

345

<a name="l00318"></a>00318 } // for i

346

<a name="l00319"></a>00319 }

347

<a name="l00320"></a>00320

348

<a name="l00321"></a>00321

349

<a name="l00322"></a>00322

350

<a name="l00323"></a>00323 /*!

351

<a name="l00324"></a>00324 \brief Compute pairwise Row x Row Humming distances on plains(rows) of

352

<a name="l00325"></a>00325 the transposed bit block

353

<a name="l00326"></a>00326 \param tmatrix - bit-block transposition matrix (bit-plains)

354

<a name="l00327"></a>00327 \param distance - pairwise NxN Humming distance matrix (diagonal is popcnt)

355

<a name="l00328"></a>00328

356

<a name="l00329"></a>00329 @ingroup bitfunc

324

<a name="l00297"></a>00297 Iterator to walk forward the serialized stream.

325

<a name="l00298"></a>00298

326

<a name="l00299"></a>00299 \internal

327

<a name="l00300"></a>00300 \ingroup bvserial

328

<a name="l00301"></a>00301 */

329

<a name="l00302"></a>00302 template<class BV, class SerialIterator>

330

<a name="l00303"></a><a class="code" href="a00073.html">00303</a> class <a class="code" href="a00073.html" title="Iterator to walk forward the serialized stream.">iterator_deserializer</a>

331

<a name="l00304"></a>00304 {

332

<a name="l00305"></a>00305 public:

333

<a name="l00306"></a><a class="code" href="a00073.html#a2ff37a8330d32456a46afd87393921df">00306</a> typedef BV <a class="code" href="a00073.html#a2ff37a8330d32456a46afd87393921df">bvector_type</a>;

334

<a name="l00307"></a><a class="code" href="a00073.html#a11a5875fa8c6951950eb36d0568b301b">00307</a> typedef SerialIterator <a class="code" href="a00073.html#a11a5875fa8c6951950eb36d0568b301b">serial_iterator_type</a>;

335

<a name="l00308"></a>00308 public:

336

<a name="l00309"></a>00309 static

337

<a name="l00310"></a>00310 unsigned <a class="code" href="a00073.html#ac193063e13965f5d5cfb28cf2440f92c">deserialize</a>(<a class="code" href="a00073.html#a2ff37a8330d32456a46afd87393921df">bvector_type</a>& bv,

338

<a name="l00311"></a>00311 <a class="code" href="a00073.html#a11a5875fa8c6951950eb36d0568b301b">serial_iterator_type</a>& sit,

339

<a name="l00312"></a>00312 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_block,

340

<a name="l00313"></a>00313 <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109" title="Nomenclature of set operations.">set_operation</a> op = <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a05d88a2639cbd3d2ac63436df3ed6780">bm::set_OR</a>);

341

<a name="l00314"></a>00314 private:

342

<a name="l00315"></a>00315 typedef typename BV::blocks_manager_type blocks_manager_type;

343

<a name="l00316"></a>00316

344

<a name="l00317"></a>00317 /// load data from the iterator of type "id list"

345

<a name="l00318"></a>00318 static

346

<a name="l00319"></a>00319 void load_id_list(<a class="code" href="a00073.html#a2ff37a8330d32456a46afd87393921df">bvector_type</a>& bv,

347

<a name="l00320"></a>00320 <a class="code" href="a00073.html#a11a5875fa8c6951950eb36d0568b301b">serial_iterator_type</a>& sit,

348

<a name="l00321"></a>00321 unsigned id_count,

349

<a name="l00322"></a>00322 bool set_clear);

350

<a name="l00323"></a>00323 };

351

<a name="l00324"></a>00324

352

<a name="l00325"></a>00325 /*!

353

<a name="l00326"></a>00326 @brief Serialization stream iterator

354

<a name="l00327"></a>00327

355

<a name="l00328"></a>00328 Iterates blocks and control tokens of serialized bit-stream

356

<a name="l00329"></a>00329 \ingroup bvserial

357

<a name="l00330"></a>00330 */

358

<a name="l00331"></a>00331 template<typename T, unsigned BPC, unsigned BPS>

359

<a name="l00332"></a><a class="code" href="a00115.html#ga3fe02492f64cd8a9dfbb1a00ec71c0ae">00332</a> void <a class="code" href="a00115.html#ga3fe02492f64cd8a9dfbb1a00ec71c0ae" title="Compute pairwise Row x Row Humming distances on plains(rows) of the transposed bit...">tmatrix_distance</a>(const T <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[BPC][BPS],

360

<a name="l00333"></a>00333 unsigned distance[BPC][BPC])

361

<a name="l00334"></a>00334 {

362

<a name="l00335"></a>00335 for (unsigned i = 0; i < BPC; ++i)

363

<a name="l00336"></a>00336 {

364

<a name="l00337"></a>00337 const T* r1 = <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[i];

365

<a name="l00338"></a>00338 const T* r1_end = r1 + BPS;

366

<a name="l00339"></a>00339 distance[i][i] =

367

<a name="l00340"></a>00340 <a class="code" href="a00115.html#gab30df14a61f036d690c091878feaff1c" title="Bitcount for bit string.">bm::bit_block_calc_count</a>((<a class="code" href="a00110.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)r1, (<a class="code" href="a00110.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)r1_end);

368

<a name="l00341"></a>00341

369

<a name="l00342"></a>00342 for (unsigned j = i + 1; j < BPC; ++j)

370

<a name="l00343"></a>00343 {

371

<a name="l00344"></a>00344 r1 = <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[i];

372

<a name="l00345"></a>00345 r1_end = r1 + BPS;

373

<a name="l00346"></a>00346 unsigned count = 0;

374

<a name="l00347"></a>00347

375

<a name="l00348"></a>00348 {

376

<a name="l00349"></a>00349 const T* r2 = <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[i];

377

<a name="l00350"></a>00350 const T* r2_end = r2 + BPS;

378

<a name="l00351"></a>00351 const <a class="code" href="a00110.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* r3 = (<a class="code" href="a00110.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)(<a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[j]);

379

<a name="l00352"></a>00352 do {

380

<a name="l00353"></a>00353 <a class="code" href="a00115.html#ga967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, r2[0] ^ r3[0]);

381

<a name="l00354"></a>00354 <a class="code" href="a00115.html#ga967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, r2[1] ^ r3[1]);

382

<a name="l00355"></a>00355 <a class="code" href="a00115.html#ga967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, r2[2] ^ r3[2]);

383

<a name="l00356"></a>00356 <a class="code" href="a00115.html#ga967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, r2[3] ^ r3[3]);

384

<a name="l00357"></a>00357 r2 += 4;

385

<a name="l00358"></a>00358 r3 += 4;

386

<a name="l00359"></a>00359 } while (r2 < r2_end);

387

<a name="l00360"></a>00360 }

388

<a name="l00361"></a>00361 distance[i][j] = count;

389

<a name="l00362"></a>00362 /*

390

<a name="l00363"></a>00363 distance[i][j] =

391

<a name="l00364"></a>00364 bit_block_xor_count(

392

<a name="l00365"></a>00365 (bm::word_t*)r1, (bm::word_t*)r1_end, (bm::word_t*)(tmatrix[j]));

393

<a name="l00366"></a>00366 if (count != distance[i][j])

394

<a name="l00367"></a>00367 printf("BShit!");

395

<a name="l00368"></a>00368 */

396

<a name="l00369"></a>00369 } // for j

397

<a name="l00370"></a>00370 } // for i

398

<a name="l00371"></a>00371 }

399

<a name="l00372"></a>00372

400

<a name="l00373"></a>00373

401

<a name="l00374"></a>00374

402

<a name="l00375"></a><a class="code" href="a00110.html#ae34de9206be7a8aa05db9d5dc38bfc90">00375</a> const unsigned char <a class="code" href="a00110.html#ae34de9206be7a8aa05db9d5dc38bfc90">ibpc_uncompr</a> = 0; ///!< plain uncompressed

403

<a name="l00376"></a><a class="code" href="a00110.html#aaca6d3c887b5b7b66a78e95471f9a326">00376</a> const unsigned char <a class="code" href="a00110.html#aaca6d3c887b5b7b66a78e95471f9a326" title="!&lt; plain uncompressed">ibpc_all_zero</a>= 1; ///!< plain ALL ZERO

404

<a name="l00377"></a><a class="code" href="a00110.html#aa6f59be0b838db693e0f081bcaf750f0">00377</a> const unsigned char <a class="code" href="a00110.html#aa6f59be0b838db693e0f081bcaf750f0" title="!&lt; plain ALL ZERO">ibpc_all_one</a> = 2; ///!< plain ALL ONE

405

<a name="l00378"></a><a class="code" href="a00110.html#a748d4095c39c9372a590b431e0ec17fe">00378</a> const unsigned char <a class="code" href="a00110.html#a748d4095c39c9372a590b431e0ec17fe" title="!&lt; plain ALL ONE">ibpc_equiv</a> = 3; ///!< plain is equal to plain M

406

<a name="l00379"></a><a class="code" href="a00110.html#aa61bf7691d32a9bc7c65c05bb62657e5">00379</a> const unsigned char <a class="code" href="a00110.html#aa61bf7691d32a9bc7c65c05bb62657e5" title="!&lt; plain is equal to plain M">ibpc_close</a> = 4; ///!< plain is close to plain M

407

<a name="l00380"></a>00380

408

<a name="l00381"></a><a class="code" href="a00110.html#ae4f14f0c2c5a9ee277808d36fd94693f">00381</a> const unsigned char <a class="code" href="a00110.html#ae4f14f0c2c5a9ee277808d36fd94693f" title="!&lt; plain is close to plain M">ibpc_end</a> = 8; ///!< ibpc limiter

409

<a name="l00382"></a>00382

410

<a name="l00383"></a>00383

411

<a name="l00384"></a>00384 /*!

412

<a name="l00385"></a>00385 \brief Make a compression descriptor vector for bit-plains

413

<a name="l00386"></a>00386

414

<a name="l00387"></a>00387 \param distance - pairwise distance matrix

415

<a name="l00388"></a>00388 \param pc_vector - OUT compression descriptor vector

416

417

<a name="l00390"></a>00390 pc_vector[] format:

418

<a name="l00391"></a>00391 each element (pc_vector[i]) describes the plain compression:

419

<a name="l00392"></a>00392 first 3 bits - compression code:

420

<a name="l00393"></a>00393 0 - plain uncompressed

421

<a name="l00394"></a>00394 1 - plain is ALL ZERO (000000...)

422

<a name="l00395"></a>00395 2 - plain is ALL ONE (111111...)

423

<a name="l00396"></a>00396 3 - plain is equal to another plain J (5 high bits (max 31))

424

<a name="l00397"></a>00397 4 - plain is close (but not equal) to plain J

425

<a name="l00398"></a>00398 next 5 bits - number of plain used as a XOR expression

426

<a name="l00399"></a>00399 ( compression codes: 3,4 )

427

428

<a name="l00401"></a>00401

429

<a name="l00402"></a>00402 @ingroup bitfunc

430

<a name="l00403"></a>00403 */

431

<a name="l00404"></a>00404 template<typename T, unsigned BPC, unsigned BPS>

432

<a name="l00405"></a><a class="code" href="a00115.html#gabdc11d48fda6a69873eefd219c4b7e75">00405</a> void <a class="code" href="a00115.html#gabdc11d48fda6a69873eefd219c4b7e75" title="!&lt; ibpc limiter">bit_iblock_make_pcv</a>(

433

<a name="l00406"></a>00406 const unsigned distance[BPC][BPC],

434

<a name="l00407"></a>00407 unsigned char* pc_vector)

435

<a name="l00408"></a>00408 {

436

<a name="l00409"></a>00409 <a class="code" href="a00089.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(pc_vector);

437

<a name="l00410"></a>00410

438

<a name="l00411"></a>00411 for (unsigned i = 0; i < BPC; ++i)

439

<a name="l00412"></a>00412 {

440

<a name="l00413"></a>00413 unsigned char pc = <a class="code" href="a00110.html#ae34de9206be7a8aa05db9d5dc38bfc90">ibpc_uncompr</a>;

441

<a name="l00414"></a>00414 unsigned row_bitcount = distance[i][i];

442

<a name="l00415"></a>00415

443

<a name="l00416"></a>00416 switch (row_bitcount)

444

<a name="l00417"></a>00417 {

445

<a name="l00418"></a>00418 case 0:

446

<a name="l00419"></a>00419 pc_vector[i] = <a class="code" href="a00110.html#aaca6d3c887b5b7b66a78e95471f9a326" title="!&lt; plain uncompressed">ibpc_all_zero</a>;

447

<a name="l00420"></a>00420 continue;

448

<a name="l00421"></a>00421 case sizeof(T)*8*BPS:

449

<a name="l00422"></a>00422 pc_vector[i] = <a class="code" href="a00110.html#aa6f59be0b838db693e0f081bcaf750f0" title="!&lt; plain ALL ZERO">ibpc_all_one</a>;

450

<a name="l00423"></a>00423 continue;

451

<a name="l00424"></a>00424 }

452

<a name="l00425"></a>00425

453

<a name="l00426"></a>00426 // scan for the closest neighbor

454

<a name="l00427"></a>00427 //

455

<a name="l00428"></a>00428 unsigned rmin = ~0;

456

<a name="l00429"></a>00429 unsigned rmin_idx = 0;

457

<a name="l00430"></a>00430 for (unsigned j = i + 1; j < BPC; ++j)

458

<a name="l00431"></a>00431 {

459

<a name="l00432"></a>00432 unsigned d = distance[i][j];

460

<a name="l00433"></a>00433 if (d < rmin) // new minimum - closest plain

461

<a name="l00434"></a>00434 {

462

<a name="l00435"></a>00435 if (d == 0) // plain is complete duplicate of j

463

<a name="l00436"></a>00436 {

464

<a name="l00437"></a>00437 pc = <a class="code" href="a00110.html#a748d4095c39c9372a590b431e0ec17fe" title="!&lt; plain ALL ONE">ibpc_equiv</a> | (j << 3);

465

<a name="l00438"></a>00438 break;

466

<a name="l00439"></a>00439 }

467

<a name="l00440"></a>00440 rmin = d; rmin_idx = j;

468

<a name="l00441"></a>00441 }

469

<a name="l00442"></a>00442 } // for j

470

<a name="l00443"></a>00443

471

<a name="l00444"></a>00444 if ((pc == 0) && rmin_idx && (rmin < row_bitcount)) // neighbor found

472

<a name="l00445"></a>00445 {

473

<a name="l00446"></a>00446 pc = <a class="code" href="a00110.html#aa61bf7691d32a9bc7c65c05bb62657e5" title="!&lt; plain is equal to plain M">ibpc_close</a> | (rmin_idx << 3);

474

<a name="l00447"></a>00447 }

475

<a name="l00448"></a>00448 pc_vector[i] = pc;

476

<a name="l00449"></a>00449 } // for i

477

<a name="l00450"></a>00450 }

478

<a name="l00451"></a>00451

479

<a name="l00452"></a>00452

480

<a name="l00453"></a>00453 /*!

481

<a name="l00454"></a>00454 \brief Compute number of ibpc codes in pc_vector

482

<a name="l00455"></a>00455 */

483

<a name="l00456"></a>00456 inline

484

<a name="l00457"></a><a class="code" href="a00110.html#adfae226f696ef821c7d351216c00fe0d">00457</a> void <a class="code" href="a00110.html#adfae226f696ef821c7d351216c00fe0d" title="Compute number of ibpc codes in pc_vector.">bit_iblock_pcv_stat</a>(const unsigned char* BMRESTRICT pc_vector,

485

<a name="l00458"></a>00458 const unsigned char* BMRESTRICT pc_vector_end,

486

<a name="l00459"></a>00459 unsigned* BMRESTRICT pc_vector_stat

487

<a name="l00460"></a>00460 )

488

<a name="l00461"></a>00461 {

489

<a name="l00462"></a>00462 <a class="code" href="a00089.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(pc_vector_stat);

490

<a name="l00463"></a>00463 // pc_vector_stat MUST be assigned to 0 before

491

<a name="l00464"></a>00464 do

492

<a name="l00465"></a>00465 {

493

<a name="l00466"></a>00466 unsigned ibpc = *pc_vector & 7;

494

<a name="l00467"></a>00467 ++(pc_vector_stat[ibpc]);

495

<a name="l00468"></a>00468 } while (++pc_vector < pc_vector_end);

496

<a name="l00469"></a>00469 }

497

<a name="l00470"></a>00470

498

<a name="l00471"></a>00471

499

<a name="l00472"></a>00472

500

<a name="l00473"></a>00473

501

<a name="l00474"></a>00474 /**

502

<a name="l00475"></a>00475 \brief Matrix reduction based on transformation pc vector

503

<a name="l00476"></a>00476 */

504

<a name="l00477"></a>00477 inline

505

<a name="l00478"></a><a class="code" href="a00110.html#a62808b64adfcf2a7e610a4f713f470c0">00478</a> void <a class="code" href="a00110.html#a62808b64adfcf2a7e610a4f713f470c0" title="Matrix reduction based on transformation pc vector.">bit_iblock_reduce</a>(

506

<a name="l00479"></a>00479 const unsigned <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[<a class="code" href="a00110.html#a3428cf384446982017ba9ee68152d238">bm::set_block_plain_cnt</a>][<a class="code" href="a00110.html#a35780565f6d8f2831ebff8877d3ba662">bm::set_block_plain_size</a>],

507

<a name="l00480"></a>00480 const unsigned char* BMRESTRICT pc_vector,

508

<a name="l00481"></a>00481 const unsigned char* BMRESTRICT pc_vector_end,

509

<a name="l00482"></a>00482 unsigned tmatrix_out[<a class="code" href="a00110.html#a3428cf384446982017ba9ee68152d238">bm::set_block_plain_cnt</a>][bm::set_block_plain_size])

510

<a name="l00483"></a>00483 {

511

<a name="l00484"></a>00484 ::memset(tmatrix_out, 0, sizeof(tmatrix_out));

512

<a name="l00485"></a>00485

513

<a name="l00486"></a>00486 unsigned row = 0;

514

<a name="l00487"></a>00487 do

515

<a name="l00488"></a>00488 {

516

<a name="l00489"></a>00489 unsigned ibpc = *pc_vector & 7;

517

<a name="l00490"></a>00490 unsigned n_row = (pc_vector[row] >> 3);

518

<a name="l00491"></a>00491

519

<a name="l00492"></a>00492 switch(ibpc)

520

<a name="l00493"></a>00493 {

521

<a name="l00494"></a>00494 case <a class="code" href="a00110.html#ae34de9206be7a8aa05db9d5dc38bfc90">bm::ibpc_uncompr</a>:

522

<a name="l00495"></a>00495 {

523

<a name="l00496"></a>00496 const unsigned* r1 = <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[row];

524

<a name="l00497"></a>00497 unsigned* r_out = tmatrix_out[row];

525

<a name="l00498"></a>00498 for (unsigned i = 0; i < bm::set_block_plain_size; ++i)

526

<a name="l00499"></a>00499 {

527

<a name="l00500"></a>00500 r_out[i] = r1[i];

528

<a name="l00501"></a>00501 }

529

<a name="l00502"></a>00502 }

530

<a name="l00503"></a>00503 break;

531

<a name="l00504"></a>00504 case <a class="code" href="a00110.html#aaca6d3c887b5b7b66a78e95471f9a326" title="!&lt; plain uncompressed">bm::ibpc_all_zero</a>:

532

<a name="l00505"></a>00505 break;

533

<a name="l00506"></a>00506 case <a class="code" href="a00110.html#aa6f59be0b838db693e0f081bcaf750f0" title="!&lt; plain ALL ZERO">bm::ibpc_all_one</a>:

534

<a name="l00507"></a>00507 break;

535

<a name="l00508"></a>00508 case <a class="code" href="a00110.html#a748d4095c39c9372a590b431e0ec17fe" title="!&lt; plain ALL ONE">bm::ibpc_equiv</a>:

536

<a name="l00509"></a>00509 break;

537

<a name="l00510"></a>00510 case <a class="code" href="a00110.html#aa61bf7691d32a9bc7c65c05bb62657e5" title="!&lt; plain is equal to plain M">bm::ibpc_close</a>:

538

<a name="l00511"></a>00511 {

539

<a name="l00512"></a>00512 const unsigned* r1 = <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[row];

540

<a name="l00513"></a>00513 const unsigned* r2 = <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>[n_row];

541

<a name="l00514"></a>00514 unsigned* r_out = tmatrix_out[row];

542

<a name="l00515"></a>00515 for (unsigned i = 0; i < bm::set_block_plain_size; ++i)

543

<a name="l00516"></a>00516 {

544

<a name="l00517"></a>00517 r_out[i] = r1[i] ^ r2[i];

545

<a name="l00518"></a>00518 } // for

546

<a name="l00519"></a>00519 }

547

<a name="l00520"></a>00520 break;

548

<a name="l00521"></a>00521 default:

549

<a name="l00522"></a>00522 <a class="code" href="a00089.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

550

<a name="l00523"></a>00523 break;

551

<a name="l00524"></a>00524 } // switch

552

<a name="l00525"></a>00525 ++row;

553

<a name="l00526"></a>00526 } while (++pc_vector < pc_vector_end);

554

<a name="l00527"></a>00527

555

<a name="l00528"></a>00528 }

556

<a name="l00529"></a>00529

557

<a name="l00530"></a>00530 /**

558

<a name="l00531"></a>00531 \brief Copy GAP block body to bit block with DGap transformation

559

<a name="l00532"></a>00532 \internal

560

<a name="l00533"></a>00533 */

561

<a name="l00534"></a>00534 template<typename GT, typename BT>

562

<a name="l00535"></a><a class="code" href="a00110.html#a76724fb233f93c15146641482311ce28">00535</a> void <a class="code" href="a00110.html#a76724fb233f93c15146641482311ce28" title="Copy GAP block body to bit block with DGap transformation.">gap_2_bitblock</a>(const GT* BMRESTRICT gap_buf,

563

<a name="l00536"></a>00536 BT* BMRESTRICT block,

564

<a name="l00537"></a>00537 unsigned block_size)

565

<a name="l00538"></a>00538 {

566

<a name="l00539"></a>00539 GT* dgap_buf = (GT*) block;

567

<a name="l00540"></a>00540 BT* block_end = block + block_size;

568

<a name="l00541"></a>00541

569

<a name="l00542"></a>00542 GT* dgap_end = gap_2_dgap<GT>(gap_buf, dgap_buf, false);

570

<a name="l00543"></a>00543 GT* block_end2 = (GT*) block_end;

571

<a name="l00544"></a>00544

572

<a name="l00545"></a>00545 // zero the tail memory

573

<a name="l00546"></a>00546 for ( ;dgap_end < block_end2; ++dgap_end)

574

<a name="l00547"></a>00547 {

575

<a name="l00548"></a>00548 *dgap_end = 0;

576

<a name="l00549"></a>00549 }

577

<a name="l00550"></a>00550 }

578

<a name="l00551"></a>00551

579

<a name="l00552"></a>00552 /**

580

<a name="l00553"></a>00553 \brief Compute effective right column border of the t-matrix

581

<a name="l00554"></a>00554 \internal

582

<a name="l00555"></a>00555 */

583

<a name="l00556"></a>00556 template<typename TM>

584

<a name="l00557"></a><a class="code" href="a00110.html#af92597461aff2926f9adcbf51bac98f9">00557</a> unsigned <a class="code" href="a00110.html#af92597461aff2926f9adcbf51bac98f9" title="Compute effective right column border of the t-matrix.">find_effective_columns</a>(const TM& <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a>)

585

<a name="l00558"></a>00558 {

586

<a name="l00559"></a>00559 // TODO: need optimization in order not to scan the whole space

587

<a name="l00560"></a>00560 unsigned col = 1;

588

<a name="l00561"></a>00561 for (unsigned i = 0; i < tmatrix.rows(); ++i)

358

<a name="l00331"></a>00331 template<class DEC>

359

<a name="l00332"></a><a class="code" href="a00082.html">00332</a> class <a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator</a> : protected <a class="code" href="a00058.html" title="Base deserialization class.">deseriaizer_base</a><DEC>

360

<a name="l00333"></a>00333 {

361

<a name="l00334"></a>00334 public:

362

<a name="l00335"></a><a class="code" href="a00082.html#a195c435365f734b2b5b30f432e019cf5">00335</a> typedef typename <a class="code" href="a00058.html" title="Base deserialization class.">deseriaizer_base<DEC>::decoder_type</a> <a class="code" href="a00082.html#a195c435365f734b2b5b30f432e019cf5">decoder_type</a>;

363

<a name="l00336"></a>00336 public:

364

<a name="l00337"></a>00337 <a class="code" href="a00082.html#a9e501a75575380ecc06eef5b16f6803e">serial_stream_iterator</a>(const unsigned char* buf);

365

<a name="l00338"></a>00338

366

<a name="l00339"></a>00339 /// serialized bitvector size

367

<a name="l00340"></a><a class="code" href="a00082.html#a851ee69e0a91cac8bdb9d26862e6aca0">00340</a> unsigned <a class="code" href="a00082.html#a851ee69e0a91cac8bdb9d26862e6aca0" title="serialized bitvector size">bv_size</a>() const { return <a class="code" href="a00082.html#ac072ca059c8daba51bd31e58163e70d9">bv_size_</a>; }

368

<a name="l00341"></a>00341

369

<a name="l00342"></a>00342 /// Returns true if end of bit-stream reached

370

<a name="l00343"></a><a class="code" href="a00082.html#a936d9d1b031285de6212afc3980ac1d9">00343</a> bool <a class="code" href="a00082.html#a936d9d1b031285de6212afc3980ac1d9" title="Returns true if end of bit-stream reached.">is_eof</a>() const { return <a class="code" href="a00082.html#a215d5acc44c43872067e66c954d39b77">end_of_stream_</a>; }

371

<a name="l00344"></a>00344

372

<a name="l00345"></a>00345 /// get next block

373

<a name="l00346"></a>00346 void <a class="code" href="a00082.html#a3bc99255525bf5f7234de9f60a7306fe" title="get next block">next</a>();

374

<a name="l00347"></a>00347

375

<a name="l00348"></a>00348 /// read bit block, using logical operation

376

<a name="l00349"></a>00349 unsigned <a class="code" href="a00082.html#a75db44dcddb04e8c3217f0f43f1c9e9b" title="read bit block, using logical operation">get_bit_block</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

377

<a name="l00350"></a>00350 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block,

378

<a name="l00351"></a>00351 <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109" title="Nomenclature of set operations.">set_operation</a> op);

379

<a name="l00352"></a>00352

380

<a name="l00353"></a>00353

381

<a name="l00354"></a>00354 /// Read gap block data (with head)

382

<a name="l00355"></a>00355 void <a class="code" href="a00082.html#a65bfdd6a50b71e6839d3f9b055b85814" title="Read gap block data (with head).">get_gap_block</a>(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* dst_block);

383

<a name="l00356"></a>00356

384

<a name="l00357"></a>00357 /// Return current decoder size

385

<a name="l00358"></a><a class="code" href="a00082.html#a3bad346b9b55d092122f5ecae585e2de">00358</a> unsigned <a class="code" href="a00082.html#a3bad346b9b55d092122f5ecae585e2de" title="Return current decoder size.">dec_size</a>() const { return <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.size(); }

386

<a name="l00359"></a>00359

387

<a name="l00360"></a>00360 /// Get low level access to the decoder (use carefully)

388

<a name="l00361"></a><a class="code" href="a00082.html#a252a217d287ea2c406075dc1bc094097">00361</a> <a class="code" href="a00082.html#a195c435365f734b2b5b30f432e019cf5">decoder_type</a>& <a class="code" href="a00082.html#a252a217d287ea2c406075dc1bc094097" title="Get low level access to the decoder (use carefully).">decoder</a>() { return <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>; }

389

<a name="l00362"></a>00362

390

<a name="l00363"></a>00363 /// iterator is a state machine, this enum encodes

391

<a name="l00364"></a>00364 /// its key value

392

<a name="l00365"></a>00365 ///

393

<a name="l00366"></a><a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969d">00366</a> enum <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969d" title="iterator is a state machine, this enum encodes its key value">iterator_state</a>

394

<a name="l00367"></a>00367 {

395

<a name="l00368"></a><a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dacdf6d77d700b98e0f7ef675ac7cf7472">00368</a> <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dacdf6d77d700b98e0f7ef675ac7cf7472">e_unknown</a> = 0,

396

<a name="l00369"></a><a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab6ede49403e43a05b42471f52ba5aa6a">00369</a> <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab6ede49403e43a05b42471f52ba5aa6a" title="plain int array">e_list_ids</a>, ///< plain int array

397

<a name="l00370"></a><a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969daacf85c8ad242bcce343b482ea6e005b9">00370</a> <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969daacf85c8ad242bcce343b482ea6e005b9" title="stream of blocks">e_blocks</a>, ///< stream of blocks

398

<a name="l00371"></a><a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab46381e6794e6c0140563a03f8adf74b">00371</a> <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab46381e6794e6c0140563a03f8adf74b" title="one or more zero bit blocks">e_zero_blocks</a>, ///< one or more zero bit blocks

399

<a name="l00372"></a><a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da7c1327cbc332f6d7fe96fc1dbed7da30">00372</a> <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da7c1327cbc332f6d7fe96fc1dbed7da30" title="one or more all-1 bit blocks">e_one_blocks</a>, ///< one or more all-1 bit blocks

400

<a name="l00373"></a><a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60">00373</a> <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>, ///< one bit block

401

<a name="l00374"></a><a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da6b1a1c20945bd0813ceae6d689591d0d">00374</a> <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da6b1a1c20945bd0813ceae6d689591d0d" title="one gap block">e_gap_block</a> ///< one gap block

402

<a name="l00375"></a>00375

403

<a name="l00376"></a>00376 };

404

<a name="l00377"></a>00377

405

<a name="l00378"></a>00378 /// Returns iterator internal state

406

<a name="l00379"></a><a class="code" href="a00082.html#a321de67e525d3902c2b94a7fb73c6951">00379</a> <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969d" title="iterator is a state machine, this enum encodes its key value">iterator_state</a> <a class="code" href="a00082.html#a321de67e525d3902c2b94a7fb73c6951" title="Returns iterator internal state.">state</a>() const { return this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a>; }

407

<a name="l00380"></a>00380

408

<a name="l00381"></a><a class="code" href="a00082.html#ad3e546c96965ceaefda059b4527e443c">00381</a> <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969d" title="iterator is a state machine, this enum encodes its key value">iterator_state</a> <a class="code" href="a00082.html#ad3e546c96965ceaefda059b4527e443c">get_state</a>() const { return this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a>; }

409

<a name="l00382"></a>00382 /// Number of ids in the inverted list (valid for e_list_ids)

410

<a name="l00383"></a><a class="code" href="a00082.html#a0f454b2b83d511307f460ab15b1d1b49">00383</a> unsigned <a class="code" href="a00082.html#a0f454b2b83d511307f460ab15b1d1b49" title="Number of ids in the inverted list (valid for e_list_ids).">get_id_count</a>() const { return this-><a class="code" href="a00082.html#a51489bf49b30c51c655dac89edc747f9" title="Id counter for id list.">id_cnt_</a>; }

411

<a name="l00384"></a>00384

412

<a name="l00385"></a>00385 /// Get last id from the id list

413

<a name="l00386"></a><a class="code" href="a00082.html#ac68381733bad5639ec2b44231db17080">00386</a> <a class="code" href="a00115.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00082.html#ac68381733bad5639ec2b44231db17080" title="Get last id from the id list.">get_id</a>() const { return this-><a class="code" href="a00082.html#ac93130d81ed3ffa16a4ce52d2060bc14" title="Last id from the id list.">last_id_</a>; }

414

<a name="l00387"></a>00387

415

<a name="l00388"></a>00388 /// Get current block index

416

<a name="l00389"></a><a class="code" href="a00082.html#a6e94114394a0615b185ac45c7ed12c42">00389</a> unsigned <a class="code" href="a00082.html#a6e94114394a0615b185ac45c7ed12c42" title="Get current block index.">block_idx</a>() const { return this-><a class="code" href="a00082.html#a885a7eea86b5ac64196a1ed0804ae608" title="current block index">block_idx_</a>; }

417

<a name="l00390"></a>00390

418

<a name="l00391"></a>00391 public:

419

<a name="l00392"></a>00392 /// member function pointer for bitset-bitset get operations

420

<a name="l00393"></a>00393 ///

421

<a name="l00394"></a>00394 typedef

422

<a name="l00395"></a>00395 unsigned (<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC></a>::*<a class="code" href="a00082.html#a3bf4a7b338d663d93bf14f14967491e2" title="member function pointer for bitset-bitset get operations">get_bit_func_type</a>)

423

<a name="l00396"></a><a class="code" href="a00082.html#a3bf4a7b338d663d93bf14f14967491e2">00396</a> (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*,<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*);

424

<a name="l00397"></a>00397

425

<a name="l00398"></a>00398 unsigned

426

<a name="l00399"></a>00399 <a class="code" href="a00082.html#aedd6dd2b98c7a95874d36fa898c22e2e">get_bit_block_ASSIGN</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

427

<a name="l00400"></a>00400 unsigned

428

<a name="l00401"></a>00401 <a class="code" href="a00082.html#a8090cd3fd801c9daafb2b2488419ca3b">get_bit_block_OR</a> (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

429

<a name="l00402"></a>00402 unsigned

430

<a name="l00403"></a>00403 <a class="code" href="a00082.html#aaff6b770723d70a5d7f4da8a3d6b1658">get_bit_block_AND</a> (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

431

<a name="l00404"></a>00404 unsigned

432

<a name="l00405"></a>00405 <a class="code" href="a00082.html#a22bac3f98b0c07cf3a2f6aa6fa1e0322">get_bit_block_SUB</a> (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

433

<a name="l00406"></a>00406 unsigned

434

<a name="l00407"></a>00407 <a class="code" href="a00082.html#a16cc519db4297666ea520d68769b5aa1">get_bit_block_XOR</a> (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

435

<a name="l00408"></a>00408 unsigned

436

<a name="l00409"></a>00409 <a class="code" href="a00082.html#ae09d0beacb2836739852c6109a436389">get_bit_block_COUNT</a> (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

437

<a name="l00410"></a>00410 unsigned

438

<a name="l00411"></a>00411 <a class="code" href="a00082.html#aefceb87b5d3317cc326cac36b3f772db">get_bit_block_COUNT_AND</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

439

<a name="l00412"></a>00412 unsigned

440

<a name="l00413"></a>00413 <a class="code" href="a00082.html#a698956699333fa2171b2163dd95efffb">get_bit_block_COUNT_OR</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

441

<a name="l00414"></a>00414 unsigned

442

<a name="l00415"></a>00415 <a class="code" href="a00082.html#a7278346245b35066c85aabafccaa15ff">get_bit_block_COUNT_XOR</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

443

<a name="l00416"></a>00416 unsigned

444

<a name="l00417"></a>00417 <a class="code" href="a00082.html#a56f17aa09aae0b387f82abcaf9ccb781">get_bit_block_COUNT_SUB_AB</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

445

<a name="l00418"></a>00418 unsigned

446

<a name="l00419"></a>00419 <a class="code" href="a00082.html#a6cc7a6d70c3ec0f3f84f3e3fe8d6a5c7">get_bit_block_COUNT_SUB_BA</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

447

<a name="l00420"></a>00420 unsigned

448

<a name="l00421"></a>00421 <a class="code" href="a00082.html#a66b565ecbc6048c42338ef993a2b754e">get_bit_block_COUNT_A</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block);

449

<a name="l00422"></a>00422 unsigned

450

<a name="l00423"></a><a class="code" href="a00082.html#a8ee8ac211834af1c98f4a51b8fc78e58">00423</a> <a class="code" href="a00082.html#a8ee8ac211834af1c98f4a51b8fc78e58">get_bit_block_COUNT_B</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block, <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block)

451

<a name="l00424"></a>00424 {

452

<a name="l00425"></a>00425 return <a class="code" href="a00082.html#ae09d0beacb2836739852c6109a436389">get_bit_block_COUNT</a>(dst_block, tmp_block);

453

<a name="l00426"></a>00426 }

454

<a name="l00427"></a>00427

455

<a name="l00428"></a>00428 /// Get array of bits out of the decoder into bit block

456

<a name="l00429"></a>00429 /// (Converts inverted list into bits)

457

<a name="l00430"></a>00430 /// Returns number of words (bits) being read

458

<a name="l00431"></a>00431 unsigned <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

459

<a name="l00432"></a>00432 bool clear_target=true);

460

<a name="l00433"></a>00433

461

<a name="l00434"></a>00434 protected:

462

<a name="l00435"></a><a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">00435</a> <a class="code" href="a00082.html#a3bf4a7b338d663d93bf14f14967491e2" title="member function pointer for bitset-bitset get operations">get_bit_func_type</a> <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109ad894d257a23664720dbf4155153a1e5c">bm::set_END</a>];

463

<a name="l00436"></a>00436

464

<a name="l00437"></a><a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">00437</a> <a class="code" href="a00082.html#a195c435365f734b2b5b30f432e019cf5">decoder_type</a> <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>;

465

<a name="l00438"></a><a class="code" href="a00082.html#a215d5acc44c43872067e66c954d39b77">00438</a> bool <a class="code" href="a00082.html#a215d5acc44c43872067e66c954d39b77">end_of_stream_</a>;

466

<a name="l00439"></a><a class="code" href="a00082.html#ac072ca059c8daba51bd31e58163e70d9">00439</a> unsigned <a class="code" href="a00082.html#ac072ca059c8daba51bd31e58163e70d9">bv_size_</a>;

467

<a name="l00440"></a><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">00440</a> <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969d" title="iterator is a state machine, this enum encodes its key value">iterator_state</a> <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a>;

468

<a name="l00441"></a><a class="code" href="a00082.html#a51489bf49b30c51c655dac89edc747f9">00441</a> unsigned <a class="code" href="a00082.html#a51489bf49b30c51c655dac89edc747f9" title="Id counter for id list.">id_cnt_</a>; ///< Id counter for id list

469

<a name="l00442"></a><a class="code" href="a00082.html#ac93130d81ed3ffa16a4ce52d2060bc14">00442</a> <a class="code" href="a00115.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00082.html#ac93130d81ed3ffa16a4ce52d2060bc14" title="Last id from the id list.">last_id_</a>; ///< Last id from the id list

470

<a name="l00443"></a><a class="code" href="a00082.html#a8766613e7480049708773baa227c36a4">00443</a> <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> <a class="code" href="a00082.html#a8766613e7480049708773baa227c36a4" title="GAP levels.">glevels_</a>[<a class="code" href="a00115.html#a773e9f5341919d58000bd54d50038733">bm::gap_levels</a>]; ///< GAP levels

471

<a name="l00444"></a>00444

472

<a name="l00445"></a><a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76">00445</a> unsigned <a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>; ///< current block type

473

<a name="l00446"></a><a class="code" href="a00082.html#a885a7eea86b5ac64196a1ed0804ae608">00446</a> unsigned <a class="code" href="a00082.html#a885a7eea86b5ac64196a1ed0804ae608" title="current block index">block_idx_</a>; ///< current block index

474

<a name="l00447"></a><a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12">00447</a> unsigned <a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a>; ///< number of 0 or 1 blocks

475

<a name="l00448"></a>00448

476

<a name="l00449"></a><a class="code" href="a00082.html#a5b7762f08b50525283c45531d9538f4f">00449</a> <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> <a class="code" href="a00082.html#a5b7762f08b50525283c45531d9538f4f">gap_head_</a>;

477

<a name="l00450"></a>00450 };

478

<a name="l00451"></a>00451

479

<a name="l00452"></a>00452 /**

480

<a name="l00453"></a>00453 Class deserializer, can perform logical operation on bit-vector and

481

<a name="l00454"></a>00454 serialized bit-vector.

482

<a name="l00455"></a>00455

483

<a name="l00456"></a>00456 \ingroup bvserial

484

<a name="l00457"></a>00457 */

485

<a name="l00458"></a>00458 template<class BV>

486

<a name="l00459"></a><a class="code" href="a00076.html">00459</a> class <a class="code" href="a00076.html" title="Class deserializer, can perform logical operation on bit-vector and serialized bit-vector...">operation_deserializer</a>

487

<a name="l00460"></a>00460 {

488

<a name="l00461"></a>00461 public:

489

<a name="l00462"></a><a class="code" href="a00076.html#a1be10a9481e4f86a7906a827aeae76c3">00462</a> typedef BV <a class="code" href="a00076.html#a1be10a9481e4f86a7906a827aeae76c3">bvector_type</a>;

490

<a name="l00463"></a>00463 public:

491

<a name="l00464"></a>00464 static

492

<a name="l00465"></a>00465 unsigned <a class="code" href="a00076.html#aa2af1e50d6a0a0ddae72b5b0888f3e6f">deserialize</a>(<a class="code" href="a00076.html#a1be10a9481e4f86a7906a827aeae76c3">bvector_type</a>& bv,

493

<a name="l00466"></a>00466 const unsigned char* buf,

494

<a name="l00467"></a>00467 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_block,

495

<a name="l00468"></a>00468 <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109" title="Nomenclature of set operations.">set_operation</a> op = <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a05d88a2639cbd3d2ac63436df3ed6780">bm::set_OR</a>);

496

<a name="l00469"></a>00469 private:

497

<a name="l00470"></a>00470 typedef

498

<a name="l00471"></a>00471 typename BV::blocks_manager_type blocks_manager_type;

499

<a name="l00472"></a>00472 typedef

500

<a name="l00473"></a>00473 <a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<bm::decoder></a> <a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_current</a>;

501

<a name="l00474"></a>00474 typedef

502

<a name="l00475"></a>00475 <a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<bm::decoder_big_endian></a> <a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_be</a>;

503

<a name="l00476"></a>00476 typedef

504

<a name="l00477"></a>00477 <a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<bm::decoder_little_endian></a> <a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_le</a>;

505

<a name="l00478"></a>00478

506

<a name="l00479"></a>00479 };

507

<a name="l00480"></a>00480

508

<a name="l00481"></a>00481

509

<a name="l00482"></a>00482

510

<a name="l00483"></a>00483

511

<a name="l00484"></a>00484

512

<a name="l00485"></a>00485 //---------------------------------------------------------------------

513

<a name="l00486"></a>00486

514

<a name="l00487"></a>00487 template<class BV>

515

<a name="l00488"></a><a class="code" href="a00083.html#a49b063cc7e0d53b8875f893bff37c7fa">00488</a> <a class="code" href="a00083.html#a49b063cc7e0d53b8875f893bff37c7fa">serializer<BV>::serializer</a>(const allocator_type& alloc)

516

<a name="l00489"></a>00489 : alloc_(alloc),

517

<a name="l00490"></a>00490 gap_serial_(false),

518

<a name="l00491"></a>00491 byte_order_serial_(true),

519

<a name="l00492"></a>00492 temp_block_(0),

520

<a name="l00493"></a>00493 compression_level_(3)

521

<a name="l00494"></a>00494 {

522

<a name="l00495"></a>00495 temp_block_ = alloc_.alloc_bit_block();

523

<a name="l00496"></a>00496 }

524

<a name="l00497"></a>00497

525

<a name="l00498"></a>00498 template<class BV>

526

<a name="l00499"></a><a class="code" href="a00083.html#ad433d790f07103d39c5f15a6caaf2823">00499</a> void <a class="code" href="a00083.html#ad433d790f07103d39c5f15a6caaf2823" title="Set compression level.">serializer<BV>::set_compression_level</a>(unsigned clevel)

527

<a name="l00500"></a>00500 {

528

<a name="l00501"></a>00501 compression_level_ = clevel;

529

<a name="l00502"></a>00502 }

530

<a name="l00503"></a>00503

531

<a name="l00504"></a>00504 template<class BV>

532

<a name="l00505"></a><a class="code" href="a00083.html#ada73fe9103470fc726968cd0e8dbe04f">00505</a> unsigned <a class="code" href="a00083.html#ada73fe9103470fc726968cd0e8dbe04f" title="Get compression level.">serializer<BV>::get_compression_level</a>() const

533

<a name="l00506"></a>00506 {

534

<a name="l00507"></a>00507 return compression_level_;

535

<a name="l00508"></a>00508 }

536

<a name="l00509"></a>00509

537

<a name="l00510"></a>00510 template<class BV>

538

<a name="l00511"></a><a class="code" href="a00083.html#a6cb13dcbfb820fc7e90a959937f2f461">00511</a> <a class="code" href="a00083.html#a6cb13dcbfb820fc7e90a959937f2f461">serializer<BV>::~serializer</a>()

539

<a name="l00512"></a>00512 {

540

<a name="l00513"></a>00513 alloc_.free_bit_block(temp_block_);

541

<a name="l00514"></a>00514 }

542

<a name="l00515"></a>00515

543

<a name="l00516"></a>00516

544

<a name="l00517"></a>00517 template<class BV>

545

<a name="l00518"></a><a class="code" href="a00083.html#a5b19026c2e928c639f09da4a4e1235ab">00518</a> void <a class="code" href="a00083.html#a5b19026c2e928c639f09da4a4e1235ab" title="Set GAP length serialization (serializes GAP levels of the original vector).">serializer<BV>::gap_length_serialization</a>(bool value)

546

<a name="l00519"></a>00519 {

547

<a name="l00520"></a>00520 gap_serial_ = value;

548

<a name="l00521"></a>00521 }

549

<a name="l00522"></a>00522

550

<a name="l00523"></a>00523 template<class BV>

551

<a name="l00524"></a><a class="code" href="a00083.html#a892b124d42bb939485e47d197b8dc1ac">00524</a> void <a class="code" href="a00083.html#a892b124d42bb939485e47d197b8dc1ac" title="Set byte-order serialization (for cross platform compatibility).">serializer<BV>::byte_order_serialization</a>(bool value)

552

<a name="l00525"></a>00525 {

553

<a name="l00526"></a>00526 byte_order_serial_ = value;

554

<a name="l00527"></a>00527 }

555

<a name="l00528"></a>00528

556

<a name="l00529"></a>00529 template<class BV>

557

<a name="l00530"></a><a class="code" href="a00083.html#a341d5819f2f1164172f4c0c4771ec941">00530</a> void <a class="code" href="a00083.html#a341d5819f2f1164172f4c0c4771ec941" title="Encode serialization header information.">serializer<BV>::encode_header</a>(const BV& bv, <a class="code" href="a00062.html" title="Memory encoding.">bm::encoder</a>& enc)

558

<a name="l00531"></a>00531 {

559

<a name="l00532"></a>00532 const <a class="code" href="a00083.html#a33209dcd954f9cadff5a3379108d84e0">blocks_manager_type</a>& bman = bv.get_blocks_manager();

560

<a name="l00533"></a>00533

561

<a name="l00534"></a>00534 unsigned char header_flag = 0;

562

<a name="l00535"></a>00535 if (bv.size() == <a class="code" href="a00115.html#a104b924a1df81542db2a6296fbf26a65">bm::id_max</a>) // no dynamic resize

563

<a name="l00536"></a>00536 header_flag |= <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a97434d6617bb5f0d6f3bf44491f712ca">BM_HM_DEFAULT</a>;

564

<a name="l00537"></a>00537 else

565

<a name="l00538"></a>00538 header_flag |= <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0af4fbefa0ed0a8ff42dd664f120782c27" title="resized vector">BM_HM_RESIZE</a>;

566

<a name="l00539"></a>00539

567

<a name="l00540"></a>00540 if (!byte_order_serial_)

568

<a name="l00541"></a>00541 header_flag |= <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a6b127bde401907318702dd4827c8f74e" title="no byte-order">BM_HM_NO_BO</a>;

569

<a name="l00542"></a>00542

570

<a name="l00543"></a>00543 if (!gap_serial_)

571

<a name="l00544"></a>00544 header_flag |= <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a04c714af376c203bc8b082856ad622a3" title="no GAP levels">BM_HM_NO_GAPL</a>;

572

<a name="l00545"></a>00545

573

<a name="l00546"></a>00546 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>(header_flag);

574

<a name="l00547"></a>00547

575

<a name="l00548"></a>00548 if (byte_order_serial_)

576

<a name="l00549"></a>00549 {

577

<a name="l00550"></a>00550 <a class="code" href="a00115.html#a577905b348676c2bc556b51793350dbb" title="Byte orders recognized by the library.">ByteOrder</a> bo = <a class="code" href="a00070.html" title="Internal structure.">globals<true>::byte_order</a>();

578

<a name="l00551"></a>00551 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>((unsigned char)bo);

579

<a name="l00552"></a>00552 }

580

<a name="l00553"></a>00553

581

<a name="l00554"></a>00554 // keep GAP levels information

582

<a name="l00555"></a>00555 if (gap_serial_)

583

<a name="l00556"></a>00556 {

584

<a name="l00557"></a>00557 enc.<a class="code" href="a00062.html#a9ff98e99d5c3e4d9e48fd7ecf7d2666e" title="Puts short word (16 bits) into the encoding buffer.">put_16</a>(bman.glen(), <a class="code" href="a00115.html#a773e9f5341919d58000bd54d50038733">bm::gap_levels</a>);

585

<a name="l00558"></a>00558 }

586

<a name="l00559"></a>00559

587

<a name="l00560"></a>00560 // save size (only if bvector has been down-sized)

588

<a name="l00561"></a>00561 if (header_flag & <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0af4fbefa0ed0a8ff42dd664f120782c27" title="resized vector">BM_HM_RESIZE</a>)

589

<a name="l00562"></a>00562 {

590

<a name="l00563"></a>00563 const typename TM::value_type* row = tmatrix.value[i];

591

<a name="l00564"></a>00564 for (unsigned j = 0; j < tmatrix.cols(); ++j)

592

<a name="l00565"></a>00565 {

593

<a name="l00566"></a>00566 if (row[j] != 0 && j > col)

594

<a name="l00567"></a>00567 {

595

<a name="l00568"></a>00568 col = j;

596

<a name="l00569"></a>00569 }

597

<a name="l00570"></a>00570 }

598

<a name="l00571"></a>00571 }

599

<a name="l00572"></a>00572 return col;

600

<a name="l00573"></a>00573 }

601

<a name="l00574"></a>00574

602

<a name="l00575"></a>00575 /**

603

<a name="l00576"></a>00576 \brief Bit-plain splicing of a GAP block

604

<a name="l00577"></a>00577

605

<a name="l00578"></a>00578 GT - gap word type

606

<a name="l00579"></a>00579 BT - block word type

607

<a name="l00580"></a>00580 BLOCK_SIZE - bit block size in words (works as a transposition basis)

608

<a name="l00581"></a>00581

609

<a name="l00582"></a>00582 @internal

610

<a name="l00583"></a>00583 */

611

<a name="l00584"></a>00584 template<typename GT, typename BT, unsigned BLOCK_SIZE>

612

<a name="l00585"></a><a class="code" href="a00068.html">00585</a> class <a class="code" href="a00068.html" title="Bit-plain splicing of a GAP block.">gap_transpose_engine</a>

613

<a name="l00586"></a>00586 {

614

<a name="l00587"></a>00587 public:

615

<a name="l00588"></a>00588 /// cryptic calculation of equivalent size for the transpose matrix

616

<a name="l00589"></a>00589 /// based on BLOCK_SIZE and sizeof(GT)(16)

617

<a name="l00590"></a>00590 ///

618

<a name="l00591"></a>00591 /// matrix[size_of_gap*8][(Size_block_in_bytes / size_of_gap) / number_of_planes)]

619

<a name="l00592"></a>00592 typedef

620

<a name="l00593"></a>00593 <a class="code" href="a00083.html" title="Mini-matrix for bit transposition purposes.">tmatrix</a><GT, sizeof(GT)*8,

621

<a name="l00594"></a>00594 (((BLOCK_SIZE * sizeof(unsigned)) / (sizeof(GT))) / (sizeof(GT) * 8))>

622

<a name="l00595"></a><a class="code" href="a00068.html#aebedc43b623e92c51d273654aa437dbb">00595</a> <a class="code" href="a00068.html#aebedc43b623e92c51d273654aa437dbb" title="cryptic calculation of equivalent size for the transpose matrix based on BLOCK_SIZE...">tmatrix_type</a>;

623

<a name="l00596"></a>00596

624

<a name="l00597"></a><a class="code" href="a00068.html#af5cb0321f7461d6c072dd13ac5b77a3a">00597</a> <a class="code" href="a00068.html#af5cb0321f7461d6c072dd13ac5b77a3a">gap_transpose_engine</a>()

625

<a name="l00598"></a>00598 {}

626

<a name="l00599"></a>00599

627

<a name="l00600"></a>00600 /// Transpose GAP block through a temp. block of aligned(!) memory

628

<a name="l00601"></a>00601 ///

629

<a name="l00602"></a><a class="code" href="a00068.html#aa574587865df9a653c25b3b14e52e356">00602</a> void <a class="code" href="a00068.html#aa574587865df9a653c25b3b14e52e356" title="Transpose GAP block through a temp.">transpose</a>(const GT* BMRESTRICT gap_buf,

630

<a name="l00603"></a>00603 BT* BMRESTRICT tmp_block)

631

<a name="l00604"></a>00604 {

632

<a name="l00605"></a>00605 const unsigned plain_count = sizeof(GT)*8;

633

<a name="l00606"></a>00606 const unsigned block_size = BLOCK_SIZE * sizeof(unsigned);

634

<a name="l00607"></a>00607 const unsigned plain_size = block_size / (sizeof(GT) * plain_count);

635

<a name="l00608"></a>00608 const unsigned arr_size = BLOCK_SIZE * sizeof(unsigned) / sizeof(GT);

636

<a name="l00609"></a>00609

637

<a name="l00610"></a>00610 <a class="code" href="a00089.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(sizeof(<a class="code" href="a00068.html#a78bbc8d39f794aa7587363c237153471">tmatrix_</a>.value) == plain_size * plain_count * sizeof(GT));

638

<a name="l00611"></a>00611

639

<a name="l00612"></a>00612 // load all GAP as D-GAP(but not head word) into aligned bit-block

640

<a name="l00613"></a>00613 <a class="code" href="a00110.html#a76724fb233f93c15146641482311ce28" title="Copy GAP block body to bit block with DGap transformation.">gap_2_bitblock</a>(gap_buf, tmp_block, BLOCK_SIZE);

641

<a name="l00614"></a>00614

642

<a name="l00615"></a>00615 // transpose

643

<a name="l00616"></a>00616 vect_bit_transpose<GT, plain_count, plain_size>

644

<a name="l00617"></a>00617 ((GT*)tmp_block, arr_size, <a class="code" href="a00068.html#a78bbc8d39f794aa7587363c237153471">tmatrix_</a>.value);

645

<a name="l00618"></a>00618

646

<a name="l00619"></a>00619 // calculate number of non-zero columns

647

<a name="l00620"></a>00620 <a class="code" href="a00068.html#acaded7f30ccbc5585749bdb03a441ab0">eff_cols_</a> = <a class="code" href="a00110.html#af92597461aff2926f9adcbf51bac98f9" title="Compute effective right column border of the t-matrix.">find_effective_columns</a>(<a class="code" href="a00068.html#a78bbc8d39f794aa7587363c237153471">tmatrix_</a>);

648

<a name="l00621"></a>00621

649

<a name="l00622"></a>00622 }

650

<a name="l00623"></a>00623

651

<a name="l00624"></a>00624 /// Restore GAP block from the transposed matrix

652

<a name="l00625"></a>00625 ///

653

<a name="l00626"></a><a class="code" href="a00068.html#a5d7e91d9440a38520f180c15bed36250">00626</a> void <a class="code" href="a00068.html#a5d7e91d9440a38520f180c15bed36250" title="Restore GAP block from the transposed matrix.">trestore</a>(GT gap_head,

654

<a name="l00627"></a>00627 GT* BMRESTRICT gap_buf,

655

<a name="l00628"></a>00628 BT* BMRESTRICT tmp_block)

656

<a name="l00629"></a>00629 {

657

<a name="l00630"></a>00630 const unsigned plain_count = sizeof(GT)*8;

658

<a name="l00631"></a>00631 const unsigned block_size = BLOCK_SIZE * sizeof(unsigned);

659

<a name="l00632"></a>00632 const unsigned plain_size = block_size / (sizeof(GT) * plain_count);

590

<a name="l00563"></a>00563 enc.<a class="code" href="a00062.html#a41455fea9cfa28ead897dd8970ce28bd" title="Puts 32 bits word into encoding buffer.">put_32</a>(bv.size());

591

<a name="l00564"></a>00564 }

592

<a name="l00565"></a>00565

593

<a name="l00566"></a>00566 }

594

<a name="l00567"></a>00567

595

<a name="l00568"></a>00568 template<class BV>

596

<a name="l00569"></a><a class="code" href="a00083.html#aa7eac0e670c3ff98404a5f1dcec1ef33">00569</a> void <a class="code" href="a00083.html#aa7eac0e670c3ff98404a5f1dcec1ef33" title="Encode GAP block with Elias Gamma coder.">serializer<BV>::gamma_gap_block</a>(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* gap_block, <a class="code" href="a00062.html" title="Memory encoding.">bm::encoder</a>& enc)

597

<a name="l00570"></a>00570 {

598

<a name="l00571"></a>00571 unsigned len = <a class="code" href="a00119.html#gad6bfb9da9950b0df8983a9faf9db5042" title="Returs GAP block length.">gap_length</a>(gap_block);

599

<a name="l00572"></a>00572

600

<a name="l00573"></a>00573 // Use Elias Gamma encoding

601

<a name="l00574"></a>00574 if (len > 6 && (compression_level_ > 3))

602

<a name="l00575"></a>00575 {

603

<a name="l00576"></a>00576 <a class="code" href="a00062.html#a06709edb97f0a4d861568e7813ec6d0c">encoder::position_type</a> enc_pos0 = enc.<a class="code" href="a00062.html#af31fd9ee56e453ab02d9d6e88c6b51c3" title="Get current memory stream position.">get_pos</a>();

604

<a name="l00577"></a>00577 {

605

<a name="l00578"></a>00578 <a class="code" href="a00031.html" title="Byte based writer for un-aligned bit streaming.">bit_out_type</a> bout(enc);

606

<a name="l00579"></a>00579 <a class="code" href="a00066.html" title="Functor for Elias Gamma encoding.">gamma_encoder_func</a> gamma(bout);

607

<a name="l00580"></a>00580

608

<a name="l00581"></a>00581 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>(<a class="code" href="a00115.html#ac47dea3917e15264ed3ba0cf4055adbe" title="Gamma compressed GAP block.">set_block_gap_egamma</a>);

609

<a name="l00582"></a>00582 enc.<a class="code" href="a00062.html#a9ff98e99d5c3e4d9e48fd7ecf7d2666e" title="Puts short word (16 bits) into the encoding buffer.">put_16</a>(gap_block[0]);

610

<a name="l00583"></a>00583

611

<a name="l00584"></a>00584 <a class="code" href="a00115.html#a6a7bfe8af49ed785f0e96c7ca37a2155">for_each_dgap</a>(gap_block, gamma);

612

<a name="l00585"></a>00585 }

613

<a name="l00586"></a>00586

614

<a name="l00587"></a>00587 // evaluate gamma coding efficiency

615

<a name="l00588"></a>00588 <a class="code" href="a00062.html#a06709edb97f0a4d861568e7813ec6d0c">encoder::position_type</a> enc_pos1 = enc.<a class="code" href="a00062.html#af31fd9ee56e453ab02d9d6e88c6b51c3" title="Get current memory stream position.">get_pos</a>();

616

<a name="l00589"></a>00589 unsigned gamma_size = enc_pos1 - enc_pos0;

617

<a name="l00590"></a>00590 if (gamma_size > (len-1)*sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>))

618

<a name="l00591"></a>00591 {

619

<a name="l00592"></a>00592 enc.<a class="code" href="a00062.html#a044164d67decef17dbb21383c368c066" title="Set current memory stream position.">set_pos</a>(enc_pos0);

620

<a name="l00593"></a>00593 }

621

<a name="l00594"></a>00594 else

622

<a name="l00595"></a>00595 {

623

<a name="l00596"></a>00596 return;

624

<a name="l00597"></a>00597 }

625

<a name="l00598"></a>00598 }

626

<a name="l00599"></a>00599

627

<a name="l00600"></a>00600 // save as plain GAP block

628

<a name="l00601"></a>00601 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>(<a class="code" href="a00115.html#a09b8c4b17b7d6f613c237c46d04a9cd6" title="Plain GAP block.">set_block_gap</a>);

629

<a name="l00602"></a>00602 enc.<a class="code" href="a00062.html#a9ff98e99d5c3e4d9e48fd7ecf7d2666e" title="Puts short word (16 bits) into the encoding buffer.">put_16</a>(gap_block, len-1);

630

<a name="l00603"></a>00603 }

631

<a name="l00604"></a>00604

632

<a name="l00605"></a>00605 template<class BV>

633

<a name="l00606"></a><a class="code" href="a00083.html#a88e75dd5bc8234634b21c7d3dcddc8c6">00606</a> void <a class="code" href="a00083.html#a88e75dd5bc8234634b21c7d3dcddc8c6" title="Encode GAP block as delta-array with Elias Gamma coder.">serializer<BV>::gamma_gap_array</a>(const <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* gap_array,

634

<a name="l00607"></a>00607 unsigned arr_len,

635

<a name="l00608"></a>00608 <a class="code" href="a00062.html" title="Memory encoding.">bm::encoder</a>& enc,

636

<a name="l00609"></a>00609 bool inverted)

637

<a name="l00610"></a>00610 {

638

<a name="l00611"></a>00611 if (compression_level_ > 3 && arr_len > 25)

639

<a name="l00612"></a>00612 {

640

<a name="l00613"></a>00613 <a class="code" href="a00062.html#a06709edb97f0a4d861568e7813ec6d0c">encoder::position_type</a> enc_pos0 = enc.<a class="code" href="a00062.html#af31fd9ee56e453ab02d9d6e88c6b51c3" title="Get current memory stream position.">get_pos</a>();

641

<a name="l00614"></a>00614 {

642

<a name="l00615"></a>00615 <a class="code" href="a00031.html" title="Byte based writer for un-aligned bit streaming.">bit_out_type</a> bout(enc);

643

<a name="l00616"></a>00616

644

<a name="l00617"></a>00617 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>(

645

<a name="l00618"></a>00618 inverted ? <a class="code" href="a00115.html#a1caddb62b332a568ba590794800610f6" title="Gamma compressed inverted delta GAP array.">set_block_arrgap_egamma_inv</a>

646

<a name="l00619"></a>00619 : <a class="code" href="a00115.html#a9674ddb1b9ee66948465249688708188" title="Gamma compressed delta GAP array.">set_block_arrgap_egamma</a>);

647

<a name="l00620"></a>00620

648

<a name="l00621"></a>00621 bout.<a class="code" href="a00031.html#ac4a5245e56f28cf93cb0c80d5137ff85">gamma</a>(arr_len);

649

<a name="l00622"></a>00622

650

<a name="l00623"></a>00623 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> prev = gap_array[0];

651

<a name="l00624"></a>00624 bout.<a class="code" href="a00031.html#ac4a5245e56f28cf93cb0c80d5137ff85">gamma</a>(prev + 1);

652

<a name="l00625"></a>00625

653

<a name="l00626"></a>00626 for (unsigned i = 1; i < arr_len; ++i)

654

<a name="l00627"></a>00627 {

655

<a name="l00628"></a>00628 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> curr = gap_array[i];

656

<a name="l00629"></a>00629 bout.<a class="code" href="a00031.html#ac4a5245e56f28cf93cb0c80d5137ff85">gamma</a>(curr - prev);

657

<a name="l00630"></a>00630 prev = curr;

658

<a name="l00631"></a>00631 }

659

<a name="l00632"></a>00632 }

660

<a name="l00633"></a>00633

661

<a name="l00634"></a>00634 <a class="code" href="a00089.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(sizeof(<a class="code" href="a00068.html#a78bbc8d39f794aa7587363c237153471">tmatrix_</a>.value) == plain_size * plain_count * sizeof(GT));

662

<a name="l00635"></a>00635

663

<a name="l00636"></a>00636 // restore into a temp buffer

664

<a name="l00637"></a>00637 GT* gap_tmp = (GT*)tmp_block;

665

<a name="l00638"></a>00638 //*gap_tmp++ = gap_head;

666

<a name="l00639"></a>00639

667

<a name="l00640"></a>00640 vect_bit_trestore<GT, plain_count, plain_size>(<a class="code" href="a00068.html#a78bbc8d39f794aa7587363c237153471">tmatrix_</a>.value, gap_tmp);

668

<a name="l00641"></a>00641

669

<a name="l00642"></a>00642 // D-Gap to GAP block recalculation

670

<a name="l00643"></a>00643 gap_tmp = (GT*)tmp_block;

671

<a name="l00644"></a>00644 dgap_2_gap<GT>(gap_tmp, gap_buf, gap_head);

672

<a name="l00645"></a>00645 }

673

<a name="l00646"></a>00646

674

<a name="l00647"></a>00647 public:

675

<a name="l00648"></a>00648 // GT gap_head_;

676

<a name="l00649"></a><a class="code" href="a00068.html#a78bbc8d39f794aa7587363c237153471">00649</a> <a class="code" href="a00068.html#aebedc43b623e92c51d273654aa437dbb" title="cryptic calculation of equivalent size for the transpose matrix based on BLOCK_SIZE...">tmatrix_type</a> <a class="code" href="a00068.html#a78bbc8d39f794aa7587363c237153471">tmatrix_</a>;

677

<a name="l00650"></a><a class="code" href="a00068.html#acaded7f30ccbc5585749bdb03a441ab0">00650</a> unsigned <a class="code" href="a00068.html#acaded7f30ccbc5585749bdb03a441ab0">eff_cols_</a>;

678

<a name="l00651"></a>00651 };

679

<a name="l00652"></a>00652

680

<a name="l00653"></a>00653

681

<a name="l00654"></a>00654 } // namespace bm

682

<a name="l00655"></a>00655

683

<a name="l00656"></a>00656 #endif

661

<a name="l00634"></a>00634 <a class="code" href="a00062.html#a06709edb97f0a4d861568e7813ec6d0c">encoder::position_type</a> enc_pos1 = enc.<a class="code" href="a00062.html#af31fd9ee56e453ab02d9d6e88c6b51c3" title="Get current memory stream position.">get_pos</a>();

662

<a name="l00635"></a>00635 unsigned gamma_size = enc_pos1 - enc_pos0;

663

<a name="l00636"></a>00636 if (gamma_size > (arr_len)*sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>))

664

<a name="l00637"></a>00637 {

665

<a name="l00638"></a>00638 enc.<a class="code" href="a00062.html#a044164d67decef17dbb21383c368c066" title="Set current memory stream position.">set_pos</a>(enc_pos0);

666

<a name="l00639"></a>00639 }

667

<a name="l00640"></a>00640 else

668

<a name="l00641"></a>00641 {

669

<a name="l00642"></a>00642 return;

670

<a name="l00643"></a>00643 }

671

<a name="l00644"></a>00644 }

672

<a name="l00645"></a>00645

673

<a name="l00646"></a>00646 // save as an plain array

674

<a name="l00647"></a>00647 enc.<a class="code" href="a00062.html#ae9319ec5694324047db48244526db8a2">put_prefixed_array_16</a>(inverted ? <a class="code" href="a00115.html#a746a03f6f5563cc8c75db93bba40095d" title="List of bits OFF (GAP block).">set_block_arrgap_inv</a> : <a class="code" href="a00115.html#aae33ceefae804cdd94412beee8c52720" title="List of bits ON (GAP block).">set_block_arrgap</a>,

675

<a name="l00648"></a>00648 gap_array, arr_len, true);

676

<a name="l00649"></a>00649 }

677

<a name="l00650"></a>00650

678

<a name="l00651"></a>00651

679

<a name="l00652"></a>00652 template<class BV>

680

<a name="l00653"></a><a class="code" href="a00083.html#a77bfac165158b3a018654d88fbed0121">00653</a> void <a class="code" href="a00083.html#a77bfac165158b3a018654d88fbed0121" title="Encode GAP block.">serializer<BV>::encode_gap_block</a>(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* gap_block, <a class="code" href="a00062.html" title="Memory encoding.">bm::encoder</a>& enc)

681

<a name="l00654"></a>00654 {

682

<a name="l00655"></a>00655 if (compression_level_ > 2)

683

<a name="l00656"></a>00656 {

684

<a name="l00657"></a>00657 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* gap_temp_block = (<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>*) temp_block_;

685

<a name="l00658"></a>00658 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> arr_len;

686

<a name="l00659"></a>00659

687

<a name="l00660"></a>00660 unsigned bc = <a class="code" href="a00119.html#ga570a6f573ffb9ac9e41a688d2bdc6004" title="Calculates number of bits ON in GAP buffer.">gap_bit_count</a>(gap_block);

688

<a name="l00661"></a>00661 if (bc == 1)

689

<a name="l00662"></a>00662 {

690

<a name="l00663"></a>00663 arr_len = <a class="code" href="a00119.html#ga5cd7e0cfee401da1b8f702151c083b27" title="Convert gap block into array of ints corresponding to 1 bits.">gap_convert_to_arr</a>(gap_temp_block,

691

<a name="l00664"></a>00664 gap_block,

692

<a name="l00665"></a>00665 <a class="code" href="a00115.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a>-10);

693

<a name="l00666"></a>00666 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(arr_len == 1);

694

<a name="l00667"></a>00667 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>(<a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>);

695

<a name="l00668"></a>00668 enc.<a class="code" href="a00062.html#a9ff98e99d5c3e4d9e48fd7ecf7d2666e" title="Puts short word (16 bits) into the encoding buffer.">put_16</a>(gap_temp_block[0]);

696

<a name="l00669"></a>00669 return;

697

<a name="l00670"></a>00670 }

698

<a name="l00671"></a>00671

699

<a name="l00672"></a>00672 unsigned len = <a class="code" href="a00119.html#gad6bfb9da9950b0df8983a9faf9db5042" title="Returs GAP block length.">gap_length</a>(gap_block);

700

<a name="l00673"></a>00673 bool invert, use_array;

701

<a name="l00674"></a>00674 invert = use_array = false;

702

<a name="l00675"></a>00675

703

<a name="l00676"></a>00676 if (bc < len-1)

704

<a name="l00677"></a>00677 {

705

<a name="l00678"></a>00678 use_array = true;

706

<a name="l00679"></a>00679 }

707

<a name="l00680"></a>00680 else // inverted array is a better alternative?

708

<a name="l00681"></a>00681 {

709

<a name="l00682"></a>00682 unsigned inverted_bc = <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a> - bc;

710

<a name="l00683"></a>00683 if (inverted_bc < len-1)

711

<a name="l00684"></a>00684 {

712

<a name="l00685"></a>00685 use_array = invert = true;

713

<a name="l00686"></a>00686 }

714

<a name="l00687"></a>00687 }

715

<a name="l00688"></a>00688 if (use_array)

716

<a name="l00689"></a>00689 {

717

<a name="l00690"></a>00690 arr_len = <a class="code" href="a00119.html#ga5cd7e0cfee401da1b8f702151c083b27" title="Convert gap block into array of ints corresponding to 1 bits.">gap_convert_to_arr</a>(gap_temp_block,

718

<a name="l00691"></a>00691 gap_block,

719

<a name="l00692"></a>00692 <a class="code" href="a00115.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a>-10,

720

<a name="l00693"></a>00693 invert);

721

<a name="l00694"></a>00694 if (arr_len)

722

<a name="l00695"></a>00695 {

723

<a name="l00696"></a>00696 <a class="code" href="a00083.html#a88e75dd5bc8234634b21c7d3dcddc8c6" title="Encode GAP block as delta-array with Elias Gamma coder.">gamma_gap_array</a>(gap_temp_block, arr_len, enc, invert);

724

<a name="l00697"></a>00697 return;

725

<a name="l00698"></a>00698 }

726

<a name="l00699"></a>00699 }

727

<a name="l00700"></a>00700 }

728

<a name="l00701"></a>00701

729

<a name="l00702"></a>00702 <a class="code" href="a00083.html#aa7eac0e670c3ff98404a5f1dcec1ef33" title="Encode GAP block with Elias Gamma coder.">gamma_gap_block</a>(gap_block, enc);

730

<a name="l00703"></a>00703 }

731

<a name="l00704"></a>00704

732

<a name="l00705"></a>00705 template<class BV>

733

<a name="l00706"></a><a class="code" href="a00083.html#a2c005feac8bc059af3333234c52739ed">00706</a> void <a class="code" href="a00083.html#a2c005feac8bc059af3333234c52739ed" title="Encode BIT block with repeatable runs of zeroes.">serializer<BV>::encode_bit_interval</a>(const <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk,

734

<a name="l00707"></a>00707 <a class="code" href="a00062.html" title="Memory encoding.">bm::encoder</a>& enc,

735

<a name="l00708"></a>00708 unsigned //size_control

736

<a name="l00709"></a>00709 )

737

<a name="l00710"></a>00710 {

738

<a name="l00711"></a>00711 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>(<a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>);

739

<a name="l00712"></a>00712 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>((blk[0]==0) ? 0 : 1); // encode start

740

<a name="l00713"></a>00713

741

<a name="l00714"></a>00714 unsigned i,j;//,k;

742

<a name="l00715"></a>00715

743

<a name="l00716"></a>00716 for (i = 0; i < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++i)

744

<a name="l00717"></a>00717 {

745

<a name="l00718"></a>00718 if (blk[i] == 0)

746

<a name="l00719"></a>00719 {

747

<a name="l00720"></a>00720 // scan fwd to find 0 island length

748

<a name="l00721"></a>00721 for (j = i+1; j < bm::set_block_size; ++j)

749

<a name="l00722"></a>00722 {

750

<a name="l00723"></a>00723 if (blk[j] != 0)

751

<a name="l00724"></a>00724 break;

752

<a name="l00725"></a>00725 }

753

<a name="l00726"></a>00726 enc.<a class="code" href="a00062.html#a9ff98e99d5c3e4d9e48fd7ecf7d2666e" title="Puts short word (16 bits) into the encoding buffer.">put_16</a>(j-i);

754

<a name="l00727"></a>00727 i = j - 1;

755

<a name="l00728"></a>00728 }

756

<a name="l00729"></a>00729 else

757

<a name="l00730"></a>00730 {

758

<a name="l00731"></a>00731 // scan fwd to find non-0 island length

759

<a name="l00732"></a>00732 for (j = i+1; j < bm::set_block_size; ++j)

760

<a name="l00733"></a>00733 {

761

<a name="l00734"></a>00734 if (blk[j] == 0)

762

<a name="l00735"></a>00735 {

763

<a name="l00736"></a>00736 // look ahead to identify and ignore short 0-run

764

<a name="l00737"></a>00737 if (((j+1 < bm::set_block_size) && blk[j+1]) ||

765

<a name="l00738"></a>00738 ((j+2 < bm::set_block_size) && blk[j+2])

766

<a name="l00739"></a>00739 )

767

<a name="l00740"></a>00740 {

768

<a name="l00741"></a>00741 ++j; // skip zero word

769

<a name="l00742"></a>00742 continue;

770

<a name="l00743"></a>00743 }

771

<a name="l00744"></a>00744 break;

772

<a name="l00745"></a>00745 }

773

<a name="l00746"></a>00746 }

774

<a name="l00747"></a>00747 enc.<a class="code" href="a00062.html#a9ff98e99d5c3e4d9e48fd7ecf7d2666e" title="Puts short word (16 bits) into the encoding buffer.">put_16</a>(j-i);

775

<a name="l00748"></a>00748 // stream all bit-words now

776

<a name="l00749"></a>00749 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(i < j);

777

<a name="l00750"></a>00750 enc.<a class="code" href="a00062.html#a41455fea9cfa28ead897dd8970ce28bd" title="Puts 32 bits word into encoding buffer.">put_32</a>(blk + i, j - i);

778

<a name="l00751"></a>00751 i = j - 1;

779

<a name="l00752"></a>00752 }

780

<a name="l00753"></a>00753 }

781

<a name="l00754"></a>00754 }

782

<a name="l00755"></a>00755

783

<a name="l00756"></a>00756

784

<a name="l00757"></a>00757 template<class BV>

785

<a name="l00758"></a><a class="code" href="a00083.html#af747ada0a8f77d79d73b34443595f4d4">00758</a> unsigned <a class="code" href="a00083.html#af747ada0a8f77d79d73b34443595f4d4" title="Bitvector serilization into memory block.">serializer<BV>::serialize</a>(const BV& bv,

786

<a name="l00759"></a>00759 unsigned char* buf, unsigned buf_size)

787

<a name="l00760"></a>00760 {

788

<a name="l00761"></a>00761 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(temp_block_);

789

<a name="l00762"></a>00762

790

<a name="l00763"></a>00763 const <a class="code" href="a00083.html#a33209dcd954f9cadff5a3379108d84e0">blocks_manager_type</a>& bman = bv.get_blocks_manager();

791

<a name="l00764"></a>00764

792

<a name="l00765"></a>00765 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* gap_temp_block = (<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>*) temp_block_;

793

<a name="l00766"></a>00766

794

<a name="l00767"></a>00767 <a class="code" href="a00062.html" title="Memory encoding.">bm::encoder</a> enc(buf, buf_size); // create the encoder

795

<a name="l00768"></a>00768 <a class="code" href="a00083.html#a341d5819f2f1164172f4c0c4771ec941" title="Encode serialization header information.">encode_header</a>(bv, enc);

796

<a name="l00769"></a>00769

797

<a name="l00770"></a>00770 unsigned i,j;

798

<a name="l00771"></a>00771

799

<a name="l00772"></a>00772

800

<a name="l00773"></a>00773 // save blocks.

801

<a name="l00774"></a>00774 for (i = 0; i < <a class="code" href="a00115.html#a505011007f54598794e0b9477c0b0b11">bm::set_total_blocks</a>; ++i)

802

<a name="l00775"></a>00775 {

803

<a name="l00776"></a>00776 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk = bman.get_block(i);

804

<a name="l00777"></a>00777 // -----------------------------------------

805

<a name="l00778"></a>00778 // Empty or ONE block serialization

806

<a name="l00779"></a>00779

807

<a name="l00780"></a>00780 bool flag;

808

<a name="l00781"></a>00781 flag = bman.is_block_zero(i, blk, false);

809

<a name="l00782"></a>00782 if (flag)

810

<a name="l00783"></a>00783 {

811

<a name="l00784"></a>00784 zero_block:

812

<a name="l00785"></a>00785 unsigned next_nb = bman.find_next_nz_block(i+1, false);

813

<a name="l00786"></a>00786 if (next_nb == bm::set_total_blocks) // no more blocks

814

<a name="l00787"></a>00787 {

815

<a name="l00788"></a>00788 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>(<a class="code" href="a00115.html#ae87b5c61d7ba6e2e592a279db0b21cc0" title="All other blocks zero.">set_block_azero</a>);

816

<a name="l00789"></a>00789 return enc.<a class="code" href="a00062.html#a6e2954f43df9eaabbd08b2922fa45c00" title="Returns size of the current encoding stream.">size</a>();

817

<a name="l00790"></a>00790 }

818

<a name="l00791"></a>00791 unsigned nb = next_nb - i;

819

<a name="l00792"></a>00792

820

<a name="l00793"></a>00793 if (nb > 1 && nb < 128)

821

<a name="l00794"></a>00794 {

822

<a name="l00795"></a>00795 // special (but frequent) case -- GAP delta fits in 7bits

823

<a name="l00796"></a>00796 unsigned char c = (1 << 7) | nb;

824

<a name="l00797"></a>00797 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>(c);

825

<a name="l00798"></a>00798 }

826

<a name="l00799"></a>00799 else

827

<a name="l00800"></a>00800 {

828

<a name="l00801"></a>00801 <a class="code" href="a00096.html#a6a3d8841118b48dc31cf507ac70c763a">SER_NEXT_GRP</a>(enc, nb, <a class="code" href="a00115.html#a9e9cf918ca2ebec84eaf844d0e4c8bdb" title="One all-zero block.">set_block_1zero</a>,

829

<a name="l00802"></a>00802 <a class="code" href="a00115.html#ac9b85b261ab49b37d5e15b84ed2d8b99" title="Up to 256 zero blocks.">set_block_8zero</a>,

830

<a name="l00803"></a>00803 <a class="code" href="a00115.html#aef47eda6538ebf2624c1612d35694c01" title="Up to 65536 zero blocks.">set_block_16zero</a>,

831

<a name="l00804"></a>00804 <a class="code" href="a00115.html#ac7dfbd94a0534df88849bbce9e6c419a" title="Up to 4G zero blocks.">set_block_32zero</a>)

832

<a name="l00805"></a>00805 }

833

<a name="l00806"></a>00806 i = next_nb - 1;

834

<a name="l00807"></a>00807 continue;

835

<a name="l00808"></a>00808 }

836

<a name="l00809"></a>00809 else

837

<a name="l00810"></a>00810 {

838

<a name="l00811"></a>00811 flag = bman.is_block_one(i, blk, false);

839

<a name="l00812"></a>00812 if (flag)

840

<a name="l00813"></a>00813 {

841

<a name="l00814"></a>00814 // Look ahead for similar blocks

842

<a name="l00815"></a>00815 for(j = i+1; j < bm::set_total_blocks; ++j)

843

<a name="l00816"></a>00816 {

844

<a name="l00817"></a>00817 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk_next = bman.get_block(j);

845

<a name="l00818"></a>00818 if (flag != bman.is_block_one(j, blk_next, false))

846

<a name="l00819"></a>00819 break;

847

<a name="l00820"></a>00820 }

848

<a name="l00821"></a>00821 if (j == bm::set_total_blocks)

849

<a name="l00822"></a>00822 {

850

<a name="l00823"></a>00823 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>(<a class="code" href="a00115.html#ad506b63262c52870758432a95e71907e" title="All other blocks one.">set_block_aone</a>);

851

<a name="l00824"></a>00824 break;

852

<a name="l00825"></a>00825 }

853

<a name="l00826"></a>00826 else

854

<a name="l00827"></a>00827 {

855

<a name="l00828"></a>00828 unsigned nb = j - i;

856

<a name="l00829"></a>00829 <a class="code" href="a00096.html#a6a3d8841118b48dc31cf507ac70c763a">SER_NEXT_GRP</a>(enc, nb, <a class="code" href="a00115.html#a715131318a361bcccf59fc0b1e41d444" title="One block all-set (1111...).">set_block_1one</a>,

857

<a name="l00830"></a>00830 <a class="code" href="a00115.html#a57ad1090d6f380cf5de5f98c699b5a75" title="Up to 256 all-set blocks.">set_block_8one</a>,

858

<a name="l00831"></a>00831 <a class="code" href="a00115.html#a3fad4a939708df59b1201910c7d37e30" title="UP to 65536 all-set blocks.">set_block_16one</a>,

859

<a name="l00832"></a>00832 <a class="code" href="a00115.html#a5b87c58ae617ad1f104b4c6bc3ed6447" title="UP to 4G all-set blocks.">set_block_32one</a>)

860

<a name="l00833"></a>00833 }

861

<a name="l00834"></a>00834 i = j - 1;

862

<a name="l00835"></a>00835 continue;

863

<a name="l00836"></a>00836 }

864

<a name="l00837"></a>00837 }

865

<a name="l00838"></a>00838

866

<a name="l00839"></a>00839 // ------------------------------

867

<a name="l00840"></a>00840 // GAP serialization

868

<a name="l00841"></a>00841

869

<a name="l00842"></a>00842 if (<a class="code" href="a00092.html#a862d6f92b4de3ddb94fd367a800512eb">BM_IS_GAP</a>(bman, blk, i))

870

<a name="l00843"></a>00843 {

871

<a name="l00844"></a>00844 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* gblk = <a class="code" href="a00092.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(blk);

872

<a name="l00845"></a>00845 <a class="code" href="a00083.html#a77bfac165158b3a018654d88fbed0121" title="Encode GAP block.">encode_gap_block</a>(gblk, enc);

873

<a name="l00846"></a>00846 continue;

874

<a name="l00847"></a>00847 }

875

<a name="l00848"></a>00848

876

<a name="l00849"></a>00849 // ----------------------------------------------

877

<a name="l00850"></a>00850 // BIT BLOCK serialization

878

<a name="l00851"></a>00851

879

<a name="l00852"></a>00852 {

880

<a name="l00853"></a>00853 if (compression_level_ <= 1)

881

<a name="l00854"></a>00854 {

882

<a name="l00855"></a>00855 enc.<a class="code" href="a00062.html#a638b1dece7bf74cf685baee973f17299">put_prefixed_array_32</a>(<a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>, blk, <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

883

<a name="l00856"></a>00856 continue;

884

<a name="l00857"></a>00857 }

885

<a name="l00858"></a>00858

886

<a name="l00859"></a>00859 // compute bit-block statistics: bit-count and number of GAPS

887

<a name="l00860"></a>00860 unsigned block_bc = 0;

888

<a name="l00861"></a>00861 <a class="code" href="a00115.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> bit_gaps =

889

<a name="l00862"></a>00862 <a class="code" href="a00120.html#gaca91016aeb08ae1b610d6d407aae0e4c">bit_block_calc_count_change</a>(blk, blk + <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>,

890

<a name="l00863"></a>00863 &block_bc);

891

<a name="l00864"></a>00864 unsigned block_bc_inv = <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a> - block_bc;

892

<a name="l00865"></a>00865 switch (block_bc)

893

<a name="l00866"></a>00866 {

894

<a name="l00867"></a>00867 case 1: // corner case: only 1 bit on

895

<a name="l00868"></a>00868 {

896

<a name="l00869"></a>00869 <a class="code" href="a00115.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> bit_idx = 0;

897

<a name="l00870"></a>00870 <a class="code" href="a00120.html#gad6a7c549a625df7aa7d68d43a57238c7" title="Searches for the next 1 bit in the BIT block.">bit_find_in_block</a>(blk, bit_idx, &bit_idx);

898

<a name="l00871"></a>00871 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>(<a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>); enc.<a class="code" href="a00062.html#a9ff98e99d5c3e4d9e48fd7ecf7d2666e" title="Puts short word (16 bits) into the encoding buffer.">put_16</a>((short)bit_idx);

899

<a name="l00872"></a>00872 continue;

900

<a name="l00873"></a>00873 }

901

<a name="l00874"></a>00874 case 0: goto zero_block; // empty block

902

<a name="l00875"></a>00875 }

903

<a name="l00876"></a>00876

904

<a name="l00877"></a>00877

905

<a name="l00878"></a>00878 // compute alternative representation sizes

906

<a name="l00879"></a>00879 //

907

<a name="l00880"></a>00880 unsigned arr_block_size = sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>) + (block_bc * sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>));

908

<a name="l00881"></a>00881 unsigned arr_block_size_inv = sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>) + (block_bc_inv * sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>));

909

<a name="l00882"></a>00882 unsigned gap_block_size = sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>) + ((bit_gaps+1) * sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>));

910

<a name="l00883"></a>00883 unsigned interval_block_size;

911

<a name="l00884"></a>00884 interval_block_size = <a class="code" href="a00120.html#ga0ff158706f2e194be67fb8267641c30a" title="Inspects block for full zero words.">bit_count_nonzero_size</a>(blk, <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

912

<a name="l00885"></a>00885 bool inverted = false;

913

<a name="l00886"></a>00886

914

<a name="l00887"></a>00887 if (arr_block_size_inv < arr_block_size &&

915

<a name="l00888"></a>00888 arr_block_size_inv < gap_block_size &&

916

<a name="l00889"></a>00889 arr_block_size_inv < interval_block_size)

917

<a name="l00890"></a>00890 {

918

<a name="l00891"></a>00891 inverted = true;

919

<a name="l00892"></a>00892 goto bit_as_array;

920

<a name="l00893"></a>00893 }

921

<a name="l00894"></a>00894

922

<a name="l00895"></a>00895 // if interval representation is not a good alternative

923

<a name="l00896"></a>00896 if ((interval_block_size > arr_block_size) ||

924

<a name="l00897"></a>00897 (interval_block_size > gap_block_size))

925

<a name="l00898"></a>00898 {

926

<a name="l00899"></a>00899 if (gap_block_size < (<a class="code" href="a00115.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a>-64) &&

927

<a name="l00900"></a>00900 gap_block_size < arr_block_size)

928

<a name="l00901"></a>00901 {

929

<a name="l00902"></a>00902 unsigned len = <a class="code" href="a00119.html#ga80d09bb6ab244e68ab0c1fdccc17b95b" title="Converts bit block to GAP.">bit_convert_to_gap</a>(gap_temp_block,

930

<a name="l00903"></a>00903 blk,

931

<a name="l00904"></a>00904 <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>,

932

<a name="l00905"></a>00905 <a class="code" href="a00115.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a>-64);

933

<a name="l00906"></a>00906 if (len) // save as GAP

934

<a name="l00907"></a>00907 {

935

<a name="l00908"></a>00908 <a class="code" href="a00083.html#aa7eac0e670c3ff98404a5f1dcec1ef33" title="Encode GAP block with Elias Gamma coder.">gamma_gap_block</a>(gap_temp_block, enc);

936

<a name="l00909"></a>00909 continue;

937

<a name="l00910"></a>00910 }

938

<a name="l00911"></a>00911 }

939

<a name="l00912"></a>00912

940

<a name="l00913"></a>00913 if (arr_block_size < ((<a class="code" href="a00115.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a>-64) * sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>)))

941

<a name="l00914"></a>00914 {

942

<a name="l00915"></a>00915 bit_as_array:

943

<a name="l00916"></a>00916 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> arr_len;

944

<a name="l00917"></a>00917 unsigned mask = inverted ? ~0 : 0;

945

<a name="l00918"></a>00918 arr_len = <a class="code" href="a00120.html#gaf24d85761f60877c2260f8160593f732" title="Convert bit block into an array of ints corresponding to 1 bits.">bit_convert_to_arr</a>(gap_temp_block,

946

<a name="l00919"></a>00919 blk,

947

<a name="l00920"></a>00920 <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>,

948

<a name="l00921"></a>00921 <a class="code" href="a00115.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a>-64,

949

<a name="l00922"></a>00922 mask);

950

<a name="l00923"></a>00923 if (arr_len)

951

<a name="l00924"></a>00924 {

952

<a name="l00925"></a>00925 <a class="code" href="a00083.html#a88e75dd5bc8234634b21c7d3dcddc8c6" title="Encode GAP block as delta-array with Elias Gamma coder.">gamma_gap_array</a>(gap_temp_block, arr_len, enc, inverted);

953

<a name="l00926"></a>00926 continue;

954

<a name="l00927"></a>00927 }

955

<a name="l00928"></a>00928

956

<a name="l00929"></a>00929 }

957

<a name="l00930"></a>00930 // full bit-block

958

<a name="l00931"></a>00931 enc.<a class="code" href="a00062.html#a638b1dece7bf74cf685baee973f17299">put_prefixed_array_32</a>(<a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>, blk, <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

959

<a name="l00932"></a>00932 continue;

960

<a name="l00933"></a>00933 }

961

<a name="l00934"></a>00934

962

<a name="l00935"></a>00935 // if interval block is a winner

963

<a name="l00936"></a>00936 if (interval_block_size < arr_block_size &&

964

<a name="l00937"></a>00937 interval_block_size < gap_block_size)

965

<a name="l00938"></a>00938 {

966

<a name="l00939"></a>00939 <a class="code" href="a00083.html#a2c005feac8bc059af3333234c52739ed" title="Encode BIT block with repeatable runs of zeroes.">encode_bit_interval</a>(blk, enc, interval_block_size);

967

<a name="l00940"></a>00940 continue;

968

<a name="l00941"></a>00941 }

969

<a name="l00942"></a>00942

970

<a name="l00943"></a>00943 if (gap_block_size < <a class="code" href="a00115.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a> &&

971

<a name="l00944"></a>00944 gap_block_size < arr_block_size)

972

<a name="l00945"></a>00945 {

973

<a name="l00946"></a>00946 unsigned len = <a class="code" href="a00119.html#ga80d09bb6ab244e68ab0c1fdccc17b95b" title="Converts bit block to GAP.">bit_convert_to_gap</a>(gap_temp_block,

974

<a name="l00947"></a>00947 blk,

975

<a name="l00948"></a>00948 <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>,

976

<a name="l00949"></a>00949 <a class="code" href="a00115.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a>-64);

977

<a name="l00950"></a>00950 if (len) // save as GAP

978

<a name="l00951"></a>00951 {

979

<a name="l00952"></a>00952 <a class="code" href="a00083.html#aa7eac0e670c3ff98404a5f1dcec1ef33" title="Encode GAP block with Elias Gamma coder.">gamma_gap_block</a>(gap_temp_block, enc);

980

<a name="l00953"></a>00953 continue;

981

<a name="l00954"></a>00954 }

982

<a name="l00955"></a>00955 }

983

<a name="l00956"></a>00956

984

<a name="l00957"></a>00957

985

<a name="l00958"></a>00958 // if array is best

986

<a name="l00959"></a>00959 if (arr_block_size < <a class="code" href="a00115.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a>-64)

987

<a name="l00960"></a>00960 {

988

<a name="l00961"></a>00961 goto bit_as_array;

989

<a name="l00962"></a>00962 }

990

<a name="l00963"></a>00963

991

<a name="l00964"></a>00964 // full bit-block

992

<a name="l00965"></a>00965 enc.<a class="code" href="a00062.html#a638b1dece7bf74cf685baee973f17299">put_prefixed_array_32</a>(<a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>, blk, <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

993

<a name="l00966"></a>00966 continue;

994

<a name="l00967"></a>00967 }

995

<a name="l00968"></a>00968 }

996

<a name="l00969"></a>00969

997

<a name="l00970"></a>00970 enc.<a class="code" href="a00062.html#a143fd22a7268efa014474ce905db7cac" title="Puts one character into the encoding buffer.">put_8</a>(<a class="code" href="a00115.html#aa24e7c08930cf959d383c6b930fb0508" title="End of serialization.">set_block_end</a>);

998

<a name="l00971"></a>00971

999

<a name="l00972"></a>00972 unsigned encoded_size = enc.<a class="code" href="a00062.html#a6e2954f43df9eaabbd08b2922fa45c00" title="Returns size of the current encoding stream.">size</a>();

1000

<a name="l00973"></a>00973 return encoded_size;

1001

<a name="l00974"></a>00974

1002

<a name="l00975"></a>00975 }

1003

<a name="l00976"></a>00976

1004

<a name="l00977"></a>00977

1005

<a name="l00978"></a>00978

1006

<a name="l00979"></a>00979 /// Bit mask flags for serialization algorithm

1007

<a name="l00980"></a>00980 /// \ingroup bvserial

1008

<a name="l00981"></a><a class="code" href="a00126.html#ga537dfe6318f1f1fe18d86dac312be978">00981</a> enum <a class="code" href="a00126.html#ga537dfe6318f1f1fe18d86dac312be978" title="Bit mask flags for serialization algorithm.">serialization_flags</a> {

1009

<a name="l00982"></a><a class="code" href="a00126.html#gga537dfe6318f1f1fe18d86dac312be978acdd8c071c079589388c3ca7bd4f367c8">00982</a> <a class="code" href="a00126.html#gga537dfe6318f1f1fe18d86dac312be978acdd8c071c079589388c3ca7bd4f367c8" title="save no byte-order info (save some space)">BM_NO_BYTE_ORDER</a> = 1, ///< save no byte-order info (save some space)

1010

<a name="l00983"></a><a class="code" href="a00126.html#gga537dfe6318f1f1fe18d86dac312be978a5521473081d341bc32ac59538e6a8096">00983</a> <a class="code" href="a00126.html#gga537dfe6318f1f1fe18d86dac312be978a5521473081d341bc32ac59538e6a8096" title="save no GAP info (save some space)">BM_NO_GAP_LENGTH</a> = (1 << 1) ///< save no GAP info (save some space)

1011

<a name="l00984"></a>00984 };

1012

<a name="l00985"></a>00985

1013

<a name="l00986"></a>00986 /*!

1014

<a name="l00987"></a>00987 \brief Saves bitvector into memory.

1015

<a name="l00988"></a>00988

1016

<a name="l00989"></a>00989 Function serializes content of the bitvector into memory.

1017

<a name="l00990"></a>00990 Serialization adaptively uses compression(variation of GAP encoding)

1018

<a name="l00991"></a>00991 when it is benefitial.

1019

<a name="l00992"></a>00992

1020

<a name="l00993"></a>00993 \param buf - pointer on target memory area. No range checking in the

1021

<a name="l00994"></a>00994 function. It is responsibility of programmer to allocate sufficient

1022

<a name="l00995"></a>00995 amount of memory using information from calc_stat function.

1023

<a name="l00996"></a>00996

1024

<a name="l00997"></a>00997 \param temp_block - pointer on temporary memory block. Cannot be 0;

1025

<a name="l00998"></a>00998 If you want to save memory across multiple bvectors

1026

<a name="l00999"></a>00999 allocate temporary block using allocate_tempblock and pass it to

1027

<a name="l01000"></a>01000 serialize.

1028

<a name="l01001"></a>01001 (Of course serialize does not deallocate temp_block.)

1029

<a name="l01002"></a>01002

1030

<a name="l01003"></a>01003 \param serialization_flags

1031

<a name="l01004"></a>01004 Flags controlling serilization (bit-mask)

1032

<a name="l01005"></a>01005 (use OR-ed serialization flags)

1033

<a name="l01006"></a>01006

1034

<a name="l01007"></a>01007 \ingroup bvserial

1035

<a name="l01008"></a>01008

1036

<a name="l01009"></a>01009 \return Size of serialization block.

1037

<a name="l01010"></a>01010 \sa calc_stat, serialization_flags

1038

<a name="l01011"></a>01011

1039

<a name="l01012"></a>01012 */

1040

<a name="l01013"></a>01013 /*

1041

<a name="l01014"></a>01014 Serialization format:

1042

1043

<a name="l01016"></a>01016

1044

<a name="l01017"></a>01017 | HEADER | BLOCKS |

1045

<a name="l01018"></a>01018

1046

<a name="l01019"></a>01019 Header structure:

1047

<a name="l01020"></a>01020 BYTE : Serialization header (bit mask of BM_HM_*)

1048

<a name="l01021"></a>01021 BYTE : Byte order ( 0 - Big Endian, 1 - Little Endian)

1049

<a name="l01022"></a>01022 INT16: Reserved (0)

1050

<a name="l01023"></a>01023 INT16: Reserved Flags (0)

1051

<a name="l01024"></a>01024

1052

1053

<a name="l01026"></a>01026 */

1054

<a name="l01027"></a>01027 template<class BV>

1055

<a name="l01028"></a><a class="code" href="a00126.html#ga5210c3bda57254ef2e8c71e23306cc88">01028</a> unsigned <a class="code" href="a00126.html#ga5210c3bda57254ef2e8c71e23306cc88" title="Saves bitvector into memory.">serialize</a>(const BV& bv,

1056

<a name="l01029"></a>01029 unsigned char* buf,

1057

<a name="l01030"></a>01030 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_block,

1058

<a name="l01031"></a>01031 unsigned <a class="code" href="a00126.html#ga537dfe6318f1f1fe18d86dac312be978" title="Bit mask flags for serialization algorithm.">serialization_flags</a> = 0)

1059

<a name="l01032"></a>01032 {

1060

<a name="l01033"></a>01033 <a class="code" href="a00083.html" title="Bit-vector serialization class.">bm::serializer<BV></a> bv_serial;

1061

<a name="l01034"></a>01034 if (<a class="code" href="a00126.html#ga537dfe6318f1f1fe18d86dac312be978" title="Bit mask flags for serialization algorithm.">serialization_flags</a> & <a class="code" href="a00126.html#gga537dfe6318f1f1fe18d86dac312be978acdd8c071c079589388c3ca7bd4f367c8" title="save no byte-order info (save some space)">BM_NO_BYTE_ORDER</a>)

1062

<a name="l01035"></a>01035 bv_serial.<a class="code" href="a00083.html#a892b124d42bb939485e47d197b8dc1ac" title="Set byte-order serialization (for cross platform compatibility).">byte_order_serialization</a>(false);

1063

<a name="l01036"></a>01036

1064

<a name="l01037"></a>01037 if (<a class="code" href="a00126.html#ga537dfe6318f1f1fe18d86dac312be978" title="Bit mask flags for serialization algorithm.">serialization_flags</a> & <a class="code" href="a00126.html#gga537dfe6318f1f1fe18d86dac312be978a5521473081d341bc32ac59538e6a8096" title="save no GAP info (save some space)">BM_NO_GAP_LENGTH</a>)

1065

<a name="l01038"></a>01038 bv_serial.<a class="code" href="a00083.html#a5b19026c2e928c639f09da4a4e1235ab" title="Set GAP length serialization (serializes GAP levels of the original vector).">gap_length_serialization</a>(false);

1066

<a name="l01039"></a>01039 else

1067

<a name="l01040"></a>01040 bv_serial.<a class="code" href="a00083.html#a5b19026c2e928c639f09da4a4e1235ab" title="Set GAP length serialization (serializes GAP levels of the original vector).">gap_length_serialization</a>(true);

1068

<a name="l01041"></a>01041

1069

<a name="l01042"></a>01042 bv_serial.<a class="code" href="a00083.html#ad433d790f07103d39c5f15a6caaf2823" title="Set compression level.">set_compression_level</a>(4);

1070

<a name="l01043"></a>01043

1071

<a name="l01044"></a>01044 return bv_serial.<a class="code" href="a00083.html#af747ada0a8f77d79d73b34443595f4d4" title="Bitvector serilization into memory block.">serialize</a>(bv, buf, 0);

1072

<a name="l01045"></a>01045 }

1073

<a name="l01046"></a>01046

1074

<a name="l01047"></a>01047 /*!

1075

<a name="l01048"></a>01048 @brief Saves bitvector into memory.

1076

<a name="l01049"></a>01049 Allocates temporary memory block for bvector.

1077

<a name="l01050"></a>01050 \ingroup bvserial

1078

<a name="l01051"></a>01051 */

1079

<a name="l01052"></a>01052

1080

<a name="l01053"></a>01053 template<class BV>

1081

<a name="l01054"></a><a class="code" href="a00126.html#ga213033b5cc6add74aa4bd1d614b56192">01054</a> unsigned <a class="code" href="a00126.html#ga5210c3bda57254ef2e8c71e23306cc88" title="Saves bitvector into memory.">serialize</a>(BV& bv,

1082

<a name="l01055"></a>01055 unsigned char* buf,

1083

<a name="l01056"></a>01056 unsigned <a class="code" href="a00126.html#ga537dfe6318f1f1fe18d86dac312be978" title="Bit mask flags for serialization algorithm.">serialization_flags</a>=0)

1084

<a name="l01057"></a>01057 {

1085

<a name="l01058"></a>01058 <a class="code" href="a00083.html" title="Bit-vector serialization class.">bm::serializer<BV></a> bv_serial;

1086

<a name="l01059"></a>01059 if (<a class="code" href="a00126.html#ga537dfe6318f1f1fe18d86dac312be978" title="Bit mask flags for serialization algorithm.">serialization_flags</a> & <a class="code" href="a00126.html#gga537dfe6318f1f1fe18d86dac312be978acdd8c071c079589388c3ca7bd4f367c8" title="save no byte-order info (save some space)">BM_NO_BYTE_ORDER</a>)

1087

<a name="l01060"></a>01060 bv_serial.<a class="code" href="a00083.html#a892b124d42bb939485e47d197b8dc1ac" title="Set byte-order serialization (for cross platform compatibility).">byte_order_serialization</a>(false);

1088

<a name="l01061"></a>01061

1089

<a name="l01062"></a>01062 if (<a class="code" href="a00126.html#ga537dfe6318f1f1fe18d86dac312be978" title="Bit mask flags for serialization algorithm.">serialization_flags</a> & <a class="code" href="a00126.html#gga537dfe6318f1f1fe18d86dac312be978a5521473081d341bc32ac59538e6a8096" title="save no GAP info (save some space)">BM_NO_GAP_LENGTH</a>)

1090

<a name="l01063"></a>01063 bv_serial.<a class="code" href="a00083.html#a5b19026c2e928c639f09da4a4e1235ab" title="Set GAP length serialization (serializes GAP levels of the original vector).">gap_length_serialization</a>(false);

1091

<a name="l01064"></a>01064 else

1092

<a name="l01065"></a>01065 bv_serial.<a class="code" href="a00083.html#a5b19026c2e928c639f09da4a4e1235ab" title="Set GAP length serialization (serializes GAP levels of the original vector).">gap_length_serialization</a>(true);

1093

<a name="l01066"></a>01066

1094

<a name="l01067"></a>01067 bv_serial.<a class="code" href="a00083.html#ad433d790f07103d39c5f15a6caaf2823" title="Set compression level.">set_compression_level</a>(4);

1095

<a name="l01068"></a>01068

1096

<a name="l01069"></a>01069 return bv_serial.<a class="code" href="a00083.html#af747ada0a8f77d79d73b34443595f4d4" title="Bitvector serilization into memory block.">serialize</a>(bv, buf, 0);

1097

<a name="l01070"></a>01070 }

1098

<a name="l01071"></a>01071

1099

<a name="l01072"></a>01072

1100

<a name="l01073"></a>01073

1101

<a name="l01074"></a>01074 /*!

1102

<a name="l01075"></a>01075 @brief Bitvector deserialization from memory.

1103

<a name="l01076"></a>01076

1104

<a name="l01077"></a>01077 @param buf - pointer on memory which keeps serialized bvector

1105

<a name="l01078"></a>01078 @param temp_block - pointer on temporary block,

1106

<a name="l01079"></a>01079 if NULL bvector allocates own.

1107

<a name="l01080"></a>01080 @return Number of bytes consumed by deserializer.

1108

<a name="l01081"></a>01081

1109

<a name="l01082"></a>01082 Function desrializes bitvector from memory block containig results

1110

<a name="l01083"></a>01083 of previous serialization. Function does not remove bits

1111

<a name="l01084"></a>01084 which are currently set. Effectively it means OR logical operation

1112

<a name="l01085"></a>01085 between current bitset and previously serialized one.

1113

<a name="l01086"></a>01086

1114

<a name="l01087"></a>01087 @ingroup bvserial

1115

<a name="l01088"></a>01088 */

1116

<a name="l01089"></a>01089 template<class BV>

1117

<a name="l01090"></a><a class="code" href="a00126.html#gafbe633db8da3d867f098468269fd8d3d">01090</a> unsigned <a class="code" href="a00126.html#gafbe633db8da3d867f098468269fd8d3d" title="Bitvector deserialization from memory.">deserialize</a>(BV& bv,

1118

<a name="l01091"></a>01091 const unsigned char* buf,

1119

<a name="l01092"></a>01092 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_block=0)

1120

<a name="l01093"></a>01093 {

1121

<a name="l01094"></a>01094 <a class="code" href="a00115.html#a577905b348676c2bc556b51793350dbb" title="Byte orders recognized by the library.">ByteOrder</a> bo_current = <a class="code" href="a00070.html#a133786f6db9267b0760de9158bee0c36">globals<true>::byte_order</a>();

1122

<a name="l01095"></a>01095

1123

<a name="l01096"></a>01096 <a class="code" href="a00054.html" title="Class for decoding data from memory buffer.">bm::decoder</a> dec(buf);

1124

<a name="l01097"></a>01097 unsigned char header_flag = dec.<a class="code" href="a00055.html#a8402bad78311eb4f0fff484d1cc03f36" title="Reads character from the decoding buffer.">get_8</a>();

1125

<a name="l01098"></a>01098 <a class="code" href="a00115.html#a577905b348676c2bc556b51793350dbb" title="Byte orders recognized by the library.">ByteOrder</a> bo = bo_current;

1126

<a name="l01099"></a>01099 if (!(header_flag & <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a6b127bde401907318702dd4827c8f74e" title="no byte-order">BM_HM_NO_BO</a>))

1127

<a name="l01100"></a>01100 {

1128

<a name="l01101"></a>01101 bo = (<a class="code" href="a00115.html#a577905b348676c2bc556b51793350dbb" title="Byte orders recognized by the library.">bm::ByteOrder</a>) dec.<a class="code" href="a00055.html#a8402bad78311eb4f0fff484d1cc03f36" title="Reads character from the decoding buffer.">get_8</a>();

1129

<a name="l01102"></a>01102 }

1130

<a name="l01103"></a>01103

1131

<a name="l01104"></a>01104 if (bo_current == bo)

1132

<a name="l01105"></a>01105 {

1133

<a name="l01106"></a>01106 <a class="code" href="a00059.html" title="Class deserializer.">deserializer<BV, bm::decoder></a> deserial;

1134

<a name="l01107"></a>01107 return deserial.<a class="code" href="a00059.html#ab92b3cd1e7289fe0aa7ac3038a4e0cbd">deserialize</a>(bv, buf, temp_block);

1135

<a name="l01108"></a>01108 }

1136

<a name="l01109"></a>01109 switch (bo_current)

1137

<a name="l01110"></a>01110 {

1138

<a name="l01111"></a>01111 case <a class="code" href="a00115.html#a577905b348676c2bc556b51793350dbbac959b97503c42581f3dd81fd3b93fff2">BigEndian</a>:

1139

<a name="l01112"></a>01112 {

1140

<a name="l01113"></a>01113 <a class="code" href="a00059.html" title="Class deserializer.">deserializer<BV, bm::decoder_big_endian></a> deserial;

1141

<a name="l01114"></a>01114 return deserial.<a class="code" href="a00059.html#ab92b3cd1e7289fe0aa7ac3038a4e0cbd">deserialize</a>(bv, buf, temp_block);

1142

<a name="l01115"></a>01115 }

1143

<a name="l01116"></a>01116 case <a class="code" href="a00115.html#a577905b348676c2bc556b51793350dbba5ebe266b6d18ee74483c2bbf624e2cc2">LittleEndian</a>:

1144

<a name="l01117"></a>01117 {

1145

<a name="l01118"></a>01118 <a class="code" href="a00059.html" title="Class deserializer.">deserializer<BV, bm::decoder_little_endian></a> deserial;

1146

<a name="l01119"></a>01119 return deserial.<a class="code" href="a00059.html#ab92b3cd1e7289fe0aa7ac3038a4e0cbd">deserialize</a>(bv, buf, temp_block);

1147

<a name="l01120"></a>01120 }

1148

<a name="l01121"></a>01121 default:

1149

<a name="l01122"></a>01122 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

1150

<a name="l01123"></a>01123 };

1151

<a name="l01124"></a>01124 return 0;

1152

<a name="l01125"></a>01125 }

1153

<a name="l01126"></a>01126

1154

<a name="l01127"></a>01127

1155

<a name="l01128"></a>01128 template<class DEC>

1156

<a name="l01129"></a><a class="code" href="a00058.html#abbd0f97d8c8bd1017cd65885870c2426">01129</a> void <a class="code" href="a00058.html#abbd0f97d8c8bd1017cd65885870c2426" title="Read GAP block from the stream.">deseriaizer_base<DEC>::read_gap_block</a>(decoder_type& <a class="code" href="a00054.html" title="Class for decoding data from memory buffer.">decoder</a>,

1157

<a name="l01130"></a>01130 unsigned block_type,

1158

<a name="l01131"></a>01131 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* dst_block,

1159

<a name="l01132"></a>01132 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>& gap_head)

1160

<a name="l01133"></a>01133 {

1161

<a name="l01134"></a>01134 typedef <a class="code" href="a00029.html" title="Byte based reader for un-aligned bit streaming.">bit_in<DEC></a> bit_in_type;

1162

<a name="l01135"></a>01135

1163

<a name="l01136"></a>01136 switch (block_type)

1164

<a name="l01137"></a>01137 {

1165

<a name="l01138"></a>01138 case <a class="code" href="a00115.html#a09b8c4b17b7d6f613c237c46d04a9cd6" title="Plain GAP block.">set_block_gap</a>:

1166

<a name="l01139"></a>01139 {

1167

<a name="l01140"></a>01140 unsigned len = <a class="code" href="a00119.html#gad6bfb9da9950b0df8983a9faf9db5042" title="Returs GAP block length.">gap_length</a>(&gap_head);

1168

<a name="l01141"></a>01141 --len;

1169

<a name="l01142"></a>01142 *dst_block = gap_head;

1170

<a name="l01143"></a>01143 decoder.get_16(dst_block+1, len - 1);

1171

<a name="l01144"></a>01144 dst_block[len] = <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">gap_max_bits</a> - 1;

1172

<a name="l01145"></a>01145 }

1173

<a name="l01146"></a>01146 break;

1174

<a name="l01147"></a>01147 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

1175

<a name="l01148"></a>01148 {

1176

<a name="l01149"></a>01149 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> bit_idx = decoder.get_16();

1177

<a name="l01150"></a>01150 unsigned is_set;

1178

<a name="l01151"></a>01151 /* unsigned new_block_len = */

1179

<a name="l01152"></a>01152 <a class="code" href="a00119.html#ga69186bd13bda27e04b3e33683ff884c2" title="Abstract distance(similarity) operation for GAP buffers. Receives functor F as a...">gap_set_value</a>(true, dst_block, bit_idx, &is_set);

1180

<a name="l01153"></a>01153 }

1181

<a name="l01154"></a>01154 break;

1182

<a name="l01155"></a>01155 case <a class="code" href="a00115.html#aae33ceefae804cdd94412beee8c52720" title="List of bits ON (GAP block).">set_block_arrgap</a>:

1183

<a name="l01156"></a>01156 case <a class="code" href="a00115.html#a746a03f6f5563cc8c75db93bba40095d" title="List of bits OFF (GAP block).">set_block_arrgap_inv</a>:

1184

<a name="l01157"></a>01157 {

1185

<a name="l01158"></a>01158 <a class="code" href="a00119.html#gaef53b2877ff369badd7bb25b26bb9029" title="Sets all bits to 0 or 1 (GAP).">gap_set_all</a>(dst_block, <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>, 0);

1186

<a name="l01159"></a>01159 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> len = decoder.get_16();

1187

<a name="l01160"></a>01160

1188

<a name="l01161"></a>01161 for (<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> k = 0; k < len; ++k)

1189

<a name="l01162"></a>01162 {

1190

<a name="l01163"></a>01163 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> bit_idx = decoder.get_16();

1191

<a name="l01164"></a>01164 unsigned is_set;

1192

<a name="l01165"></a>01165 /* unsigned new_block_len = */

1193

<a name="l01166"></a>01166 <a class="code" href="a00119.html#ga69186bd13bda27e04b3e33683ff884c2" title="Abstract distance(similarity) operation for GAP buffers. Receives functor F as a...">gap_set_value</a>(true, dst_block, bit_idx, &is_set);

1194

<a name="l01167"></a>01167 } // for

1195

<a name="l01168"></a>01168 }

1196

<a name="l01169"></a>01169 break;

1197

<a name="l01170"></a>01170 case <a class="code" href="a00115.html#a9674ddb1b9ee66948465249688708188" title="Gamma compressed delta GAP array.">set_block_arrgap_egamma</a>:

1198

<a name="l01171"></a>01171 case <a class="code" href="a00115.html#a1caddb62b332a568ba590794800610f6" title="Gamma compressed inverted delta GAP array.">set_block_arrgap_egamma_inv</a>:

1199

<a name="l01172"></a>01172 {

1200

<a name="l01173"></a>01173 bit_in_type bin(decoder);

1201

<a name="l01174"></a>01174

1202

<a name="l01175"></a>01175 <a class="code" href="a00119.html#gaef53b2877ff369badd7bb25b26bb9029" title="Sets all bits to 0 or 1 (GAP).">gap_set_all</a>(dst_block, <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>, 0);

1203

<a name="l01176"></a>01176 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> len = bin.gamma();

1204

<a name="l01177"></a>01177

1205

<a name="l01178"></a>01178 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> prev = 0;

1206

<a name="l01179"></a>01179 for (<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> k = 0; k < len; ++k)

1207

<a name="l01180"></a>01180 {

1208

<a name="l01181"></a>01181 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> bit_idx = bin.gamma();

1209

<a name="l01182"></a>01182 if (k == 0) --bit_idx; // TODO: optimization

1210

<a name="l01183"></a>01183 bit_idx += prev;

1211

<a name="l01184"></a>01184 prev = bit_idx;

1212

<a name="l01185"></a>01185

1213

<a name="l01186"></a>01186 unsigned is_set;

1214

<a name="l01187"></a>01187 /* unsigned new_block_len = */

1215

<a name="l01188"></a>01188 <a class="code" href="a00119.html#ga69186bd13bda27e04b3e33683ff884c2" title="Abstract distance(similarity) operation for GAP buffers. Receives functor F as a...">gap_set_value</a>(true, dst_block, bit_idx, &is_set);

1216

<a name="l01189"></a>01189 } // for

1217

<a name="l01190"></a>01190 }

1218

<a name="l01191"></a>01191 break;

1219

<a name="l01192"></a>01192 case <a class="code" href="a00115.html#ac47dea3917e15264ed3ba0cf4055adbe" title="Gamma compressed GAP block.">set_block_gap_egamma</a>:

1220

<a name="l01193"></a>01193 {

1221

<a name="l01194"></a>01194 unsigned len = (gap_head >> 3);

1222

<a name="l01195"></a>01195 --len;

1223

<a name="l01196"></a>01196 // read gamma GAP block into a dest block

1224

<a name="l01197"></a>01197 {

1225

<a name="l01198"></a>01198 *dst_block = gap_head;

1226

<a name="l01199"></a>01199 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* gap_data_ptr = dst_block + 1;

1227

<a name="l01200"></a>01200

1228

<a name="l01201"></a>01201 bit_in_type bin(decoder);

1229

<a name="l01202"></a>01202 {

1230

<a name="l01203"></a>01203 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> gap_sum = 0;

1231

<a name="l01204"></a>01204 for (unsigned i = 0; i < len; ++i, ++gap_data_ptr)

1232

<a name="l01205"></a>01205 {

1233

<a name="l01206"></a>01206 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> v = bin.gamma();

1234

<a name="l01207"></a>01207 if (i == 0) --v; // TODO: optimization out of the loop

1235

<a name="l01208"></a>01208 gap_sum += v;

1236

<a name="l01209"></a>01209 *gap_data_ptr = gap_sum;

1237

<a name="l01210"></a>01210 }

1238

<a name="l01211"></a>01211 dst_block[len+1] = <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a> - 1;

1239

<a name="l01212"></a>01212 }

1240

<a name="l01213"></a>01213 }

1241

<a name="l01214"></a>01214

1242

<a name="l01215"></a>01215 }

1243

<a name="l01216"></a>01216 break;

1244

<a name="l01217"></a>01217 default:

1245

<a name="l01218"></a>01218 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

1246

<a name="l01219"></a>01219 }

1247

<a name="l01220"></a>01220

1248

<a name="l01221"></a>01221 if (block_type == <a class="code" href="a00115.html#a1caddb62b332a568ba590794800610f6" title="Gamma compressed inverted delta GAP array.">set_block_arrgap_egamma_inv</a> ||

1249

<a name="l01222"></a>01222 block_type == <a class="code" href="a00115.html#a746a03f6f5563cc8c75db93bba40095d" title="List of bits OFF (GAP block).">set_block_arrgap_inv</a>)

1250

<a name="l01223"></a>01223 {

1251

<a name="l01224"></a>01224 <a class="code" href="a00119.html#ga3f22bfde5dfe06d6d77dc2598b8c0845" title="Inverts all bits in the GAP buffer.">gap_invert</a>(dst_block);

1252

<a name="l01225"></a>01225 }

1253

<a name="l01226"></a>01226

1254

<a name="l01227"></a>01227 }

1255

<a name="l01228"></a>01228

1256

<a name="l01229"></a>01229

1257

<a name="l01230"></a>01230 template<class BV, class DEC>

1258

<a name="l01231"></a>01231 void

1259

<a name="l01232"></a><a class="code" href="a00059.html#a6cb253af926d3b4562d538b6684fb99f">01232</a> <a class="code" href="a00059.html#a6cb253af926d3b4562d538b6684fb99f">deserializer<BV, DEC>::deserialize_gap</a>(unsigned char btype, decoder_type& dec,

1260

<a name="l01233"></a>01233 bvector_type& bv, blocks_manager_type& bman,

1261

<a name="l01234"></a>01234 unsigned i,

1262

<a name="l01235"></a>01235 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk)

1263

<a name="l01236"></a>01236 {

1264

<a name="l01237"></a>01237 typedef <a class="code" href="a00029.html" title="Byte based reader for un-aligned bit streaming.">bit_in<DEC></a> bit_in_type;

1265

<a name="l01238"></a>01238 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> gap_head;

1266

<a name="l01239"></a>01239

1267

<a name="l01240"></a>01240 switch (btype)

1268

<a name="l01241"></a>01241 {

1269

<a name="l01242"></a>01242 case <a class="code" href="a00115.html#a09b8c4b17b7d6f613c237c46d04a9cd6" title="Plain GAP block.">set_block_gap</a>:

1270

<a name="l01243"></a>01243 case <a class="code" href="a00115.html#a77dc965397e31a1d39c3d8e628792779" title="GAP compressed bitblock.">set_block_gapbit</a>:

1271

<a name="l01244"></a>01244 {

1272

<a name="l01245"></a>01245 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> gap_head =

1273

<a name="l01246"></a>01246 sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>) == 2 ? dec.get_16() : dec.get_32();

1274

<a name="l01247"></a>01247

1275

<a name="l01248"></a>01248 unsigned len = <a class="code" href="a00119.html#gad6bfb9da9950b0df8983a9faf9db5042" title="Returs GAP block length.">gap_length</a>(&gap_head);

1276

<a name="l01249"></a>01249 int level = <a class="code" href="a00119.html#ga3bfaebeeb4b2d479c5a9ac9d57607165" title="Calculates GAP block capacity level.">gap_calc_level</a>(len, bman.glen());

1277

<a name="l01250"></a>01250 --len;

1278

<a name="l01251"></a>01251 if (level == -1) // Too big to be GAP: convert to BIT block

1279

<a name="l01252"></a>01252 {

1280

<a name="l01253"></a>01253 *<a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a> = gap_head;

1281

<a name="l01254"></a>01254 dec.get_16(<a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a>+1, len - 1);

1282

<a name="l01255"></a>01255 <a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a>[len] = <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">gap_max_bits</a> - 1;

1283

<a name="l01256"></a>01256

1284

<a name="l01257"></a>01257 if (blk == 0) // block does not exist yet

1285

<a name="l01258"></a>01258 {

1286

<a name="l01259"></a>01259 blk = bman.get_allocator().alloc_bit_block();

1287

<a name="l01260"></a>01260 bman.set_block(i, blk);

1288

<a name="l01261"></a>01261 <a class="code" href="a00119.html#ga4862f4dcdcb7c0575e2e2db9e5f2a849" title="GAP block to bitblock conversion.">gap_convert_to_bitset</a>(blk, <a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a>);

1289

<a name="l01262"></a>01262 }

1290

<a name="l01263"></a>01263 else // We have some data already here. Apply OR operation.

1291

<a name="l01264"></a>01264 {

1292

<a name="l01265"></a>01265 <a class="code" href="a00119.html#ga4862f4dcdcb7c0575e2e2db9e5f2a849" title="GAP block to bitblock conversion.">gap_convert_to_bitset</a>(<a class="code" href="a00059.html#ae59b9caa9b7ae36070561a4953d29b1c">temp_block_</a>,

1293

<a name="l01266"></a>01266 <a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a>);

1294

<a name="l01267"></a>01267

1295

<a name="l01268"></a>01268 bv.combine_operation_with_block(i,

1296

<a name="l01269"></a>01269 <a class="code" href="a00059.html#ae59b9caa9b7ae36070561a4953d29b1c">temp_block_</a>,

1297

<a name="l01270"></a>01270 0,

1298

<a name="l01271"></a>01271 <a class="code" href="a00115.html#a42405343976ec931388381cea4092bf1a0c8cf0197857d0bd73a63037e2f2c5c5">BM_OR</a>);

1299

<a name="l01272"></a>01272 }

1300

<a name="l01273"></a>01273

1301

<a name="l01274"></a>01274 return;

1302

<a name="l01275"></a>01275 } // level == -1

1303

<a name="l01276"></a>01276

1304

<a name="l01277"></a>01277 <a class="code" href="a00119.html#ga501aa9bf029e7f9ea9518e7003fe5549" title="Sets GAP block capacity level.">set_gap_level</a>(&gap_head, level);

1305

<a name="l01278"></a>01278

1306

<a name="l01279"></a>01279 if (blk == 0)

1307

<a name="l01280"></a>01280 {

1308

<a name="l01281"></a>01281 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* gap_blk =

1309

<a name="l01282"></a>01282 bman.get_allocator().alloc_gap_block(level, bman.glen());

1310

<a name="l01283"></a>01283 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* gap_blk_ptr = <a class="code" href="a00092.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(gap_blk);

1311

<a name="l01284"></a>01284 *gap_blk_ptr = gap_head;

1312

<a name="l01285"></a>01285 <a class="code" href="a00119.html#ga501aa9bf029e7f9ea9518e7003fe5549" title="Sets GAP block capacity level.">set_gap_level</a>(gap_blk_ptr, level);

1313

<a name="l01286"></a>01286 bman.set_block(i, (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)gap_blk);

1314

<a name="l01287"></a>01287 bman.set_block_gap(i);

1315

<a name="l01288"></a>01288 for (unsigned k = 1; k < len; ++k)

1316

<a name="l01289"></a>01289 {

1317

<a name="l01290"></a>01290 gap_blk[k] = dec.get_16();

1318

<a name="l01291"></a>01291 }

1319

<a name="l01292"></a>01292 gap_blk[len] = <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a> - 1;

1320

<a name="l01293"></a>01293 }

1321

<a name="l01294"></a>01294 else // target block exists

1322

<a name="l01295"></a>01295 {

1323

<a name="l01296"></a>01296 // read GAP block into a temp memory and perform OR

1324

<a name="l01297"></a>01297 *<a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a> = gap_head;

1325

<a name="l01298"></a>01298 for (unsigned k = 1; k < len; ++k)

1326

<a name="l01299"></a>01299 {

1327

<a name="l01300"></a>01300 <a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a>[k] = dec.get_16();

1328

<a name="l01301"></a>01301 }

1329

<a name="l01302"></a>01302 <a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a>[len] = <a class="code" href="a00115.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a> - 1;

1330

<a name="l01303"></a>01303

1331

<a name="l01304"></a>01304 bv.combine_operation_with_block(i,

1332

<a name="l01305"></a>01305 (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)<a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a>,

1333

<a name="l01306"></a>01306 1,

1334

<a name="l01307"></a>01307 <a class="code" href="a00115.html#a42405343976ec931388381cea4092bf1a0c8cf0197857d0bd73a63037e2f2c5c5">BM_OR</a>);

1335

<a name="l01308"></a>01308 }

1336

<a name="l01309"></a>01309 return;

1337

<a name="l01310"></a>01310 }

1338

<a name="l01311"></a>01311 case <a class="code" href="a00115.html#aae33ceefae804cdd94412beee8c52720" title="List of bits ON (GAP block).">set_block_arrgap</a>:

1339

<a name="l01312"></a>01312 {

1340

<a name="l01313"></a>01313 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> len = dec.get_16();

1341

<a name="l01314"></a>01314 int block_type;

1342

<a name="l01315"></a>01315 unsigned k = 0;

1343

<a name="l01316"></a>01316 for (; k < len; )

1344

<a name="l01317"></a>01317 {

1345

<a name="l01318"></a>01318 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk = bman.check_allocate_block(i,

1346

<a name="l01319"></a>01319 true,

1347

<a name="l01320"></a>01320 <a class="code" href="a00118.html#ggad0b87b3b7292383a864d27feaf1c9effa7fe09d1d7c62a813db922c396c0cbc9c" title="GAP compression is ON.">BM_GAP</a>,

1348

<a name="l01321"></a>01321 &block_type,

1349

<a name="l01322"></a>01322 true // allow null return

1350

<a name="l01323"></a>01323 );

1351

<a name="l01324"></a>01324 // block is all 1, no need to do anything

1352

<a name="l01325"></a>01325 if (!blk)

1353

<a name="l01326"></a>01326 {

1354

<a name="l01327"></a>01327 // read the encoding stream to skip to the next block

1355

<a name="l01328"></a>01328 for (; k < len; ++k)

1356

<a name="l01329"></a>01329 dec.get_16();

1357

<a name="l01330"></a>01330 return;

1358

<a name="l01331"></a>01331 }

1359

<a name="l01332"></a>01332

1360

<a name="l01333"></a>01333 if (block_type == 1) // gap block

1361

<a name="l01334"></a>01334 {

1362

<a name="l01335"></a>01335 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* gap_blk = <a class="code" href="a00092.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(blk);

1363

<a name="l01336"></a>01336 unsigned threshold = <a class="code" href="a00119.html#ga94a5371b5dc6a1560d95d7c2dde88815" title="Returs GAP block capacity limit.">bm::gap_limit</a>(gap_blk, bman.glen());

1364

<a name="l01337"></a>01337

1365

<a name="l01338"></a>01338 for (; k < len; ++k)

1366

<a name="l01339"></a>01339 {

1367

<a name="l01340"></a>01340 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> bit_idx = dec.get_16();

1368

<a name="l01341"></a>01341 unsigned is_set;

1369

<a name="l01342"></a>01342 unsigned new_block_len =

1370

<a name="l01343"></a>01343 <a class="code" href="a00119.html#ga69186bd13bda27e04b3e33683ff884c2" title="Abstract distance(similarity) operation for GAP buffers. Receives functor F as a...">gap_set_value</a>(true, gap_blk, bit_idx, &is_set);

1371

<a name="l01344"></a>01344 if (new_block_len > threshold)

1372

<a name="l01345"></a>01345 {

1373

<a name="l01346"></a>01346 bman.extend_gap_block(i, gap_blk);

1374

<a name="l01347"></a>01347 ++k;

1375

<a name="l01348"></a>01348 break;

1376

<a name="l01349"></a>01349 }

1377

<a name="l01350"></a>01350 } // for

1378

<a name="l01351"></a>01351 }

1379

<a name="l01352"></a>01352 else // bit block

1380

<a name="l01353"></a>01353 {

1381

<a name="l01354"></a>01354 // Get the array one by one and set the bits.

1382

<a name="l01355"></a>01355 for(;k < len; ++k)

1383

<a name="l01356"></a>01356 {

1384

<a name="l01357"></a>01357 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> bit_idx = dec.get_16();

1385

<a name="l01358"></a>01358 <a class="code" href="a00120.html#gad698b5242f5b629aa28e7338b7150497" title="Sets bits to 1 in the bitblock.">or_bit_block</a>(blk, bit_idx, 1);

1386

<a name="l01359"></a>01359 }

1387

<a name="l01360"></a>01360 }

1388

<a name="l01361"></a>01361 } // for

1389

<a name="l01362"></a>01362 return;

1390

<a name="l01363"></a>01363 }

1391

<a name="l01364"></a>01364 case <a class="code" href="a00115.html#a9674ddb1b9ee66948465249688708188" title="Gamma compressed delta GAP array.">set_block_arrgap_egamma</a>:

1392

<a name="l01365"></a>01365 {

1393

<a name="l01366"></a>01366 bit_in_type bin(dec);

1394

<a name="l01367"></a>01367 int block_type;

1395

<a name="l01368"></a>01368

1396

<a name="l01369"></a>01369 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> len = bin.gamma();

1397

<a name="l01370"></a>01370 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> prev = 0;

1398

<a name="l01371"></a>01371

1399

<a name="l01372"></a>01372 unsigned k = 0;

1400

<a name="l01373"></a>01373 for (; k < len; )

1401

<a name="l01374"></a>01374 {

1402

<a name="l01375"></a>01375 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk = bman.check_allocate_block(i,

1403

<a name="l01376"></a>01376 true,

1404

<a name="l01377"></a>01377 <a class="code" href="a00118.html#ggad0b87b3b7292383a864d27feaf1c9effa7fe09d1d7c62a813db922c396c0cbc9c" title="GAP compression is ON.">BM_GAP</a>,

1405

<a name="l01378"></a>01378 &block_type,

1406

<a name="l01379"></a>01379 true // allow null return

1407

<a name="l01380"></a>01380 );

1408

<a name="l01381"></a>01381 // block is all 1, no need to do anything

1409

<a name="l01382"></a>01382 if (!blk)

1410

<a name="l01383"></a>01383 {

1411

<a name="l01384"></a>01384 // read the encoding stream to skip to the next block

1412

<a name="l01385"></a>01385 for (; k < len; ++k)

1413

<a name="l01386"></a>01386 bin.gamma();

1414

<a name="l01387"></a>01387 return;

1415

<a name="l01388"></a>01388 }

1416

<a name="l01389"></a>01389

1417

<a name="l01390"></a>01390 if (block_type == 1) // gap block

1418

<a name="l01391"></a>01391 {

1419

<a name="l01392"></a>01392 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* gap_blk = <a class="code" href="a00092.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(blk);

1420

<a name="l01393"></a>01393 unsigned threshold = <a class="code" href="a00119.html#ga94a5371b5dc6a1560d95d7c2dde88815" title="Returs GAP block capacity limit.">bm::gap_limit</a>(gap_blk, bman.glen());

1421

<a name="l01394"></a>01394

1422

<a name="l01395"></a>01395 for (; k < len; ++k)

1423

<a name="l01396"></a>01396 {

1424

<a name="l01397"></a>01397 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> bit_idx = bin.gamma();

1425

<a name="l01398"></a>01398 if (k==0) --bit_idx; //TODO: optimization

1426

<a name="l01399"></a>01399 bit_idx += prev;

1427

<a name="l01400"></a>01400 prev = bit_idx;

1428

<a name="l01401"></a>01401

1429

<a name="l01402"></a>01402 unsigned is_set;

1430

<a name="l01403"></a>01403 unsigned new_block_len =

1431

<a name="l01404"></a>01404 <a class="code" href="a00119.html#ga69186bd13bda27e04b3e33683ff884c2" title="Abstract distance(similarity) operation for GAP buffers. Receives functor F as a...">gap_set_value</a>(true, gap_blk, bit_idx, &is_set);

1432

<a name="l01405"></a>01405 if (new_block_len > threshold)

1433

<a name="l01406"></a>01406 {

1434

<a name="l01407"></a>01407 bman.extend_gap_block(i, gap_blk);

1435

<a name="l01408"></a>01408 ++k;

1436

<a name="l01409"></a>01409 break;

1437

<a name="l01410"></a>01410 }

1438

<a name="l01411"></a>01411 } // for

1439

<a name="l01412"></a>01412 }

1440

<a name="l01413"></a>01413 else // bit block

1441

<a name="l01414"></a>01414 {

1442

<a name="l01415"></a>01415 // Get the array one by one and set the bits.

1443

<a name="l01416"></a>01416 for(;k < len; ++k)

1444

<a name="l01417"></a>01417 {

1445

<a name="l01418"></a>01418 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> bit_idx = bin.gamma();

1446

<a name="l01419"></a>01419 if (k==0) --bit_idx; //TODO: optimization

1447

<a name="l01420"></a>01420 bit_idx += prev;

1448

<a name="l01421"></a>01421 prev = bit_idx;

1449

<a name="l01422"></a>01422

1450

<a name="l01423"></a>01423 <a class="code" href="a00120.html#gad698b5242f5b629aa28e7338b7150497" title="Sets bits to 1 in the bitblock.">or_bit_block</a>(blk, bit_idx, 1);

1451

<a name="l01424"></a>01424 }

1452

<a name="l01425"></a>01425 }

1453

<a name="l01426"></a>01426 } // for

1454

<a name="l01427"></a>01427 return;

1455

<a name="l01428"></a>01428

1456

<a name="l01429"></a>01429 }

1457

<a name="l01430"></a>01430 case <a class="code" href="a00115.html#ac47dea3917e15264ed3ba0cf4055adbe" title="Gamma compressed GAP block.">set_block_gap_egamma</a>:

1458

<a name="l01431"></a>01431 gap_head =

1459

<a name="l01432"></a>01432 sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>) == 2 ? dec.get_16() : dec.get_32();

1460

<a name="l01433"></a>01433 case <a class="code" href="a00115.html#a1caddb62b332a568ba590794800610f6" title="Gamma compressed inverted delta GAP array.">set_block_arrgap_egamma_inv</a>:

1461

<a name="l01434"></a>01434 case <a class="code" href="a00115.html#a746a03f6f5563cc8c75db93bba40095d" title="List of bits OFF (GAP block).">set_block_arrgap_inv</a>:

1462

<a name="l01435"></a>01435 <a class="code" href="a00058.html#abbd0f97d8c8bd1017cd65885870c2426" title="Read GAP block from the stream.">read_gap_block</a>(dec, btype, <a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a>, gap_head);

1463

<a name="l01436"></a>01436

1464

<a name="l01437"></a>01437 // OR temp block into the target vector

1465

<a name="l01438"></a>01438 //

1466

<a name="l01439"></a>01439 bv.combine_operation_with_block(i,

1467

<a name="l01440"></a>01440 (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)<a class="code" href="a00059.html#a4001dc2e21c8c0cefba16b77878e7edc">gap_temp_block_</a>,

1468

<a name="l01441"></a>01441 1,

1469

<a name="l01442"></a>01442 <a class="code" href="a00115.html#a42405343976ec931388381cea4092bf1a0c8cf0197857d0bd73a63037e2f2c5c5">BM_OR</a>);

1470

<a name="l01443"></a>01443

1471

<a name="l01444"></a>01444 return;

1472

<a name="l01445"></a>01445 default:

1473

<a name="l01446"></a>01446 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

1474

<a name="l01447"></a>01447 }

1475

<a name="l01448"></a>01448

1476

<a name="l01449"></a>01449 }

1477

<a name="l01450"></a>01450

1478

<a name="l01451"></a>01451

1479

<a name="l01452"></a>01452 template<class BV, class DEC>

1480

<a name="l01453"></a><a class="code" href="a00059.html#ab92b3cd1e7289fe0aa7ac3038a4e0cbd">01453</a> unsigned <a class="code" href="a00059.html#ab92b3cd1e7289fe0aa7ac3038a4e0cbd">deserializer<BV, DEC>::deserialize</a>(bvector_type& bv,

1481

<a name="l01454"></a>01454 const unsigned char* buf,

1482

<a name="l01455"></a>01455 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_block)

1483

<a name="l01456"></a>01456 {

1484

<a name="l01457"></a>01457 <a class="code" href="a00059.html#aa65584010f05f3e9e0c38c725c37dabc">blocks_manager_type</a>& bman = bv.get_blocks_manager();

1485

<a name="l01458"></a>01458

1486

<a name="l01459"></a>01459 <a class="code" href="a00115.html#a7176bf7817550ca24cb6612bd8d7957d">bm::wordop_t</a>* tmp_buf =

1487

<a name="l01460"></a>01460 temp_block ? (<a class="code" href="a00115.html#a7176bf7817550ca24cb6612bd8d7957d">bm::wordop_t</a>*) temp_block

1488

<a name="l01461"></a>01461 : (<a class="code" href="a00115.html#a7176bf7817550ca24cb6612bd8d7957d">bm::wordop_t</a>*)bman.check_allocate_tempblock();

1489

<a name="l01462"></a>01462

1490

<a name="l01463"></a>01463 <a class="code" href="a00059.html#ae59b9caa9b7ae36070561a4953d29b1c">temp_block_</a> = temp_block = (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">word_t</a>*)tmp_buf;

1491

<a name="l01464"></a>01464

1492

<a name="l01465"></a>01465 <a class="code" href="a00059.html#a34d196efac18e976843727d6266cdf40">decoder_type</a> dec(buf);

1493

<a name="l01466"></a>01466

1494

<a name="l01467"></a>01467 bv.forget_count();

1495

<a name="l01468"></a>01468

1496

<a name="l01469"></a>01469 <a class="code" href="a00092.html#a7e6f87ba3230dece2125af5c32e84b05">BM_SET_MMX_GUARD</a>

1497

<a name="l01470"></a>01470

1498

<a name="l01471"></a>01471 // Reading header

1499

<a name="l01472"></a>01472

1500

<a name="l01473"></a>01473 unsigned char header_flag = dec.get_8();

1501

<a name="l01474"></a>01474 if (!(header_flag & <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a6b127bde401907318702dd4827c8f74e" title="no byte-order">BM_HM_NO_BO</a>))

1502

<a name="l01475"></a>01475 {

1503

<a name="l01476"></a>01476 /*ByteOrder bo = (bm::ByteOrder)*/dec.get_8();

1504

<a name="l01477"></a>01477 }

1505

<a name="l01478"></a>01478

1506

<a name="l01479"></a>01479 if (header_flag & <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a64c44c57a6f8b8e89f0916db9e120d47" title="id list stored">BM_HM_ID_LIST</a>)

1507

<a name="l01480"></a>01480 {

1508

<a name="l01481"></a>01481 // special case: the next comes plain list of integers

1509

<a name="l01482"></a>01482 if (header_flag & <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0af4fbefa0ed0a8ff42dd664f120782c27" title="resized vector">BM_HM_RESIZE</a>)

1510

<a name="l01483"></a>01483 {

1511

<a name="l01484"></a>01484 unsigned bv_size = dec.get_32();

1512

<a name="l01485"></a>01485 if (bv_size > bv.size())

1513

<a name="l01486"></a>01486 {

1514

<a name="l01487"></a>01487 bv.resize(bv_size);

1515

<a name="l01488"></a>01488 }

1516

<a name="l01489"></a>01489 }

1517

<a name="l01490"></a>01490

1518

<a name="l01491"></a>01491

1519

<a name="l01492"></a>01492 for (unsigned cnt = dec.get_32(); cnt; --cnt) {

1520

<a name="l01493"></a>01493 <a class="code" href="a00115.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> id = dec.get_32();

1521

<a name="l01494"></a>01494 bv.set(id);

1522

<a name="l01495"></a>01495 } // for

1523

<a name="l01496"></a>01496 // -1 for compatibility with other deserialization branches

1524

<a name="l01497"></a>01497 return dec.size()-1;

1525

<a name="l01498"></a>01498 }

1526

<a name="l01499"></a>01499

1527

<a name="l01500"></a>01500 unsigned i;

1528

<a name="l01501"></a>01501

1529

<a name="l01502"></a>01502 if (!(header_flag & <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a04c714af376c203bc8b082856ad622a3" title="no GAP levels">BM_HM_NO_GAPL</a>))

1530

<a name="l01503"></a>01503 {

1531

<a name="l01504"></a>01504 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> glevels[<a class="code" href="a00115.html#a773e9f5341919d58000bd54d50038733">bm::gap_levels</a>];

1532

<a name="l01505"></a>01505 // read GAP levels information

1533

<a name="l01506"></a>01506 for (i = 0; i < <a class="code" href="a00115.html#a773e9f5341919d58000bd54d50038733">bm::gap_levels</a>; ++i)

1534

<a name="l01507"></a>01507 {

1535

<a name="l01508"></a>01508 glevels[i] = dec.get_16();

1536

<a name="l01509"></a>01509 }

1537

<a name="l01510"></a>01510 }

1538

<a name="l01511"></a>01511

1539

<a name="l01512"></a>01512 if (header_flag & (1 << 1))

1540

<a name="l01513"></a>01513 {

1541

<a name="l01514"></a>01514 unsigned bv_size = dec.get_32();

1542

<a name="l01515"></a>01515 if (bv_size > bv.size())

1543

<a name="l01516"></a>01516 {

1544

<a name="l01517"></a>01517 bv.resize(bv_size);

1545

<a name="l01518"></a>01518 }

1546

<a name="l01519"></a>01519 }

1547

<a name="l01520"></a>01520

1548

<a name="l01521"></a>01521 unsigned char btype;

1549

<a name="l01522"></a>01522 unsigned nb;

1550

<a name="l01523"></a>01523

1551

<a name="l01524"></a>01524 for (i = 0; i < <a class="code" href="a00115.html#a505011007f54598794e0b9477c0b0b11">bm::set_total_blocks</a>; ++i)

1552

<a name="l01525"></a>01525 {

1553

<a name="l01526"></a>01526 btype = dec.get_8();

1554

<a name="l01527"></a>01527 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk = bman.get_block(i);

1555

<a name="l01528"></a>01528 // pre-check if we have short zero-run packaging here

1556

<a name="l01529"></a>01529 //

1557

<a name="l01530"></a>01530 if (btype & (1 << 7))

1558

<a name="l01531"></a>01531 {

1559

<a name="l01532"></a>01532 nb = btype & ~(1 << 7);

1560

<a name="l01533"></a>01533 i += nb-1;

1561

<a name="l01534"></a>01534 continue;

1562

<a name="l01535"></a>01535 }

1563

<a name="l01536"></a>01536

1564

<a name="l01537"></a>01537 switch (btype)

1565

<a name="l01538"></a>01538 {

1566

<a name="l01539"></a>01539 case <a class="code" href="a00115.html#ae87b5c61d7ba6e2e592a279db0b21cc0" title="All other blocks zero.">set_block_azero</a>:

1567

<a name="l01540"></a>01540 case <a class="code" href="a00115.html#aa24e7c08930cf959d383c6b930fb0508" title="End of serialization.">set_block_end</a>:

1568

<a name="l01541"></a>01541 i = bm::set_total_blocks;

1569

<a name="l01542"></a>01542 break;

1570

<a name="l01543"></a>01543 case <a class="code" href="a00115.html#a9e9cf918ca2ebec84eaf844d0e4c8bdb" title="One all-zero block.">set_block_1zero</a>:

1571

<a name="l01544"></a>01544 continue;

1572

<a name="l01545"></a>01545 case <a class="code" href="a00115.html#ac9b85b261ab49b37d5e15b84ed2d8b99" title="Up to 256 zero blocks.">set_block_8zero</a>:

1573

<a name="l01546"></a>01546 nb = dec.get_8();

1574

<a name="l01547"></a>01547 i += nb-1;

1575

<a name="l01548"></a>01548 continue;

1576

<a name="l01549"></a>01549 case <a class="code" href="a00115.html#aef47eda6538ebf2624c1612d35694c01" title="Up to 65536 zero blocks.">set_block_16zero</a>:

1577

<a name="l01550"></a>01550 nb = dec.get_16();

1578

<a name="l01551"></a>01551 i += nb-1;

1579

<a name="l01552"></a>01552 continue;

1580

<a name="l01553"></a>01553 case <a class="code" href="a00115.html#ac7dfbd94a0534df88849bbce9e6c419a" title="Up to 4G zero blocks.">set_block_32zero</a>:

1581

<a name="l01554"></a>01554 nb = dec.get_32();

1582

<a name="l01555"></a>01555 i += nb-1;

1583

<a name="l01556"></a>01556 continue;

1584

<a name="l01557"></a>01557 case <a class="code" href="a00115.html#ad506b63262c52870758432a95e71907e" title="All other blocks one.">set_block_aone</a>:

1585

<a name="l01558"></a>01558 for (;i < bm::set_total_blocks; ++i)

1586

<a name="l01559"></a>01559 {

1587

<a name="l01560"></a>01560 bman.set_block_all_set(i);

1588

<a name="l01561"></a>01561 }

1589

<a name="l01562"></a>01562 break;

1590

<a name="l01563"></a>01563 case <a class="code" href="a00115.html#a715131318a361bcccf59fc0b1e41d444" title="One block all-set (1111...).">set_block_1one</a>:

1591

<a name="l01564"></a>01564 bman.set_block_all_set(i);

1592

<a name="l01565"></a>01565 continue;

1593

<a name="l01566"></a>01566 case <a class="code" href="a00115.html#a57ad1090d6f380cf5de5f98c699b5a75" title="Up to 256 all-set blocks.">set_block_8one</a>:

1594

<a name="l01567"></a>01567 <a class="code" href="a00096.html#a045ab59db462c831654a8acefdf65443">BM_SET_ONE_BLOCKS</a>(dec.get_8());

1595

<a name="l01568"></a>01568 continue;

1596

<a name="l01569"></a>01569 case <a class="code" href="a00115.html#a3fad4a939708df59b1201910c7d37e30" title="UP to 65536 all-set blocks.">set_block_16one</a>:

1597

<a name="l01570"></a>01570 <a class="code" href="a00096.html#a045ab59db462c831654a8acefdf65443">BM_SET_ONE_BLOCKS</a>(dec.get_16());

1598

<a name="l01571"></a>01571 continue;

1599

<a name="l01572"></a>01572 case <a class="code" href="a00115.html#a5b87c58ae617ad1f104b4c6bc3ed6447" title="UP to 4G all-set blocks.">set_block_32one</a>:

1600

<a name="l01573"></a>01573 <a class="code" href="a00096.html#a045ab59db462c831654a8acefdf65443">BM_SET_ONE_BLOCKS</a>(dec.get_32());

1601

<a name="l01574"></a>01574 continue;

1602

<a name="l01575"></a>01575 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

1603

<a name="l01576"></a>01576 {

1604

<a name="l01577"></a>01577 if (blk == 0)

1605

<a name="l01578"></a>01578 {

1606

<a name="l01579"></a>01579 blk = bman.get_allocator().alloc_bit_block();

1607

<a name="l01580"></a>01580 bman.set_block(i, blk);

1608

<a name="l01581"></a>01581 dec.get_32(blk, <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

1609

<a name="l01582"></a>01582 continue;

1610

<a name="l01583"></a>01583 }

1611

<a name="l01584"></a>01584 dec.get_32(temp_block, <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

1612

<a name="l01585"></a>01585 bv.combine_operation_with_block(i,

1613

<a name="l01586"></a>01586 temp_block,

1614

<a name="l01587"></a>01587 0, <a class="code" href="a00115.html#a42405343976ec931388381cea4092bf1a0c8cf0197857d0bd73a63037e2f2c5c5">BM_OR</a>);

1615

<a name="l01588"></a>01588 continue;

1616

<a name="l01589"></a>01589 }

1617

<a name="l01590"></a>01590 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

1618

<a name="l01591"></a>01591 {

1619

<a name="l01592"></a>01592 unsigned bit_idx = dec.get_16();

1620

<a name="l01593"></a>01593 bit_idx += i * <a class="code" href="a00115.html#ae9916f69ced0347d94472d7944ea0e45">bm::bits_in_block</a>;

1621

<a name="l01594"></a>01594 bv.set_bit(bit_idx);

1622

<a name="l01595"></a>01595 continue;

1623

<a name="l01596"></a>01596 }

1624

<a name="l01597"></a>01597 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

1625

<a name="l01598"></a>01598 {

1626

<a name="l01599"></a>01599 //TODO: optimization if block exists

1627

<a name="l01600"></a>01600 <a class="code" href="a00120.html#gaada8b13c35acd8df90129b45edcfc5de" title="Bitblock memset operation.">bit_block_set</a>(temp_block, 0);

1628

<a name="l01601"></a>01601

1629

<a name="l01602"></a>01602 unsigned char run_type = dec.get_8();

1630

<a name="l01603"></a>01603 for (unsigned j = 0; j < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;run_type = !run_type)

1631

<a name="l01604"></a>01604 {

1632

<a name="l01605"></a>01605 unsigned run_length = dec.get_16();

1633

<a name="l01606"></a>01606 if (run_type)

1634

<a name="l01607"></a>01607 {

1635

<a name="l01608"></a>01608 unsigned run_end = j + run_length;

1636

<a name="l01609"></a>01609 for (;j < run_end; ++j)

1637

<a name="l01610"></a>01610 {

1638

<a name="l01611"></a>01611 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

1639

<a name="l01612"></a>01612 temp_block[j] = dec.get_32();

1640

<a name="l01613"></a>01613 }

1641

<a name="l01614"></a>01614 }

1642

<a name="l01615"></a>01615 else

1643

<a name="l01616"></a>01616 {

1644

<a name="l01617"></a>01617 j += run_length;

1645

<a name="l01618"></a>01618 }

1646

<a name="l01619"></a>01619 } // for

1647

<a name="l01620"></a>01620

1648

<a name="l01621"></a>01621 bv.combine_operation_with_block(i,

1649

<a name="l01622"></a>01622 temp_block,

1650

<a name="l01623"></a>01623 0, <a class="code" href="a00115.html#a42405343976ec931388381cea4092bf1a0c8cf0197857d0bd73a63037e2f2c5c5">BM_OR</a>);

1651

<a name="l01624"></a>01624 continue;

1652

<a name="l01625"></a>01625 }

1653

<a name="l01626"></a>01626 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

1654

<a name="l01627"></a>01627 {

1655

<a name="l01628"></a>01628 unsigned head_idx, tail_idx;

1656

<a name="l01629"></a>01629 head_idx = dec.get_16();

1657

<a name="l01630"></a>01630 tail_idx = dec.get_16();

1658

<a name="l01631"></a>01631

1659

<a name="l01632"></a>01632 if (blk == 0)

1660

<a name="l01633"></a>01633 {

1661

<a name="l01634"></a>01634 blk = bman.get_allocator().alloc_bit_block();

1662

<a name="l01635"></a>01635 bman.set_block(i, blk);

1663

<a name="l01636"></a>01636 for (unsigned i = 0; i < head_idx; ++i)

1664

<a name="l01637"></a>01637 {

1665

<a name="l01638"></a>01638 blk[i] = 0;

1666

<a name="l01639"></a>01639 }

1667

<a name="l01640"></a>01640 dec.get_32(blk + head_idx, tail_idx - head_idx + 1);

1668

<a name="l01641"></a>01641 for (unsigned j = tail_idx + 1; j < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++j)

1669

<a name="l01642"></a>01642 {

1670

<a name="l01643"></a>01643 blk[j] = 0;

1671

<a name="l01644"></a>01644 }

1672

<a name="l01645"></a>01645 continue;

1673

<a name="l01646"></a>01646 }

1674

<a name="l01647"></a>01647 <a class="code" href="a00120.html#gaada8b13c35acd8df90129b45edcfc5de" title="Bitblock memset operation.">bit_block_set</a>(temp_block, 0);

1675

<a name="l01648"></a>01648 dec.get_32(temp_block + head_idx, tail_idx - head_idx + 1);

1676

<a name="l01649"></a>01649

1677

<a name="l01650"></a>01650 bv.combine_operation_with_block(i,

1678

<a name="l01651"></a>01651 temp_block,

1679

<a name="l01652"></a>01652 0, <a class="code" href="a00115.html#a42405343976ec931388381cea4092bf1a0c8cf0197857d0bd73a63037e2f2c5c5">BM_OR</a>);

1680

<a name="l01653"></a>01653 continue;

1681

<a name="l01654"></a>01654 }

1682

<a name="l01655"></a>01655 case <a class="code" href="a00115.html#a09b8c4b17b7d6f613c237c46d04a9cd6" title="Plain GAP block.">set_block_gap</a>:

1683

<a name="l01656"></a>01656 case <a class="code" href="a00115.html#a77dc965397e31a1d39c3d8e628792779" title="GAP compressed bitblock.">set_block_gapbit</a>:

1684

<a name="l01657"></a>01657 case <a class="code" href="a00115.html#aae33ceefae804cdd94412beee8c52720" title="List of bits ON (GAP block).">set_block_arrgap</a>:

1685

<a name="l01658"></a>01658 case <a class="code" href="a00115.html#ac47dea3917e15264ed3ba0cf4055adbe" title="Gamma compressed GAP block.">set_block_gap_egamma</a>:

1686

<a name="l01659"></a>01659 case <a class="code" href="a00115.html#a9674ddb1b9ee66948465249688708188" title="Gamma compressed delta GAP array.">set_block_arrgap_egamma</a>:

1687

<a name="l01660"></a>01660 case <a class="code" href="a00115.html#a1caddb62b332a568ba590794800610f6" title="Gamma compressed inverted delta GAP array.">set_block_arrgap_egamma_inv</a>:

1688

<a name="l01661"></a>01661 case <a class="code" href="a00115.html#a746a03f6f5563cc8c75db93bba40095d" title="List of bits OFF (GAP block).">set_block_arrgap_inv</a>:

1689

<a name="l01662"></a>01662 <a class="code" href="a00059.html#a6cb253af926d3b4562d538b6684fb99f">deserialize_gap</a>(btype, dec, bv, bman, i, blk);

1690

<a name="l01663"></a>01663 continue;

1691

<a name="l01664"></a>01664 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

1692

<a name="l01665"></a>01665 {

1693

<a name="l01666"></a>01666 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> len =

1694

<a name="l01667"></a>01667 sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>) == 2 ? dec.get_16() : dec.get_32();

1695

<a name="l01668"></a>01668

1696

<a name="l01669"></a>01669 if (bman.is_block_gap(i))

1697

<a name="l01670"></a>01670 {

1698

<a name="l01671"></a>01671 // Here we most probably does not want to keep

1699

<a name="l01672"></a>01672 // the block GAP since generic bitblock offers better

1700

<a name="l01673"></a>01673 // performance.

1701

<a name="l01674"></a>01674 blk = bman.convert_gap2bitset(i);

1702

<a name="l01675"></a>01675 }

1703

<a name="l01676"></a>01676 else

1704

<a name="l01677"></a>01677 {

1705

<a name="l01678"></a>01678 if (blk == 0) // block does not exists yet

1706

<a name="l01679"></a>01679 {

1707

<a name="l01680"></a>01680 blk = bman.get_allocator().alloc_bit_block();

1708

<a name="l01681"></a>01681 <a class="code" href="a00120.html#gaada8b13c35acd8df90129b45edcfc5de" title="Bitblock memset operation.">bit_block_set</a>(blk, 0);

1709

<a name="l01682"></a>01682 bman.set_block(i, blk);

1710

<a name="l01683"></a>01683 }

1711

<a name="l01684"></a>01684 }

1712

<a name="l01685"></a>01685

1713

<a name="l01686"></a>01686 // Get the array one by one and set the bits.

1714

<a name="l01687"></a>01687 for (unsigned k = 0; k < len; ++k)

1715

<a name="l01688"></a>01688 {

1716

<a name="l01689"></a>01689 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> bit_idx = dec.get_16();

1717

<a name="l01690"></a>01690 <a class="code" href="a00120.html#gad698b5242f5b629aa28e7338b7150497" title="Sets bits to 1 in the bitblock.">or_bit_block</a>(blk, bit_idx, 1);

1718

<a name="l01691"></a>01691 }

1719

<a name="l01692"></a>01692 continue;

1720

<a name="l01693"></a>01693 }

1721

<a name="l01694"></a>01694 default:

1722

<a name="l01695"></a>01695 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0); // unknown block type

1723

<a name="l01696"></a>01696 } // switch

1724

<a name="l01697"></a>01697 } // for i

1725

<a name="l01698"></a>01698

1726

<a name="l01699"></a>01699 return dec.size();

1727

<a name="l01700"></a>01700 }

1728

<a name="l01701"></a>01701

1729

<a name="l01702"></a>01702

1730

<a name="l01703"></a>01703

1731

<a name="l01704"></a>01704 template<class DEC>

1732

<a name="l01705"></a><a class="code" href="a00082.html#a9e501a75575380ecc06eef5b16f6803e">01705</a> <a class="code" href="a00082.html#a9e501a75575380ecc06eef5b16f6803e">serial_stream_iterator<DEC>::serial_stream_iterator</a>(const unsigned char* buf)

1733

<a name="l01706"></a>01706 : decoder_(buf),

1734

<a name="l01707"></a>01707 end_of_stream_(false),

1735

<a name="l01708"></a>01708 bv_size_(0),

1736

<a name="l01709"></a>01709 state_(e_unknown),

1737

<a name="l01710"></a>01710 id_cnt_(0),

1738

<a name="l01711"></a>01711 block_idx_(0),

1739

<a name="l01712"></a>01712 mono_block_cnt_(0)

1740

<a name="l01713"></a>01713 {

1741

<a name="l01714"></a>01714 ::memset(<a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>, 0, sizeof(<a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>));

1742

<a name="l01715"></a>01715

1743

<a name="l01716"></a>01716 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a949fba4d9b152e1cbba9a450e05e21a3">bm::set_AND</a>] =

1744

<a name="l01717"></a>01717 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_AND</a>;

1745

<a name="l01718"></a>01718 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a34150dd6a8ac2e70b887565bd1c3f788">bm::set_ASSIGN</a>] =

1746

<a name="l01719"></a>01719 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_ASSIGN</a>;

1747

<a name="l01720"></a>01720 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a05d88a2639cbd3d2ac63436df3ed6780">bm::set_OR</a>] =

1748

<a name="l01721"></a>01721 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_OR</a>;

1749

<a name="l01722"></a>01722 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a348f23af148237ac49194815b222b769">bm::set_SUB</a>] =

1750

<a name="l01723"></a>01723 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_SUB</a>;

1751

<a name="l01724"></a>01724 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109ab823123a0d630167532a96be004e6304">bm::set_XOR</a>] =

1752

<a name="l01725"></a>01725 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_XOR</a>;

1753

<a name="l01726"></a>01726 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a3f165b7944e33214e8721aaf2eb8378e">bm::set_COUNT</a>] =

1754

<a name="l01727"></a>01727 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_COUNT</a>;

1755

<a name="l01728"></a>01728 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a378be4b14cee6a341e859fd3157ab959">bm::set_COUNT_AND</a>] =

1756

<a name="l01729"></a>01729 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_COUNT_AND</a>;

1757

<a name="l01730"></a>01730 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a1373054e4f243dffb762a55b8a8bfe4c">bm::set_COUNT_XOR</a>] =

1758

<a name="l01731"></a>01731 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_COUNT_XOR</a>;

1759

<a name="l01732"></a>01732 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a27e34c148d06e3d8a405482d820cd7fb">bm::set_COUNT_OR</a>] =

1760

<a name="l01733"></a>01733 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_COUNT_OR</a>;

1761

<a name="l01734"></a>01734 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a0028cc7084b37fe66ce5ae459b93b7f1">bm::set_COUNT_SUB_AB</a>] =

1762

<a name="l01735"></a>01735 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_COUNT_SUB_AB</a>;

1763

<a name="l01736"></a>01736 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2f7b894c11c058598d02722a7eeef03b">bm::set_COUNT_SUB_BA</a>] =

1764

<a name="l01737"></a>01737 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_COUNT_SUB_BA</a>;

1765

<a name="l01738"></a>01738 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109abafe8a971864164aeec7f43d1205ed29">bm::set_COUNT_A</a>] =

1766

<a name="l01739"></a>01739 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_COUNT_A</a>;

1767

<a name="l01740"></a>01740 <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[<a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2ac4eb7f41d00f8387d5dd3ffb9d0617">bm::set_COUNT_B</a>] =

1768

<a name="l01741"></a>01741 &<a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_iterator<DEC>::get_bit_block_COUNT</a>;

1769

<a name="l01742"></a>01742

1770

<a name="l01743"></a>01743

1771

<a name="l01744"></a>01744 // reading stream header

1772

<a name="l01745"></a>01745 unsigned char header_flag = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

1773

<a name="l01746"></a>01746 if (!(header_flag & <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a6b127bde401907318702dd4827c8f74e" title="no byte-order">BM_HM_NO_BO</a>))

1774

<a name="l01747"></a>01747 {

1775

<a name="l01748"></a>01748 /*ByteOrder bo = (bm::ByteOrder)*/<a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

1776

<a name="l01749"></a>01749 }

1777

<a name="l01750"></a>01750

1778

<a name="l01751"></a>01751 // check if bitvector comes as an inverted, sorted list of ints

1779

<a name="l01752"></a>01752 //

1780

<a name="l01753"></a>01753 if (header_flag & <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a64c44c57a6f8b8e89f0916db9e120d47" title="id list stored">BM_HM_ID_LIST</a>)

1781

<a name="l01754"></a>01754 {

1782

<a name="l01755"></a>01755 // special case: the next comes plain list of unsigned integers

1783

<a name="l01756"></a>01756 if (header_flag & <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0af4fbefa0ed0a8ff42dd664f120782c27" title="resized vector">BM_HM_RESIZE</a>)

1784

<a name="l01757"></a>01757 {

1785

<a name="l01758"></a>01758 <a class="code" href="a00082.html#ac072ca059c8daba51bd31e58163e70d9">bv_size_</a> = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

1786

<a name="l01759"></a>01759 }

1787

<a name="l01760"></a>01760

1788

<a name="l01761"></a>01761 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab6ede49403e43a05b42471f52ba5aa6a" title="plain int array">e_list_ids</a>;

1789

<a name="l01762"></a>01762 <a class="code" href="a00082.html#a51489bf49b30c51c655dac89edc747f9" title="Id counter for id list.">id_cnt_</a> = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

1790

<a name="l01763"></a>01763 <a class="code" href="a00082.html#a3bc99255525bf5f7234de9f60a7306fe" title="get next block">next</a>(); // read first id

1791

<a name="l01764"></a>01764 }

1792

<a name="l01765"></a>01765 else

1793

<a name="l01766"></a>01766 {

1794

<a name="l01767"></a>01767 if (!(header_flag & <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a04c714af376c203bc8b082856ad622a3" title="no GAP levels">BM_HM_NO_GAPL</a>))

1795

<a name="l01768"></a>01768 {

1796

<a name="l01769"></a>01769 unsigned i;

1797

<a name="l01770"></a>01770 // keep GAP levels info

1798

<a name="l01771"></a>01771 for (i = 0; i < <a class="code" href="a00115.html#a773e9f5341919d58000bd54d50038733">bm::gap_levels</a>; ++i)

1799

<a name="l01772"></a>01772 {

1800

<a name="l01773"></a>01773 <a class="code" href="a00082.html#a8766613e7480049708773baa227c36a4" title="GAP levels.">glevels_</a>[i] = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

1801

<a name="l01774"></a>01774 }

1802

<a name="l01775"></a>01775 }

1803

<a name="l01776"></a>01776

1804

<a name="l01777"></a>01777 if (header_flag & (1 << 1))

1805

<a name="l01778"></a>01778 {

1806

<a name="l01779"></a>01779 <a class="code" href="a00082.html#ac072ca059c8daba51bd31e58163e70d9">bv_size_</a> = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

1807

<a name="l01780"></a>01780 }

1808

<a name="l01781"></a>01781 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969daacf85c8ad242bcce343b482ea6e005b9" title="stream of blocks">e_blocks</a>;

1809

<a name="l01782"></a>01782 }

1810

<a name="l01783"></a>01783 }

1811

<a name="l01784"></a>01784

1812

<a name="l01785"></a>01785 template<class DEC>

1813

<a name="l01786"></a><a class="code" href="a00082.html#a3bc99255525bf5f7234de9f60a7306fe">01786</a> void <a class="code" href="a00082.html#a3bc99255525bf5f7234de9f60a7306fe" title="get next block">serial_stream_iterator<DEC>::next</a>()

1814

<a name="l01787"></a>01787 {

1815

<a name="l01788"></a>01788 if (<a class="code" href="a00082.html#a936d9d1b031285de6212afc3980ac1d9" title="Returns true if end of bit-stream reached.">is_eof</a>()) return;

1816

<a name="l01789"></a>01789

1817

<a name="l01790"></a>01790 switch (<a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a>)

1818

<a name="l01791"></a>01791 {

1819

<a name="l01792"></a>01792 case <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab6ede49403e43a05b42471f52ba5aa6a" title="plain int array">e_list_ids</a>:

1820

<a name="l01793"></a>01793 // read inverted ids one by one

1821

<a name="l01794"></a>01794 if (<a class="code" href="a00082.html#a51489bf49b30c51c655dac89edc747f9" title="Id counter for id list.">id_cnt_</a> == 0)

1822

<a name="l01795"></a>01795 {

1823

<a name="l01796"></a>01796 <a class="code" href="a00082.html#a215d5acc44c43872067e66c954d39b77">end_of_stream_</a> = true;

1824

<a name="l01797"></a>01797 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dacdf6d77d700b98e0f7ef675ac7cf7472">e_unknown</a>;

1825

<a name="l01798"></a>01798 break;

1826

<a name="l01799"></a>01799 }

1827

<a name="l01800"></a>01800 <a class="code" href="a00082.html#ac93130d81ed3ffa16a4ce52d2060bc14" title="Last id from the id list.">last_id_</a> = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

1828

<a name="l01801"></a>01801 --<a class="code" href="a00082.html#a51489bf49b30c51c655dac89edc747f9" title="Id counter for id list.">id_cnt_</a>;

1829

<a name="l01802"></a>01802 break;

1830

<a name="l01803"></a>01803

1831

<a name="l01804"></a>01804 case <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969daacf85c8ad242bcce343b482ea6e005b9" title="stream of blocks">e_blocks</a>:

1832

<a name="l01805"></a>01805 if (<a class="code" href="a00082.html#a885a7eea86b5ac64196a1ed0804ae608" title="current block index">block_idx_</a> == <a class="code" href="a00115.html#a505011007f54598794e0b9477c0b0b11">bm::set_total_blocks</a>)

1833

<a name="l01806"></a>01806 {

1834

<a name="l01807"></a>01807 <a class="code" href="a00082.html#a215d5acc44c43872067e66c954d39b77">end_of_stream_</a> = true;

1835

<a name="l01808"></a>01808 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dacdf6d77d700b98e0f7ef675ac7cf7472">e_unknown</a>;

1836

<a name="l01809"></a>01809 break;

1837

<a name="l01810"></a>01810 }

1838

<a name="l01811"></a>01811

1839

<a name="l01812"></a>01812 <a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a> = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

1840

<a name="l01813"></a>01813

1841

<a name="l01814"></a>01814 // pre-check for 7-bit zero block

1842

<a name="l01815"></a>01815 //

1843

<a name="l01816"></a>01816 if (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a> & (1 << 7))

1844

<a name="l01817"></a>01817 {

1845

<a name="l01818"></a>01818 <a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a> = (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a> & ~(1 << 7)) - 1;

1846

<a name="l01819"></a>01819 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab46381e6794e6c0140563a03f8adf74b" title="one or more zero bit blocks">e_zero_blocks</a>;

1847

<a name="l01820"></a>01820 break;

1848

<a name="l01821"></a>01821 }

1849

<a name="l01822"></a>01822

1850

<a name="l01823"></a>01823 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

1851

<a name="l01824"></a>01824 {

1852

<a name="l01825"></a>01825 case <a class="code" href="a00115.html#ae87b5c61d7ba6e2e592a279db0b21cc0" title="All other blocks zero.">set_block_azero</a>:

1853

<a name="l01826"></a>01826 case <a class="code" href="a00115.html#aa24e7c08930cf959d383c6b930fb0508" title="End of serialization.">set_block_end</a>:

1854

<a name="l01827"></a>01827 <a class="code" href="a00082.html#a215d5acc44c43872067e66c954d39b77">end_of_stream_</a> = true; <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dacdf6d77d700b98e0f7ef675ac7cf7472">e_unknown</a>;

1855

<a name="l01828"></a>01828 break;

1856

<a name="l01829"></a>01829 case <a class="code" href="a00115.html#a9e9cf918ca2ebec84eaf844d0e4c8bdb" title="One all-zero block.">set_block_1zero</a>:

1857

<a name="l01830"></a>01830 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab46381e6794e6c0140563a03f8adf74b" title="one or more zero bit blocks">e_zero_blocks</a>;

1858

<a name="l01831"></a>01831 <a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a> = 0;

1859

<a name="l01832"></a>01832 break;

1860

<a name="l01833"></a>01833 case <a class="code" href="a00115.html#ac9b85b261ab49b37d5e15b84ed2d8b99" title="Up to 256 zero blocks.">set_block_8zero</a>:

1861

<a name="l01834"></a>01834 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab46381e6794e6c0140563a03f8adf74b" title="one or more zero bit blocks">e_zero_blocks</a>;

1862

<a name="l01835"></a>01835 <a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a> = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8()-1;

1863

<a name="l01836"></a>01836 break;

1864

<a name="l01837"></a>01837 case <a class="code" href="a00115.html#aef47eda6538ebf2624c1612d35694c01" title="Up to 65536 zero blocks.">set_block_16zero</a>:

1865

<a name="l01838"></a>01838 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab46381e6794e6c0140563a03f8adf74b" title="one or more zero bit blocks">e_zero_blocks</a>;

1866

<a name="l01839"></a>01839 <a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a> = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16()-1;

1867

<a name="l01840"></a>01840 break;

1868

<a name="l01841"></a>01841 case <a class="code" href="a00115.html#ac7dfbd94a0534df88849bbce9e6c419a" title="Up to 4G zero blocks.">set_block_32zero</a>:

1869

<a name="l01842"></a>01842 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab46381e6794e6c0140563a03f8adf74b" title="one or more zero bit blocks">e_zero_blocks</a>;

1870

<a name="l01843"></a>01843 <a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a> = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32()-1;

1871

<a name="l01844"></a>01844 break;

1872

<a name="l01845"></a>01845 case <a class="code" href="a00115.html#ad506b63262c52870758432a95e71907e" title="All other blocks one.">set_block_aone</a>:

1873

<a name="l01846"></a>01846 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da7c1327cbc332f6d7fe96fc1dbed7da30" title="one or more all-1 bit blocks">e_one_blocks</a>;

1874

<a name="l01847"></a>01847 <a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a> = <a class="code" href="a00115.html#a505011007f54598794e0b9477c0b0b11">bm::set_total_blocks</a> - <a class="code" href="a00082.html#a885a7eea86b5ac64196a1ed0804ae608" title="current block index">block_idx_</a>;

1875

<a name="l01848"></a>01848 break;

1876

<a name="l01849"></a>01849 case <a class="code" href="a00115.html#a715131318a361bcccf59fc0b1e41d444" title="One block all-set (1111...).">set_block_1one</a>:

1877

<a name="l01850"></a>01850 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da7c1327cbc332f6d7fe96fc1dbed7da30" title="one or more all-1 bit blocks">e_one_blocks</a>;

1878

<a name="l01851"></a>01851 <a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a> = 0;

1879

<a name="l01852"></a>01852 break;

1880

<a name="l01853"></a>01853 case <a class="code" href="a00115.html#a57ad1090d6f380cf5de5f98c699b5a75" title="Up to 256 all-set blocks.">set_block_8one</a>:

1881

<a name="l01854"></a>01854 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da7c1327cbc332f6d7fe96fc1dbed7da30" title="one or more all-1 bit blocks">e_one_blocks</a>;

1882

<a name="l01855"></a>01855 <a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a> = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8()-1;

1883

<a name="l01856"></a>01856 break;

1884

<a name="l01857"></a>01857 case <a class="code" href="a00115.html#a3fad4a939708df59b1201910c7d37e30" title="UP to 65536 all-set blocks.">set_block_16one</a>:

1885

<a name="l01858"></a>01858 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da7c1327cbc332f6d7fe96fc1dbed7da30" title="one or more all-1 bit blocks">e_one_blocks</a>;

1886

<a name="l01859"></a>01859 <a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a> = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16()-1;

1887

<a name="l01860"></a>01860 break;

1888

<a name="l01861"></a>01861 case <a class="code" href="a00115.html#a5b87c58ae617ad1f104b4c6bc3ed6447" title="UP to 4G all-set blocks.">set_block_32one</a>:

1889

<a name="l01862"></a>01862 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da7c1327cbc332f6d7fe96fc1dbed7da30" title="one or more all-1 bit blocks">e_one_blocks</a>;

1890

<a name="l01863"></a>01863 <a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a> = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32()-1;

1891

<a name="l01864"></a>01864 break;

1892

<a name="l01865"></a>01865

1893

<a name="l01866"></a>01866 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

1894

<a name="l01867"></a>01867 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

1895

<a name="l01868"></a>01868 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

1896

<a name="l01869"></a>01869 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

1897

<a name="l01870"></a>01870 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>: // TODO: better make it GAP

1898

<a name="l01871"></a>01871 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>;

1899

<a name="l01872"></a>01872 break;

1900

<a name="l01873"></a>01873

1901

<a name="l01874"></a>01874 case <a class="code" href="a00115.html#a09b8c4b17b7d6f613c237c46d04a9cd6" title="Plain GAP block.">set_block_gap</a>:

1902

<a name="l01875"></a>01875 case <a class="code" href="a00115.html#ac47dea3917e15264ed3ba0cf4055adbe" title="Gamma compressed GAP block.">set_block_gap_egamma</a>:

1903

<a name="l01876"></a>01876 <a class="code" href="a00082.html#a5b7762f08b50525283c45531d9538f4f">gap_head_</a> =

1904

<a name="l01877"></a>01877 sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>) == 2 ?

1905

<a name="l01878"></a>01878 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16() : <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

1906

<a name="l01879"></a>01879 case <a class="code" href="a00115.html#aae33ceefae804cdd94412beee8c52720" title="List of bits ON (GAP block).">set_block_arrgap</a>:

1907

<a name="l01880"></a>01880 case <a class="code" href="a00115.html#a9674ddb1b9ee66948465249688708188" title="Gamma compressed delta GAP array.">set_block_arrgap_egamma</a>:

1908

<a name="l01881"></a>01881 case <a class="code" href="a00115.html#a1caddb62b332a568ba590794800610f6" title="Gamma compressed inverted delta GAP array.">set_block_arrgap_egamma_inv</a>:

1909

<a name="l01882"></a>01882 case <a class="code" href="a00115.html#a746a03f6f5563cc8c75db93bba40095d" title="List of bits OFF (GAP block).">set_block_arrgap_inv</a>:

1910

<a name="l01883"></a>01883 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da6b1a1c20945bd0813ceae6d689591d0d" title="one gap block">e_gap_block</a>;

1911

<a name="l01884"></a>01884 break;

1912

<a name="l01885"></a>01885 case <a class="code" href="a00115.html#a77dc965397e31a1d39c3d8e628792779" title="GAP compressed bitblock.">set_block_gapbit</a>:

1913

<a name="l01886"></a>01886 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>; // TODO: make a better decision here

1914

<a name="l01887"></a>01887 break;

1915

<a name="l01888"></a>01888

1916

<a name="l01889"></a>01889 default:

1917

<a name="l01890"></a>01890 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

1918

<a name="l01891"></a>01891 }// switch

1919

<a name="l01892"></a>01892

1920

<a name="l01893"></a>01893 break;

1921

<a name="l01894"></a>01894

1922

<a name="l01895"></a>01895 case <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dab46381e6794e6c0140563a03f8adf74b" title="one or more zero bit blocks">e_zero_blocks</a>:

1923

<a name="l01896"></a>01896 case <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da7c1327cbc332f6d7fe96fc1dbed7da30" title="one or more all-1 bit blocks">e_one_blocks</a>:

1924

<a name="l01897"></a>01897 ++<a class="code" href="a00082.html#a885a7eea86b5ac64196a1ed0804ae608" title="current block index">block_idx_</a>;

1925

<a name="l01898"></a>01898 if (!<a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a>)

1926

<a name="l01899"></a>01899 {

1927

<a name="l01900"></a>01900 <a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969daacf85c8ad242bcce343b482ea6e005b9" title="stream of blocks">e_blocks</a>; // get new block token

1928

<a name="l01901"></a>01901 break;

1929

<a name="l01902"></a>01902 }

1930

<a name="l01903"></a>01903 --<a class="code" href="a00082.html#a2ecf26428d4bb4aa23ad071c164ade12" title="number of 0 or 1 blocks">mono_block_cnt_</a>;

1931

<a name="l01904"></a>01904 break;

1932

<a name="l01905"></a>01905

1933

<a name="l01906"></a>01906 case <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dacdf6d77d700b98e0f7ef675ac7cf7472">e_unknown</a>:

1934

<a name="l01907"></a>01907 default:

1935

<a name="l01908"></a>01908 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

1936

<a name="l01909"></a>01909 } // switch

1937

<a name="l01910"></a>01910 }

1938

<a name="l01911"></a>01911

1939

<a name="l01912"></a>01912

1940

<a name="l01913"></a>01913

1941

<a name="l01914"></a>01914 template<class DEC>

1942

<a name="l01915"></a>01915 unsigned

1943

<a name="l01916"></a><a class="code" href="a00082.html#aedd6dd2b98c7a95874d36fa898c22e2e">01916</a> <a class="code" href="a00082.html#aedd6dd2b98c7a95874d36fa898c22e2e">serial_stream_iterator<DEC>::get_bit_block_ASSIGN</a>(

1944

<a name="l01917"></a>01917 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

1945

<a name="l01918"></a>01918 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* /*tmp_block*/)

1946

<a name="l01919"></a>01919 {

1947

<a name="l01920"></a>01920 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

1948

<a name="l01921"></a>01921 unsigned count = 0;

1949

<a name="l01922"></a>01922

1950

<a name="l01923"></a>01923 switch (this-><a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

1951

<a name="l01924"></a>01924 {

1952

<a name="l01925"></a>01925 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

1953

<a name="l01926"></a>01926 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32(dst_block, <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

1954

<a name="l01927"></a>01927 break;

1955

<a name="l01928"></a>01928 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

1956

<a name="l01929"></a>01929 {

1957

<a name="l01930"></a>01930 if (dst_block)

1958

<a name="l01931"></a>01931 <a class="code" href="a00120.html#gaada8b13c35acd8df90129b45edcfc5de" title="Bitblock memset operation.">bit_block_set</a>(dst_block, 0);

1959

<a name="l01932"></a>01932 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

1960

<a name="l01933"></a>01933 for (unsigned j = 0; j < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;run_type = !run_type)

1961

<a name="l01934"></a>01934 {

1962

<a name="l01935"></a>01935 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

1963

<a name="l01936"></a>01936 if (run_type)

1964

<a name="l01937"></a>01937 {

1965

<a name="l01938"></a>01938 unsigned run_end = j + run_length;

1966

<a name="l01939"></a>01939 if (dst_block)

1967

<a name="l01940"></a>01940 {

1968

<a name="l01941"></a>01941 for (;j < run_end; ++j)

1969

<a name="l01942"></a>01942 {

1970

<a name="l01943"></a>01943 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

1971

<a name="l01944"></a>01944 dst_block[j] = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

1972

<a name="l01945"></a>01945 }

1973

<a name="l01946"></a>01946 }

1974

<a name="l01947"></a>01947 else

1975

<a name="l01948"></a>01948 {

1976

<a name="l01949"></a>01949 // TODO: use decoder_.seek()

1977

<a name="l01950"></a>01950 for (;j < run_end; ++j)

1978

<a name="l01951"></a>01951 {

1979

<a name="l01952"></a>01952 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

1980

<a name="l01953"></a>01953 }

1981

<a name="l01954"></a>01954 }

1982

<a name="l01955"></a>01955 }

1983

<a name="l01956"></a>01956 else

1984

<a name="l01957"></a>01957 {

1985

<a name="l01958"></a>01958 j += run_length;

1986

<a name="l01959"></a>01959 }

1987

<a name="l01960"></a>01960 } // for

1988

<a name="l01961"></a>01961 }

1989

<a name="l01962"></a>01962 break;

1990

<a name="l01963"></a>01963 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

1991

<a name="l01964"></a>01964 {

1992

<a name="l01965"></a>01965 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

1993

<a name="l01966"></a>01966 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

1994

<a name="l01967"></a>01967 if (dst_block)

1995

<a name="l01968"></a>01968 {

1996

<a name="l01969"></a>01969 for (unsigned i = 0; i < head_idx; ++i)

1997

<a name="l01970"></a>01970 dst_block[i] = 0;

1998

<a name="l01971"></a>01971 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32(dst_block + head_idx,

1999

<a name="l01972"></a>01972 tail_idx - head_idx + 1);

2000

<a name="l01973"></a>01973 for (unsigned j = tail_idx + 1; j < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++j)

2001

<a name="l01974"></a>01974 dst_block[j] = 0;

2002

<a name="l01975"></a>01975 }

2003

<a name="l01976"></a>01976 else

2004

<a name="l01977"></a>01977 {

2005

<a name="l01978"></a>01978 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.seek((tail_idx - head_idx + 1) * 4);

2006

<a name="l01979"></a>01979 }

2007

<a name="l01980"></a>01980 }

2008

<a name="l01981"></a>01981 break;

2009

<a name="l01982"></a>01982 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2010

<a name="l01983"></a>01983 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2011

<a name="l01984"></a>01984 <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(dst_block, true /*clear target*/);

2012

<a name="l01985"></a>01985 break;

2013

<a name="l01986"></a>01986 case <a class="code" href="a00115.html#a77dc965397e31a1d39c3d8e628792779" title="GAP compressed bitblock.">set_block_gapbit</a>:

2014

<a name="l01987"></a>01987 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2015

<a name="l01988"></a>01988 break;

2016

<a name="l01989"></a>01989 default:

2017

<a name="l01990"></a>01990 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2018

<a name="l01991"></a>01991 } // switch

2019

<a name="l01992"></a>01992 return count;

2020

<a name="l01993"></a>01993 }

2021

<a name="l01994"></a>01994

2022

<a name="l01995"></a>01995 template<class DEC>

2023

<a name="l01996"></a>01996 unsigned

2024

<a name="l01997"></a><a class="code" href="a00082.html#a8090cd3fd801c9daafb2b2488419ca3b">01997</a> <a class="code" href="a00082.html#a8090cd3fd801c9daafb2b2488419ca3b">serial_stream_iterator<DEC>::get_bit_block_OR</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2025

<a name="l01998"></a>01998 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* /*tmp_block*/)

2026

<a name="l01999"></a>01999 {

2027

<a name="l02000"></a>02000 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2028

<a name="l02001"></a>02001 unsigned count = 0;

2029

<a name="l02002"></a>02002 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

2030

<a name="l02003"></a>02003 {

2031

<a name="l02004"></a>02004 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

2032

<a name="l02005"></a>02005 {

2033

<a name="l02006"></a>02006 <a class="code" href="a00036.html" title="Bit-block get adapter, takes bitblock and represents it as a get_32() accessor function...">bitblock_get_adapter</a> ga(dst_block);

2034

<a name="l02007"></a>02007 <a class="code" href="a00030.html" title="Bit OR functor.">bit_OR<bm::word_t></a> func;

2035

<a name="l02008"></a>02008 <a class="code" href="a00037.html" title="Bit-block store adapter, takes bitblock and saves results into it /internal.">bitblock_store_adapter</a> sa(dst_block);

2036

<a name="l02009"></a>02009

2037

<a name="l02010"></a>02010 <a class="code" href="a00115.html#a503fecc0ee281059897412d68f489e1e">bit_recomb</a>(ga,

2038

<a name="l02011"></a>02011 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>,

2039

<a name="l02012"></a>02012 func,

2040

<a name="l02013"></a>02013 sa

2041

<a name="l02014"></a>02014 );

2042

<a name="l02015"></a>02015 }

2043

<a name="l02016"></a>02016 break;

2044

<a name="l02017"></a>02017 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

2045

<a name="l02018"></a>02018 {

2046

<a name="l02019"></a>02019 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2047

<a name="l02020"></a>02020 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2048

<a name="l02021"></a>02021 for (unsigned i = head_idx; i <= tail_idx; ++i)

2049

<a name="l02022"></a>02022 dst_block[i] |= <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2050

<a name="l02023"></a>02023 }

2051

<a name="l02024"></a>02024 break;

2052

<a name="l02025"></a>02025 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

2053

<a name="l02026"></a>02026 {

2054

<a name="l02027"></a>02027 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

2055

<a name="l02028"></a>02028 for (unsigned j = 0; j < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;run_type = !run_type)

2056

<a name="l02029"></a>02029 {

2057

<a name="l02030"></a>02030 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2058

<a name="l02031"></a>02031 if (run_type)

2059

<a name="l02032"></a>02032 {

2060

<a name="l02033"></a>02033 unsigned run_end = j + run_length;

2061

<a name="l02034"></a>02034 for (;j < run_end; ++j)

2062

<a name="l02035"></a>02035 {

2063

<a name="l02036"></a>02036 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2064

<a name="l02037"></a>02037 dst_block[j] |= <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2065

<a name="l02038"></a>02038 }

2066

<a name="l02039"></a>02039 }

2067

<a name="l02040"></a>02040 else

2068

<a name="l02041"></a>02041 {

2069

<a name="l02042"></a>02042 j += run_length;

2070

<a name="l02043"></a>02043 }

2071

<a name="l02044"></a>02044 } // for

2072

<a name="l02045"></a>02045 }

2073

<a name="l02046"></a>02046 break;

2074

<a name="l02047"></a>02047 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2075

<a name="l02048"></a>02048 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2076

<a name="l02049"></a>02049 <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(dst_block, false /*don't clear target*/);

2077

<a name="l02050"></a>02050 break;

2078

<a name="l02051"></a>02051 default:

2079

<a name="l02052"></a>02052 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2080

<a name="l02053"></a>02053 } // switch

2081

<a name="l02054"></a>02054 return count;

2082

<a name="l02055"></a>02055 }

2083

<a name="l02056"></a>02056

2084

<a name="l02057"></a>02057 template<class DEC>

2085

<a name="l02058"></a>02058 unsigned

2086

<a name="l02059"></a><a class="code" href="a00082.html#aaff6b770723d70a5d7f4da8a3d6b1658">02059</a> <a class="code" href="a00082.html#aaff6b770723d70a5d7f4da8a3d6b1658">serial_stream_iterator<DEC>::get_bit_block_AND</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2087

<a name="l02060"></a>02060 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block)

2088

<a name="l02061"></a>02061 {

2089

<a name="l02062"></a>02062 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2090

<a name="l02063"></a>02063 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst_block != tmp_block);

2091

<a name="l02064"></a>02064

2092

<a name="l02065"></a>02065 unsigned count = 0;

2093

<a name="l02066"></a>02066 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

2094

<a name="l02067"></a>02067 {

2095

<a name="l02068"></a>02068 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

2096

<a name="l02069"></a>02069 for (unsigned i = 0; i < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++i)

2097

<a name="l02070"></a>02070 dst_block[i] &= <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2098

<a name="l02071"></a>02071 break;

2099

<a name="l02072"></a>02072 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

2100

<a name="l02073"></a>02073 {

2101

<a name="l02074"></a>02074 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

2102

<a name="l02075"></a>02075 for (unsigned j = 0; j < bm::set_block_size;run_type = !run_type)

2103

<a name="l02076"></a>02076 {

2104

<a name="l02077"></a>02077 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2105

<a name="l02078"></a>02078 unsigned run_end = j + run_length;

2106

<a name="l02079"></a>02079 if (run_type)

2107

<a name="l02080"></a>02080 {

2108

<a name="l02081"></a>02081 for (;j < run_end; ++j)

2109

<a name="l02082"></a>02082 {

2110

<a name="l02083"></a>02083 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2111

<a name="l02084"></a>02084 dst_block[j] &= <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2112

<a name="l02085"></a>02085 }

2113

<a name="l02086"></a>02086 }

2114

<a name="l02087"></a>02087 else

2115

<a name="l02088"></a>02088 {

2116

<a name="l02089"></a>02089 for (;j < run_end; ++j)

2117

<a name="l02090"></a>02090 {

2118

<a name="l02091"></a>02091 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2119

<a name="l02092"></a>02092 dst_block[j] = 0;

2120

<a name="l02093"></a>02093 }

2121

<a name="l02094"></a>02094 }

2122

<a name="l02095"></a>02095 } // for

2123

<a name="l02096"></a>02096 }

2124

<a name="l02097"></a>02097 break;

2125

<a name="l02098"></a>02098 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

2126

<a name="l02099"></a>02099 {

2127

<a name="l02100"></a>02100 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2128

<a name="l02101"></a>02101 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2129

<a name="l02102"></a>02102 unsigned i;

2130

<a name="l02103"></a>02103 for ( i = 0; i < head_idx; ++i)

2131

<a name="l02104"></a>02104 dst_block[i] = 0;

2132

<a name="l02105"></a>02105 for ( i = head_idx; i <= tail_idx; ++i)

2133

<a name="l02106"></a>02106 dst_block[i] &= <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2134

<a name="l02107"></a>02107 for ( i = tail_idx + 1; i < bm::set_block_size; ++i)

2135

<a name="l02108"></a>02108 dst_block[i] = 0;

2136

<a name="l02109"></a>02109 }

2137

<a name="l02110"></a>02110 break;

2138

<a name="l02111"></a>02111 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2139

<a name="l02112"></a>02112 // TODO: optimization

2140

<a name="l02113"></a>02113 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2141

<a name="l02114"></a>02114 <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(tmp_block, true /*clear target*/);

2142

<a name="l02115"></a>02115 if (dst_block)

2143

<a name="l02116"></a>02116 <a class="code" href="a00120.html#ga882f79df0a0175ad4ddf483c5f1eeb0e" title="Plain bitblock AND operation. Function does not analyse availability of source and...">bit_block_and</a>(dst_block, tmp_block);

2144

<a name="l02117"></a>02117 break;

2145

<a name="l02118"></a>02118 default:

2146

<a name="l02119"></a>02119 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2147

<a name="l02120"></a>02120 } // switch

2148

<a name="l02121"></a>02121 return count;

2149

<a name="l02122"></a>02122 }

2150

<a name="l02123"></a>02123

2151

<a name="l02124"></a>02124 template<class DEC>

2152

<a name="l02125"></a>02125 unsigned

2153

<a name="l02126"></a><a class="code" href="a00082.html#a16cc519db4297666ea520d68769b5aa1">02126</a> <a class="code" href="a00082.html#a16cc519db4297666ea520d68769b5aa1">serial_stream_iterator<DEC>::get_bit_block_XOR</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2154

<a name="l02127"></a>02127 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block)

2155

<a name="l02128"></a>02128 {

2156

<a name="l02129"></a>02129 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2157

<a name="l02130"></a>02130 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst_block != tmp_block);

2158

<a name="l02131"></a>02131

2159

<a name="l02132"></a>02132 unsigned count = 0;

2160

<a name="l02133"></a>02133 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

2161

<a name="l02134"></a>02134 {

2162

<a name="l02135"></a>02135 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

2163

<a name="l02136"></a>02136 for (unsigned i = 0; i < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++i)

2164

<a name="l02137"></a>02137 dst_block[i] ^= <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2165

<a name="l02138"></a>02138 break;

2166

<a name="l02139"></a>02139 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

2167

<a name="l02140"></a>02140 {

2168

<a name="l02141"></a>02141 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

2169

<a name="l02142"></a>02142 for (unsigned j = 0; j < bm::set_block_size;run_type = !run_type)

2170

<a name="l02143"></a>02143 {

2171

<a name="l02144"></a>02144 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2172

<a name="l02145"></a>02145 if (run_type)

2173

<a name="l02146"></a>02146 {

2174

<a name="l02147"></a>02147 unsigned run_end = j + run_length;

2175

<a name="l02148"></a>02148 for (;j < run_end; ++j)

2176

<a name="l02149"></a>02149 {

2177

<a name="l02150"></a>02150 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2178

<a name="l02151"></a>02151 dst_block[j] ^= <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2179

<a name="l02152"></a>02152 }

2180

<a name="l02153"></a>02153 }

2181

<a name="l02154"></a>02154 else

2182

<a name="l02155"></a>02155 {

2183

<a name="l02156"></a>02156 j += run_length;

2184

<a name="l02157"></a>02157 }

2185

<a name="l02158"></a>02158 } // for

2186

<a name="l02159"></a>02159 }

2187

<a name="l02160"></a>02160 break;

2188

<a name="l02161"></a>02161 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

2189

<a name="l02162"></a>02162 {

2190

<a name="l02163"></a>02163 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2191

<a name="l02164"></a>02164 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2192

<a name="l02165"></a>02165 for (unsigned i = head_idx; i <= tail_idx; ++i)

2193

<a name="l02166"></a>02166 dst_block[i] ^= <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2194

<a name="l02167"></a>02167 }

2195

<a name="l02168"></a>02168 break;

2196

<a name="l02169"></a>02169 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2197

<a name="l02170"></a>02170 // TODO: optimization

2198

<a name="l02171"></a>02171 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2199

<a name="l02172"></a>02172 <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(tmp_block, true /*clear target*/);

2200

<a name="l02173"></a>02173 if (dst_block)

2201

<a name="l02174"></a>02174 {

2202

<a name="l02175"></a>02175 <a class="code" href="a00120.html#gae6a46c5e671ea1c9312219ceb41025ef" title="Plain bitblock XOR operation. Function does not analyse availability of source and...">bit_block_xor</a>(dst_block, tmp_block);

2203

<a name="l02176"></a>02176 }

2204

<a name="l02177"></a>02177 break;

2205

<a name="l02178"></a>02178 default:

2206

<a name="l02179"></a>02179 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2207

<a name="l02180"></a>02180 } // switch

2208

<a name="l02181"></a>02181 return count;

2209

<a name="l02182"></a>02182 }

2210

<a name="l02183"></a>02183

2211

<a name="l02184"></a>02184 template<class DEC>

2212

<a name="l02185"></a>02185 unsigned

2213

<a name="l02186"></a><a class="code" href="a00082.html#a22bac3f98b0c07cf3a2f6aa6fa1e0322">02186</a> <a class="code" href="a00082.html#a22bac3f98b0c07cf3a2f6aa6fa1e0322">serial_stream_iterator<DEC>::get_bit_block_SUB</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2214

<a name="l02187"></a>02187 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block)

2215

<a name="l02188"></a>02188 {

2216

<a name="l02189"></a>02189 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2217

<a name="l02190"></a>02190 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst_block != tmp_block);

2218

<a name="l02191"></a>02191

2219

<a name="l02192"></a>02192 unsigned count = 0;

2220

<a name="l02193"></a>02193 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

2221

<a name="l02194"></a>02194 {

2222

<a name="l02195"></a>02195 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

2223

<a name="l02196"></a>02196 for (unsigned i = 0; i < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++i)

2224

<a name="l02197"></a>02197 dst_block[i] &= ~<a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2225

<a name="l02198"></a>02198 break;

2226

<a name="l02199"></a>02199 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

2227

<a name="l02200"></a>02200 {

2228

<a name="l02201"></a>02201 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

2229

<a name="l02202"></a>02202 for (unsigned j = 0; j < bm::set_block_size;run_type = !run_type)

2230

<a name="l02203"></a>02203 {

2231

<a name="l02204"></a>02204 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2232

<a name="l02205"></a>02205 if (run_type)

2233

<a name="l02206"></a>02206 {

2234

<a name="l02207"></a>02207 unsigned run_end = j + run_length;

2235

<a name="l02208"></a>02208 for (;j < run_end; ++j)

2236

<a name="l02209"></a>02209 {

2237

<a name="l02210"></a>02210 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2238

<a name="l02211"></a>02211 dst_block[j] &= ~<a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2239

<a name="l02212"></a>02212 }

2240

<a name="l02213"></a>02213 }

2241

<a name="l02214"></a>02214 else

2242

<a name="l02215"></a>02215 {

2243

<a name="l02216"></a>02216 j += run_length;

2244

<a name="l02217"></a>02217 }

2245

<a name="l02218"></a>02218 } // for

2246

<a name="l02219"></a>02219 }

2247

<a name="l02220"></a>02220 break;

2248

<a name="l02221"></a>02221 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

2249

<a name="l02222"></a>02222 {

2250

<a name="l02223"></a>02223 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2251

<a name="l02224"></a>02224 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2252

<a name="l02225"></a>02225 for (unsigned i = head_idx; i <= tail_idx; ++i)

2253

<a name="l02226"></a>02226 dst_block[i] &= ~<a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2254

<a name="l02227"></a>02227 }

2255

<a name="l02228"></a>02228 break;

2256

<a name="l02229"></a>02229 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2257

<a name="l02230"></a>02230 // TODO: optimization

2258

<a name="l02231"></a>02231 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2259

<a name="l02232"></a>02232 <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(tmp_block, true /*clear target*/);

2260

<a name="l02233"></a>02233 if (dst_block)

2261

<a name="l02234"></a>02234 <a class="code" href="a00120.html#gafed81435f74c0542857842d4461686e4" title="Plain bitblock SUB (AND NOT) operation. Function does not analyse availability of...">bit_block_sub</a>(dst_block, tmp_block);

2262

<a name="l02235"></a>02235 break;

2263

<a name="l02236"></a>02236 default:

2264

<a name="l02237"></a>02237 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2265

<a name="l02238"></a>02238 } // switch

2266

<a name="l02239"></a>02239 return count;

2267

<a name="l02240"></a>02240 }

2268

<a name="l02241"></a>02241

2269

<a name="l02242"></a>02242

2270

<a name="l02243"></a>02243 template<class DEC>

2271

<a name="l02244"></a>02244 unsigned

2272

<a name="l02245"></a><a class="code" href="a00082.html#ae09d0beacb2836739852c6109a436389">02245</a> <a class="code" href="a00082.html#ae09d0beacb2836739852c6109a436389">serial_stream_iterator<DEC>::get_bit_block_COUNT</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* /*dst_block*/,

2273

<a name="l02246"></a>02246 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* /*tmp_block*/)

2274

<a name="l02247"></a>02247 {

2275

<a name="l02248"></a>02248 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2276

<a name="l02249"></a>02249

2277

<a name="l02250"></a>02250 unsigned count = 0;

2278

<a name="l02251"></a>02251 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

2279

<a name="l02252"></a>02252 {

2280

<a name="l02253"></a>02253 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

2281

<a name="l02254"></a>02254 for (unsigned i = 0; i < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++i)

2282

<a name="l02255"></a>02255 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(<a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32());

2283

<a name="l02256"></a>02256 break;

2284

<a name="l02257"></a>02257 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

2285

<a name="l02258"></a>02258 {

2286

<a name="l02259"></a>02259 unsigned count = 0;

2287

<a name="l02260"></a>02260 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

2288

<a name="l02261"></a>02261 for (unsigned j = 0; j < bm::set_block_size;run_type = !run_type)

2289

<a name="l02262"></a>02262 {

2290

<a name="l02263"></a>02263 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2291

<a name="l02264"></a>02264 if (run_type)

2292

<a name="l02265"></a>02265 {

2293

<a name="l02266"></a>02266 unsigned run_end = j + run_length;

2294

<a name="l02267"></a>02267 for (;j < run_end; ++j)

2295

<a name="l02268"></a>02268 {

2296

<a name="l02269"></a>02269 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(<a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32());

2297

<a name="l02270"></a>02270 }

2298

<a name="l02271"></a>02271 }

2299

<a name="l02272"></a>02272 else

2300

<a name="l02273"></a>02273 {

2301

<a name="l02274"></a>02274 j += run_length;

2302

<a name="l02275"></a>02275 }

2303

<a name="l02276"></a>02276 } // for

2304

<a name="l02277"></a>02277 return count;

2305

<a name="l02278"></a>02278 }

2306

<a name="l02279"></a>02279 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

2307

<a name="l02280"></a>02280 {

2308

<a name="l02281"></a>02281 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2309

<a name="l02282"></a>02282 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2310

<a name="l02283"></a>02283 for (unsigned i = head_idx; i <= tail_idx; ++i)

2311

<a name="l02284"></a>02284 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(<a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32());

2312

<a name="l02285"></a>02285 }

2313

<a name="l02286"></a>02286 break;

2314

<a name="l02287"></a>02287 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2315

<a name="l02288"></a>02288 count += <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(0);

2316

<a name="l02289"></a>02289 break;

2317

<a name="l02290"></a>02290 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2318

<a name="l02291"></a>02291 ++count;

2319

<a name="l02292"></a>02292 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2320

<a name="l02293"></a>02293 break;

2321

<a name="l02294"></a>02294 default:

2322

<a name="l02295"></a>02295 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2323

<a name="l02296"></a>02296 } // switch

2324

<a name="l02297"></a>02297 return count;

2325

<a name="l02298"></a>02298 }

2326

<a name="l02299"></a>02299

2327

<a name="l02300"></a>02300 template<class DEC>

2328

<a name="l02301"></a>02301 unsigned

2329

<a name="l02302"></a><a class="code" href="a00082.html#a66b565ecbc6048c42338ef993a2b754e">02302</a> <a class="code" href="a00082.html#a66b565ecbc6048c42338ef993a2b754e">serial_stream_iterator<DEC>::get_bit_block_COUNT_A</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2330

<a name="l02303"></a>02303 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* /*tmp_block*/)

2331

<a name="l02304"></a>02304 {

2332

<a name="l02305"></a>02305 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2333

<a name="l02306"></a>02306 unsigned count = 0;

2334

<a name="l02307"></a>02307 if (dst_block)

2335

<a name="l02308"></a>02308 {

2336

<a name="l02309"></a>02309 // count the block bitcount

2337

<a name="l02310"></a>02310 count =

2338

<a name="l02311"></a>02311 <a class="code" href="a00120.html#gab30df14a61f036d690c091878feaff1c" title="Bitcount for bit string.">bit_block_calc_count</a>(dst_block,

2339

<a name="l02312"></a>02312 dst_block + <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

2340

<a name="l02313"></a>02313 }

2341

<a name="l02314"></a>02314

2342

<a name="l02315"></a>02315 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

2343

<a name="l02316"></a>02316 {

2344

<a name="l02317"></a>02317 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

2345

<a name="l02318"></a>02318 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32(0, <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

2346

<a name="l02319"></a>02319 break;

2347

<a name="l02320"></a>02320 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

2348

<a name="l02321"></a>02321 {

2349

<a name="l02322"></a>02322 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

2350

<a name="l02323"></a>02323 for (unsigned j = 0; j < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;run_type = !run_type)

2351

<a name="l02324"></a>02324 {

2352

<a name="l02325"></a>02325 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2353

<a name="l02326"></a>02326 if (run_type)

2354

<a name="l02327"></a>02327 {

2355

<a name="l02328"></a>02328 unsigned run_end = j + run_length;

2356

<a name="l02329"></a>02329 for (;j < run_end; ++j)

2357

<a name="l02330"></a>02330 {

2358

<a name="l02331"></a>02331 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2359

<a name="l02332"></a>02332 }

2360

<a name="l02333"></a>02333 }

2361

<a name="l02334"></a>02334 else

2362

<a name="l02335"></a>02335 {

2363

<a name="l02336"></a>02336 j += run_length;

2364

<a name="l02337"></a>02337 }

2365

<a name="l02338"></a>02338 } // for

2366

<a name="l02339"></a>02339 }

2367

<a name="l02340"></a>02340 break;

2368

<a name="l02341"></a>02341

2369

<a name="l02342"></a>02342 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

2370

<a name="l02343"></a>02343 {

2371

<a name="l02344"></a>02344 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2372

<a name="l02345"></a>02345 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2373

<a name="l02346"></a>02346 for (unsigned i = head_idx; i <= tail_idx; ++i)

2374

<a name="l02347"></a>02347 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32();

2375

<a name="l02348"></a>02348 }

2376

<a name="l02349"></a>02349 break;

2377

<a name="l02350"></a>02350 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2378

<a name="l02351"></a>02351 <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(0);

2379

<a name="l02352"></a>02352 break;

2380

<a name="l02353"></a>02353 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2381

<a name="l02354"></a>02354 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2382

<a name="l02355"></a>02355 break;

2383

<a name="l02356"></a>02356 default:

2384

<a name="l02357"></a>02357 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2385

<a name="l02358"></a>02358 } // switch

2386

<a name="l02359"></a>02359 return count;

2387

<a name="l02360"></a>02360 }

2388

<a name="l02361"></a>02361

2389

<a name="l02362"></a>02362

2390

<a name="l02363"></a>02363 template<class DEC>

2391

<a name="l02364"></a>02364 unsigned

2392

<a name="l02365"></a><a class="code" href="a00082.html#aefceb87b5d3317cc326cac36b3f772db">02365</a> <a class="code" href="a00082.html#aefceb87b5d3317cc326cac36b3f772db">serial_stream_iterator<DEC>::get_bit_block_COUNT_AND</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2393

<a name="l02366"></a>02366 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block)

2394

<a name="l02367"></a>02367 {

2395

<a name="l02368"></a>02368 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2396

<a name="l02369"></a>02369 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst_block);

2397

<a name="l02370"></a>02370

2398

<a name="l02371"></a>02371 unsigned count = 0;

2399

<a name="l02372"></a>02372 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

2400

<a name="l02373"></a>02373 {

2401

<a name="l02374"></a>02374 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

2402

<a name="l02375"></a>02375 for (unsigned i = 0; i < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++i)

2403

<a name="l02376"></a>02376 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[i] & <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32());

2404

<a name="l02377"></a>02377 break;

2405

<a name="l02378"></a>02378 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

2406

<a name="l02379"></a>02379 {

2407

<a name="l02380"></a>02380 unsigned count = 0;

2408

<a name="l02381"></a>02381 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

2409

<a name="l02382"></a>02382 for (unsigned j = 0; j < bm::set_block_size;run_type = !run_type)

2410

<a name="l02383"></a>02383 {

2411

<a name="l02384"></a>02384 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2412

<a name="l02385"></a>02385 if (run_type)

2413

<a name="l02386"></a>02386 {

2414

<a name="l02387"></a>02387 unsigned run_end = j + run_length;

2415

<a name="l02388"></a>02388 for (;j < run_end; ++j)

2416

<a name="l02389"></a>02389 {

2417

<a name="l02390"></a>02390 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[j] & <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32());

2418

<a name="l02391"></a>02391 }

2419

<a name="l02392"></a>02392 }

2420

<a name="l02393"></a>02393 else

2421

<a name="l02394"></a>02394 {

2422

<a name="l02395"></a>02395 j += run_length;

2423

<a name="l02396"></a>02396 }

2424

<a name="l02397"></a>02397 } // for

2425

<a name="l02398"></a>02398 return count;

2426

<a name="l02399"></a>02399 }

2427

<a name="l02400"></a>02400 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

2428

<a name="l02401"></a>02401 {

2429

<a name="l02402"></a>02402 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2430

<a name="l02403"></a>02403 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2431

<a name="l02404"></a>02404 for (unsigned i = head_idx; i <= tail_idx; ++i)

2432

<a name="l02405"></a>02405 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[i] & <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32());

2433

<a name="l02406"></a>02406 }

2434

<a name="l02407"></a>02407 break;

2435

<a name="l02408"></a>02408 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2436

<a name="l02409"></a>02409 // TODO: optimization

2437

<a name="l02410"></a>02410 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2438

<a name="l02411"></a>02411 <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(tmp_block, true /*clear target*/);

2439

<a name="l02412"></a>02412 count +=

2440

<a name="l02413"></a>02413 <a class="code" href="a00120.html#ga9765914087df2fc22ec18db8128f2a12" title="Performs bitblock AND operation and calculates bitcount of the result.">bit_operation_and_count</a>(dst_block, dst_block + bm::set_block_size,

2441

<a name="l02414"></a>02414 tmp_block);

2442

<a name="l02415"></a>02415 break;

2443

<a name="l02416"></a>02416 default:

2444

<a name="l02417"></a>02417 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2445

<a name="l02418"></a>02418 } // switch

2446

<a name="l02419"></a>02419 return count;

2447

<a name="l02420"></a>02420 }

2448

<a name="l02421"></a>02421

2449

<a name="l02422"></a>02422 template<class DEC>

2450

<a name="l02423"></a>02423 unsigned

2451

<a name="l02424"></a><a class="code" href="a00082.html#a698956699333fa2171b2163dd95efffb">02424</a> <a class="code" href="a00082.html#a698956699333fa2171b2163dd95efffb">serial_stream_iterator<DEC>::get_bit_block_COUNT_OR</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2452

<a name="l02425"></a>02425 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block)

2453

<a name="l02426"></a>02426 {

2454

<a name="l02427"></a>02427 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2455

<a name="l02428"></a>02428 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst_block);

2456

<a name="l02429"></a>02429

2457

<a name="l02430"></a>02430 <a class="code" href="a00038.html" title="Bit-block sum adapter, takes values and sums it /internal.">bitblock_sum_adapter</a> count_adapter;

2458

<a name="l02431"></a>02431 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

2459

<a name="l02432"></a>02432 {

2460

<a name="l02433"></a>02433 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

2461

<a name="l02434"></a>02434 {

2462

<a name="l02435"></a>02435 <a class="code" href="a00036.html" title="Bit-block get adapter, takes bitblock and represents it as a get_32() accessor function...">bitblock_get_adapter</a> ga(dst_block);

2463

<a name="l02436"></a>02436 <a class="code" href="a00020.html" title="Bit COUNT OR functor.">bit_COUNT_OR<bm::word_t></a> func;

2464

<a name="l02437"></a>02437

2465

<a name="l02438"></a>02438 <a class="code" href="a00115.html#a503fecc0ee281059897412d68f489e1e">bit_recomb</a>(ga,

2466

<a name="l02439"></a>02439 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>,

2467

<a name="l02440"></a>02440 func,

2468

<a name="l02441"></a>02441 count_adapter

2469

<a name="l02442"></a>02442 );

2470

<a name="l02443"></a>02443 }

2471

<a name="l02444"></a>02444 break;

2472

<a name="l02445"></a>02445 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

2473

<a name="l02446"></a>02446 {

2474

<a name="l02447"></a>02447 unsigned count = 0;

2475

<a name="l02448"></a>02448 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

2476

<a name="l02449"></a>02449 for (unsigned j = 0; j < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;run_type = !run_type)

2477

<a name="l02450"></a>02450 {

2478

<a name="l02451"></a>02451 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2479

<a name="l02452"></a>02452 unsigned run_end = j + run_length;

2480

<a name="l02453"></a>02453 if (run_type)

2481

<a name="l02454"></a>02454 {

2482

<a name="l02455"></a>02455 for (;j < run_end; ++j)

2483

<a name="l02456"></a>02456 {

2484

<a name="l02457"></a>02457 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2485

<a name="l02458"></a>02458 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[j] | <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32());

2486

<a name="l02459"></a>02459 }

2487

<a name="l02460"></a>02460 }

2488

<a name="l02461"></a>02461 else

2489

<a name="l02462"></a>02462 {

2490

<a name="l02463"></a>02463 for (;j < run_end; ++j)

2491

<a name="l02464"></a>02464 {

2492

<a name="l02465"></a>02465 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2493

<a name="l02466"></a>02466 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[j]);

2494

<a name="l02467"></a>02467 }

2495

<a name="l02468"></a>02468 }

2496

<a name="l02469"></a>02469 } // for

2497

<a name="l02470"></a>02470 return count;

2498

<a name="l02471"></a>02471 }

2499

<a name="l02472"></a>02472 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

2500

<a name="l02473"></a>02473 {

2501

<a name="l02474"></a>02474 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2502

<a name="l02475"></a>02475 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2503

<a name="l02476"></a>02476 unsigned count = 0;

2504

<a name="l02477"></a>02477 unsigned i;

2505

<a name="l02478"></a>02478 for (i = 0; i < head_idx; ++i)

2506

<a name="l02479"></a>02479 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[i]);

2507

<a name="l02480"></a>02480 for (i = head_idx; i <= tail_idx; ++i)

2508

<a name="l02481"></a>02481 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[i] | <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32());

2509

<a name="l02482"></a>02482 for (i = tail_idx + 1; i < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++i)

2510

<a name="l02483"></a>02483 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[i]);

2511

<a name="l02484"></a>02484 return count;

2512

<a name="l02485"></a>02485 }

2513

<a name="l02486"></a>02486 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2514

<a name="l02487"></a>02487 // TODO: optimization

2515

<a name="l02488"></a>02488 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2516

<a name="l02489"></a>02489 <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(tmp_block, true /* clear target*/);

2517

<a name="l02490"></a>02490 return

2518

<a name="l02491"></a>02491 <a class="code" href="a00120.html#ga5a267aff3b56cc6dadf5a3a338e00a1d" title="Performs bitblock OR operation and calculates bitcount of the result.">bit_operation_or_count</a>(dst_block,

2519

<a name="l02492"></a>02492 dst_block + <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>,

2520

<a name="l02493"></a>02493 tmp_block);

2521

<a name="l02494"></a>02494 default:

2522

<a name="l02495"></a>02495 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2523

<a name="l02496"></a>02496 } // switch

2524

<a name="l02497"></a>02497 return count_adapter.<a class="code" href="a00038.html#acc6c1b9a9929baee75d4729644037885" title="Get accumulated sum.">sum</a>();

2525

<a name="l02498"></a>02498 }

2526

<a name="l02499"></a>02499

2527

<a name="l02500"></a>02500 template<class DEC>

2528

<a name="l02501"></a>02501 unsigned

2529

<a name="l02502"></a><a class="code" href="a00082.html#a7278346245b35066c85aabafccaa15ff">02502</a> <a class="code" href="a00082.html#a7278346245b35066c85aabafccaa15ff">serial_stream_iterator<DEC>::get_bit_block_COUNT_XOR</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2530

<a name="l02503"></a>02503 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block)

2531

<a name="l02504"></a>02504 {

2532

<a name="l02505"></a>02505 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2533

<a name="l02506"></a>02506 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst_block);

2534

<a name="l02507"></a>02507

2535

<a name="l02508"></a>02508 <a class="code" href="a00038.html" title="Bit-block sum adapter, takes values and sums it /internal.">bitblock_sum_adapter</a> count_adapter;

2536

<a name="l02509"></a>02509 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

2537

<a name="l02510"></a>02510 {

2538

<a name="l02511"></a>02511 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

2539

<a name="l02512"></a>02512 {

2540

<a name="l02513"></a>02513 <a class="code" href="a00036.html" title="Bit-block get adapter, takes bitblock and represents it as a get_32() accessor function...">bitblock_get_adapter</a> ga(dst_block);

2541

<a name="l02514"></a>02514 <a class="code" href="a00024.html" title="Bit COUNT XOR functor.">bit_COUNT_XOR<bm::word_t></a> func;

2542

<a name="l02515"></a>02515

2543

<a name="l02516"></a>02516 <a class="code" href="a00115.html#a503fecc0ee281059897412d68f489e1e">bit_recomb</a>(ga,

2544

<a name="l02517"></a>02517 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>,

2545

<a name="l02518"></a>02518 func,

2546

<a name="l02519"></a>02519 count_adapter

2547

<a name="l02520"></a>02520 );

2548

<a name="l02521"></a>02521 }

2549

<a name="l02522"></a>02522 break;

2550

<a name="l02523"></a>02523 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

2551

<a name="l02524"></a>02524 {

2552

<a name="l02525"></a>02525 unsigned count = 0;

2553

<a name="l02526"></a>02526 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

2554

<a name="l02527"></a>02527 for (unsigned j = 0; j < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;run_type = !run_type)

2555

<a name="l02528"></a>02528 {

2556

<a name="l02529"></a>02529 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2557

<a name="l02530"></a>02530 unsigned run_end = j + run_length;

2558

<a name="l02531"></a>02531 if (run_type)

2559

<a name="l02532"></a>02532 {

2560

<a name="l02533"></a>02533 for (;j < run_end; ++j)

2561

<a name="l02534"></a>02534 {

2562

<a name="l02535"></a>02535 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2563

<a name="l02536"></a>02536 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[j] ^ <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32());

2564

<a name="l02537"></a>02537 }

2565

<a name="l02538"></a>02538 }

2566

<a name="l02539"></a>02539 else

2567

<a name="l02540"></a>02540 {

2568

<a name="l02541"></a>02541 for (;j < run_end; ++j)

2569

<a name="l02542"></a>02542 {

2570

<a name="l02543"></a>02543 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2571

<a name="l02544"></a>02544 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[j]);

2572

<a name="l02545"></a>02545 }

2573

<a name="l02546"></a>02546 }

2574

<a name="l02547"></a>02547 } // for

2575

<a name="l02548"></a>02548 return count;

2576

<a name="l02549"></a>02549 }

2577

<a name="l02550"></a>02550 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

2578

<a name="l02551"></a>02551 {

2579

<a name="l02552"></a>02552 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2580

<a name="l02553"></a>02553 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2581

<a name="l02554"></a>02554 unsigned count = 0;

2582

<a name="l02555"></a>02555 unsigned i;

2583

<a name="l02556"></a>02556 for (i = 0; i < head_idx; ++i)

2584

<a name="l02557"></a>02557 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[i]);

2585

<a name="l02558"></a>02558 for (i = head_idx; i <= tail_idx; ++i)

2586

<a name="l02559"></a>02559 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[i] ^ <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32());

2587

<a name="l02560"></a>02560 for (i = tail_idx + 1; i < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++i)

2588

<a name="l02561"></a>02561 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[i]);

2589

<a name="l02562"></a>02562 return count;

2590

<a name="l02563"></a>02563 }

2591

<a name="l02564"></a>02564 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2592

<a name="l02565"></a>02565 // TODO: optimization

2593

<a name="l02566"></a>02566 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2594

<a name="l02567"></a>02567 <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(tmp_block, true /* clear target*/);

2595

<a name="l02568"></a>02568 return

2596

<a name="l02569"></a>02569 <a class="code" href="a00120.html#gace08ab77feefb638daee164ee83118bc" title="Performs bitblock XOR operation and calculates bitcount of the result.">bit_operation_xor_count</a>(dst_block,

2597

<a name="l02570"></a>02570 dst_block + <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>,

2598

<a name="l02571"></a>02571 tmp_block);

2599

<a name="l02572"></a>02572 default:

2600

<a name="l02573"></a>02573 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2601

<a name="l02574"></a>02574 } // switch

2602

<a name="l02575"></a>02575 return count_adapter.<a class="code" href="a00038.html#acc6c1b9a9929baee75d4729644037885" title="Get accumulated sum.">sum</a>();

2603

<a name="l02576"></a>02576 }

2604

<a name="l02577"></a>02577

2605

<a name="l02578"></a>02578 template<class DEC>

2606

<a name="l02579"></a>02579 unsigned

2607

<a name="l02580"></a><a class="code" href="a00082.html#a56f17aa09aae0b387f82abcaf9ccb781">02580</a> <a class="code" href="a00082.html#a56f17aa09aae0b387f82abcaf9ccb781">serial_stream_iterator<DEC>::get_bit_block_COUNT_SUB_AB</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2608

<a name="l02581"></a>02581 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block)

2609

<a name="l02582"></a>02582 {

2610

<a name="l02583"></a>02583 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2611

<a name="l02584"></a>02584 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst_block);

2612

<a name="l02585"></a>02585

2613

<a name="l02586"></a>02586 <a class="code" href="a00038.html" title="Bit-block sum adapter, takes values and sums it /internal.">bitblock_sum_adapter</a> count_adapter;

2614

<a name="l02587"></a>02587 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

2615

<a name="l02588"></a>02588 {

2616

<a name="l02589"></a>02589 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

2617

<a name="l02590"></a>02590 {

2618

<a name="l02591"></a>02591 <a class="code" href="a00036.html" title="Bit-block get adapter, takes bitblock and represents it as a get_32() accessor function...">bitblock_get_adapter</a> ga(dst_block);

2619

<a name="l02592"></a>02592 <a class="code" href="a00021.html" title="Bit COUNT SUB AB functor.">bit_COUNT_SUB_AB<bm::word_t></a> func;

2620

<a name="l02593"></a>02593

2621

<a name="l02594"></a>02594 <a class="code" href="a00115.html#a503fecc0ee281059897412d68f489e1e">bit_recomb</a>(ga,

2622

<a name="l02595"></a>02595 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>,

2623

<a name="l02596"></a>02596 func,

2624

<a name="l02597"></a>02597 count_adapter

2625

<a name="l02598"></a>02598 );

2626

<a name="l02599"></a>02599 }

2627

<a name="l02600"></a>02600 break;

2628

<a name="l02601"></a>02601 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

2629

<a name="l02602"></a>02602 {

2630

<a name="l02603"></a>02603 unsigned count = 0;

2631

<a name="l02604"></a>02604 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

2632

<a name="l02605"></a>02605 for (unsigned j = 0; j < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;run_type = !run_type)

2633

<a name="l02606"></a>02606 {

2634

<a name="l02607"></a>02607 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2635

<a name="l02608"></a>02608 unsigned run_end = j + run_length;

2636

<a name="l02609"></a>02609 if (run_type)

2637

<a name="l02610"></a>02610 {

2638

<a name="l02611"></a>02611 for (;j < run_end; ++j)

2639

<a name="l02612"></a>02612 {

2640

<a name="l02613"></a>02613 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2641

<a name="l02614"></a>02614 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[j] & ~<a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32());

2642

<a name="l02615"></a>02615 }

2643

<a name="l02616"></a>02616 }

2644

<a name="l02617"></a>02617 else

2645

<a name="l02618"></a>02618 {

2646

<a name="l02619"></a>02619 for (;j < run_end; ++j)

2647

<a name="l02620"></a>02620 {

2648

<a name="l02621"></a>02621 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2649

<a name="l02622"></a>02622 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[j]);

2650

<a name="l02623"></a>02623 }

2651

<a name="l02624"></a>02624 }

2652

<a name="l02625"></a>02625 } // for

2653

<a name="l02626"></a>02626 return count;

2654

<a name="l02627"></a>02627 }

2655

<a name="l02628"></a>02628 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

2656

<a name="l02629"></a>02629 {

2657

<a name="l02630"></a>02630 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2658

<a name="l02631"></a>02631 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2659

<a name="l02632"></a>02632 unsigned count = 0;

2660

<a name="l02633"></a>02633 unsigned i;

2661

<a name="l02634"></a>02634 for (i = 0; i < head_idx; ++i)

2662

<a name="l02635"></a>02635 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[i]);

2663

<a name="l02636"></a>02636 for (i = head_idx; i <= tail_idx; ++i)

2664

<a name="l02637"></a>02637 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[i] & (~<a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32()));

2665

<a name="l02638"></a>02638 for (i = tail_idx + 1; i < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++i)

2666

<a name="l02639"></a>02639 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(dst_block[i]);

2667

<a name="l02640"></a>02640 return count;

2668

<a name="l02641"></a>02641 }

2669

<a name="l02642"></a>02642 break;

2670

<a name="l02643"></a>02643 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2671

<a name="l02644"></a>02644 //TODO: optimization

2672

<a name="l02645"></a>02645 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2673

<a name="l02646"></a>02646 <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(tmp_block, true /* clear target*/);

2674

<a name="l02647"></a>02647 return

2675

<a name="l02648"></a>02648 <a class="code" href="a00120.html#gaabb39bf01bf973cb7bf3648873921ab7" title="Performs bitblock SUB operation and calculates bitcount of the result.">bit_operation_sub_count</a>(dst_block,

2676

<a name="l02649"></a>02649 dst_block + <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>,

2677

<a name="l02650"></a>02650 tmp_block);

2678

<a name="l02651"></a>02651 default:

2679

<a name="l02652"></a>02652 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2680

<a name="l02653"></a>02653 } // switch

2681

<a name="l02654"></a>02654 return count_adapter.<a class="code" href="a00038.html#acc6c1b9a9929baee75d4729644037885" title="Get accumulated sum.">sum</a>();

2682

<a name="l02655"></a>02655 }

2683

<a name="l02656"></a>02656

2684

<a name="l02657"></a>02657 template<class DEC>

2685

<a name="l02658"></a>02658 unsigned

2686

<a name="l02659"></a><a class="code" href="a00082.html#a6cc7a6d70c3ec0f3f84f3e3fe8d6a5c7">02659</a> <a class="code" href="a00082.html#a6cc7a6d70c3ec0f3f84f3e3fe8d6a5c7">serial_stream_iterator<DEC>::get_bit_block_COUNT_SUB_BA</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2687

<a name="l02660"></a>02660 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block)

2688

<a name="l02661"></a>02661 {

2689

<a name="l02662"></a>02662 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2690

<a name="l02663"></a>02663 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst_block);

2691

<a name="l02664"></a>02664

2692

<a name="l02665"></a>02665 <a class="code" href="a00038.html" title="Bit-block sum adapter, takes values and sums it /internal.">bitblock_sum_adapter</a> count_adapter;

2693

<a name="l02666"></a>02666 switch (<a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>)

2694

<a name="l02667"></a>02667 {

2695

<a name="l02668"></a>02668 case <a class="code" href="a00115.html#aef86ab2eb42c198272eea7cdfe42951b" title="Plain bit block.">set_block_bit</a>:

2696

<a name="l02669"></a>02669 {

2697

<a name="l02670"></a>02670 <a class="code" href="a00036.html" title="Bit-block get adapter, takes bitblock and represents it as a get_32() accessor function...">bitblock_get_adapter</a> ga(dst_block);

2698

<a name="l02671"></a>02671 <a class="code" href="a00022.html" title="Bit SUB BA functor.">bit_COUNT_SUB_BA<bm::word_t></a> func;

2699

<a name="l02672"></a>02672

2700

<a name="l02673"></a>02673 <a class="code" href="a00115.html#a503fecc0ee281059897412d68f489e1e">bit_recomb</a>(ga,

2701

<a name="l02674"></a>02674 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>,

2702

<a name="l02675"></a>02675 func,

2703

<a name="l02676"></a>02676 count_adapter

2704

<a name="l02677"></a>02677 );

2705

<a name="l02678"></a>02678 }

2706

<a name="l02679"></a>02679 break;

2707

<a name="l02680"></a>02680 case <a class="code" href="a00115.html#a5e21adca3bc6902f33e43e5cfd824f0e" title="Bit block with encoded zero intervals.">set_block_bit_0runs</a>:

2708

<a name="l02681"></a>02681 {

2709

<a name="l02682"></a>02682 unsigned count = 0;

2710

<a name="l02683"></a>02683 unsigned char run_type = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_8();

2711

<a name="l02684"></a>02684 for (unsigned j = 0; j < <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;run_type = !run_type)

2712

<a name="l02685"></a>02685 {

2713

<a name="l02686"></a>02686 unsigned run_length = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2714

<a name="l02687"></a>02687 unsigned run_end = j + run_length;

2715

<a name="l02688"></a>02688 if (run_type)

2716

<a name="l02689"></a>02689 {

2717

<a name="l02690"></a>02690 for (;j < run_end; ++j)

2718

<a name="l02691"></a>02691 {

2719

<a name="l02692"></a>02692 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(j < bm::set_block_size);

2720

<a name="l02693"></a>02693 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(<a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32() & (~dst_block[j]));

2721

<a name="l02694"></a>02694 }

2722

<a name="l02695"></a>02695 }

2723

<a name="l02696"></a>02696 else

2724

<a name="l02697"></a>02697 {

2725

<a name="l02698"></a>02698 j += run_length;

2726

<a name="l02699"></a>02699 }

2727

<a name="l02700"></a>02700 } // for

2728

<a name="l02701"></a>02701 return count;

2729

<a name="l02702"></a>02702 }

2730

<a name="l02703"></a>02703

2731

<a name="l02704"></a>02704 case <a class="code" href="a00115.html#a0f2d3289a95dc3bd224a6a73c3d3afce" title="Interval block.">set_block_bit_interval</a>:

2732

<a name="l02705"></a>02705 {

2733

<a name="l02706"></a>02706 unsigned head_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2734

<a name="l02707"></a>02707 unsigned tail_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2735

<a name="l02708"></a>02708 unsigned count = 0;

2736

<a name="l02709"></a>02709 unsigned i;

2737

<a name="l02710"></a>02710 for (i = head_idx; i <= tail_idx; ++i)

2738

<a name="l02711"></a>02711 count += <a class="code" href="a00120.html#gaef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(<a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_32() & (~dst_block[i]));

2739

<a name="l02712"></a>02712 return count;

2740

<a name="l02713"></a>02713 }

2741

<a name="l02714"></a>02714 break;

2742

<a name="l02715"></a>02715 case <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>:

2743

<a name="l02716"></a>02716 // TODO: optimization

2744

<a name="l02717"></a>02717 case <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a>:

2745

<a name="l02718"></a>02718 <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">get_arr_bit</a>(tmp_block, true /* clear target*/);

2746

<a name="l02719"></a>02719 return

2747

<a name="l02720"></a>02720 <a class="code" href="a00120.html#gaabb39bf01bf973cb7bf3648873921ab7" title="Performs bitblock SUB operation and calculates bitcount of the result.">bit_operation_sub_count</a>(tmp_block,

2748

<a name="l02721"></a>02721 tmp_block + <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>,

2749

<a name="l02722"></a>02722 dst_block);

2750

<a name="l02723"></a>02723 default:

2751

<a name="l02724"></a>02724 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2752

<a name="l02725"></a>02725 } // switch

2753

<a name="l02726"></a>02726 return count_adapter.<a class="code" href="a00038.html#acc6c1b9a9929baee75d4729644037885" title="Get accumulated sum.">sum</a>();

2754

<a name="l02727"></a>02727 }

2755

<a name="l02728"></a>02728

2756

<a name="l02729"></a>02729

2757

<a name="l02730"></a>02730

2758

<a name="l02731"></a>02731 template<class DEC>

2759

<a name="l02732"></a><a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8">02732</a> unsigned <a class="code" href="a00082.html#a938264e95d9c5fb3fa2e1dcddda1d4a8" title="Get array of bits out of the decoder into bit block (Converts inverted list into...">serial_stream_iterator<DEC>::get_arr_bit</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2760

<a name="l02733"></a>02733 bool clear_target)

2761

<a name="l02734"></a>02734 {

2762

<a name="l02735"></a>02735 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a> == <a class="code" href="a00115.html#a6ec6acb175ce77a229003f088ecd3923" title="List of bits ON.">set_block_arrbit</a> ||

2763

<a name="l02736"></a>02736 this-><a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a> == <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>);

2764

<a name="l02737"></a>02737

2765

<a name="l02738"></a>02738 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> len = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16(); // array length / 1bit_idx

2766

<a name="l02739"></a>02739 if (dst_block)

2767

<a name="l02740"></a>02740 {

2768

<a name="l02741"></a>02741 if (clear_target)

2769

<a name="l02742"></a>02742 <a class="code" href="a00120.html#gaada8b13c35acd8df90129b45edcfc5de" title="Bitblock memset operation.">bit_block_set</a>(dst_block, 0);

2770

<a name="l02743"></a>02743

2771

<a name="l02744"></a>02744 if (this-><a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a> == <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>)

2772

<a name="l02745"></a>02745 {

2773

<a name="l02746"></a>02746 // len contains idx of 1 bit set

2774

<a name="l02747"></a>02747 <a class="code" href="a00120.html#ga2becf9a16ec20ab124ca8938e34b4aa8" title="Set 1 bit in a block.">set_bit</a>(dst_block, len);

2775

<a name="l02748"></a>02748 return 1;

2776

<a name="l02749"></a>02749 }

2777

<a name="l02750"></a>02750

2778

<a name="l02751"></a>02751 for (unsigned k = 0; k < len; ++k)

2779

<a name="l02752"></a>02752 {

2780

<a name="l02753"></a>02753 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> bit_idx = <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.get_16();

2781

<a name="l02754"></a>02754 <a class="code" href="a00120.html#ga2becf9a16ec20ab124ca8938e34b4aa8" title="Set 1 bit in a block.">set_bit</a>(dst_block, bit_idx);

2782

<a name="l02755"></a>02755 }

2783

<a name="l02756"></a>02756 }

2784

<a name="l02757"></a>02757 else

2785

<a name="l02758"></a>02758 {

2786

<a name="l02759"></a>02759 if (this-><a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a> == <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>)

2787

<a name="l02760"></a>02760 {

2788

<a name="l02761"></a>02761 return 1; // nothing to do: len var already consumed 16bits

2789

<a name="l02762"></a>02762 }

2790

<a name="l02763"></a>02763 // fwd the decocing stream

2791

<a name="l02764"></a>02764 <a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>.seek(len * 2);

2792

<a name="l02765"></a>02765 }

2793

<a name="l02766"></a>02766 return len;

2794

<a name="l02767"></a>02767 }

2795

<a name="l02768"></a>02768

2796

<a name="l02769"></a>02769 template<class DEC>

2797

<a name="l02770"></a>02770 void

2798

<a name="l02771"></a><a class="code" href="a00082.html#a65bfdd6a50b71e6839d3f9b055b85814">02771</a> <a class="code" href="a00082.html#a65bfdd6a50b71e6839d3f9b055b85814" title="Read gap block data (with head).">serial_stream_iterator<DEC>::get_gap_block</a>(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* dst_block)

2799

<a name="l02772"></a>02772 {

2800

<a name="l02773"></a>02773 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969da6b1a1c20945bd0813ceae6d689591d0d" title="one gap block">e_gap_block</a> ||

2801

<a name="l02774"></a>02774 this-><a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a> == <a class="code" href="a00115.html#ad0e6607a9771fa49a658c3078208c2dc" title="Bit block with 1 bit ON.">set_block_bit_1bit</a>);

2802

<a name="l02775"></a>02775 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst_block);

2803

<a name="l02776"></a>02776

2804

<a name="l02777"></a>02777 <a class="code" href="a00058.html#abbd0f97d8c8bd1017cd65885870c2426" title="Read GAP block from the stream.">read_gap_block</a>(this-><a class="code" href="a00082.html#a5d0dc0916d4cdc5fbefa17d74fa4495b">decoder_</a>,

2805

<a name="l02778"></a>02778 this-><a class="code" href="a00082.html#a20d072e2607b4ed9caea26e669afdf76" title="current block type">block_type_</a>,

2806

<a name="l02779"></a>02779 dst_block,

2807

<a name="l02780"></a>02780 this-><a class="code" href="a00082.html#a5b7762f08b50525283c45531d9538f4f">gap_head_</a>);

2808

<a name="l02781"></a>02781

2809

<a name="l02782"></a>02782 ++(this-><a class="code" href="a00082.html#a885a7eea86b5ac64196a1ed0804ae608" title="current block index">block_idx_</a>);

2810

<a name="l02783"></a>02783 this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969daacf85c8ad242bcce343b482ea6e005b9" title="stream of blocks">e_blocks</a>;

2811

<a name="l02784"></a>02784 }

2812

<a name="l02785"></a>02785

2813

<a name="l02786"></a>02786

2814

<a name="l02787"></a>02787 template<class DEC>

2815

<a name="l02788"></a>02788 unsigned

2816

<a name="l02789"></a><a class="code" href="a00082.html#a75db44dcddb04e8c3217f0f43f1c9e9b">02789</a> <a class="code" href="a00082.html#a75db44dcddb04e8c3217f0f43f1c9e9b" title="read bit block, using logical operation">serial_stream_iterator<DEC>::get_bit_block</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* dst_block,

2817

<a name="l02790"></a>02790 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* tmp_block,

2818

<a name="l02791"></a>02791 <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109" title="Nomenclature of set operations.">set_operation</a> op)

2819

<a name="l02792"></a>02792 {

2820

<a name="l02793"></a>02793 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> == <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969dadba258a079a4645b8d4eae751671bf60" title="one bit block">e_bit_block</a>);

2821

<a name="l02794"></a>02794 <a class="code" href="a00082.html#a3bf4a7b338d663d93bf14f14967491e2" title="member function pointer for bitset-bitset get operations">get_bit_func_type</a> bit_func = <a class="code" href="a00082.html#a5bcd5ab32d2988a3067db2cd0ddbb84c">bit_func_table_</a>[op];

2822

<a name="l02795"></a>02795 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(bit_func);

2823

<a name="l02796"></a>02796 unsigned cnt = ((*this).*(bit_func))(dst_block, tmp_block);

2824

<a name="l02797"></a>02797 this-><a class="code" href="a00082.html#a5052532579b17ccbab2d0b40e066d34a">state_</a> = <a class="code" href="a00082.html#acbaca18e8b7f3ed8dd9e5fef2093969daacf85c8ad242bcce343b482ea6e005b9" title="stream of blocks">e_blocks</a>;

2825

<a name="l02798"></a>02798 ++(this-><a class="code" href="a00082.html#a885a7eea86b5ac64196a1ed0804ae608" title="current block index">block_idx_</a>);

2826

<a name="l02799"></a>02799 return cnt;

2827

<a name="l02800"></a>02800 }

2828

<a name="l02801"></a>02801

2829

<a name="l02802"></a>02802

2830

<a name="l02803"></a>02803

2831

<a name="l02804"></a>02804 template<class BV>

2832

<a name="l02805"></a><a class="code" href="a00076.html#aa2af1e50d6a0a0ddae72b5b0888f3e6f">02805</a> unsigned <a class="code" href="a00076.html#aa2af1e50d6a0a0ddae72b5b0888f3e6f">operation_deserializer<BV>::deserialize</a>(

2833

<a name="l02806"></a>02806 bvector_type& bv,

2834

<a name="l02807"></a>02807 const unsigned char* buf,

2835

<a name="l02808"></a>02808 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_block,

2836

<a name="l02809"></a>02809 <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109" title="Nomenclature of set operations.">set_operation</a> op)

2837

<a name="l02810"></a>02810 {

2838

<a name="l02811"></a>02811 <a class="code" href="a00115.html#a577905b348676c2bc556b51793350dbb" title="Byte orders recognized by the library.">ByteOrder</a> bo_current = <a class="code" href="a00070.html" title="Internal structure.">globals<true>::byte_order</a>();

2839

<a name="l02812"></a>02812

2840

<a name="l02813"></a>02813 <a class="code" href="a00054.html" title="Class for decoding data from memory buffer.">bm::decoder</a> dec(buf);

2841

<a name="l02814"></a>02814 unsigned char header_flag = dec.<a class="code" href="a00055.html#a8402bad78311eb4f0fff484d1cc03f36" title="Reads character from the decoding buffer.">get_8</a>();

2842

<a name="l02815"></a>02815 <a class="code" href="a00115.html#a577905b348676c2bc556b51793350dbb" title="Byte orders recognized by the library.">ByteOrder</a> bo = bo_current;

2843

<a name="l02816"></a>02816 if (!(header_flag & <a class="code" href="a00115.html#ab69f66b71d349b0757370f54318bb2c0a6b127bde401907318702dd4827c8f74e" title="no byte-order">BM_HM_NO_BO</a>))

2844

<a name="l02817"></a>02817 {

2845

<a name="l02818"></a>02818 bo = (<a class="code" href="a00115.html#a577905b348676c2bc556b51793350dbb" title="Byte orders recognized by the library.">bm::ByteOrder</a>) dec.<a class="code" href="a00055.html#a8402bad78311eb4f0fff484d1cc03f36" title="Reads character from the decoding buffer.">get_8</a>();

2846

<a name="l02819"></a>02819 }

2847

<a name="l02820"></a>02820

2848

<a name="l02821"></a>02821 blocks_manager_type& bman = bv.get_blocks_manager();

2849

<a name="l02822"></a>02822 bit_block_guard<blocks_manager_type> bg(bman);

2850

<a name="l02823"></a>02823 if (temp_block == 0)

2851

<a name="l02824"></a>02824 {

2852

<a name="l02825"></a>02825 temp_block = bg.allocate();

2853

<a name="l02826"></a>02826 }

2854

<a name="l02827"></a>02827

2855

<a name="l02828"></a>02828 if (bo_current == bo)

2856

<a name="l02829"></a>02829 {

2857

<a name="l02830"></a>02830 <a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_current</a> ss(buf);

2858

<a name="l02831"></a>02831 return

2859

<a name="l02832"></a>02832 <a class="code" href="a00076.html#aa2af1e50d6a0a0ddae72b5b0888f3e6f">iterator_deserializer<BV, serial_stream_current>::</a>

2860

<a name="l02833"></a>02833 <a class="code" href="a00076.html#aa2af1e50d6a0a0ddae72b5b0888f3e6f"> deserialize</a>(bv, ss, temp_block, op);

2861

<a name="l02834"></a>02834 }

2862

<a name="l02835"></a>02835 switch (bo_current)

2863

<a name="l02836"></a>02836 {

2864

<a name="l02837"></a>02837 case <a class="code" href="a00115.html#a577905b348676c2bc556b51793350dbbac959b97503c42581f3dd81fd3b93fff2">BigEndian</a>:

2865

<a name="l02838"></a>02838 {

2866

<a name="l02839"></a>02839 <a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_be</a> ss(buf);

2867

<a name="l02840"></a>02840 return

2868

<a name="l02841"></a>02841 <a class="code" href="a00076.html#aa2af1e50d6a0a0ddae72b5b0888f3e6f">iterator_deserializer<BV, serial_stream_be>::</a>

2869

<a name="l02842"></a>02842 <a class="code" href="a00076.html#aa2af1e50d6a0a0ddae72b5b0888f3e6f"> deserialize</a>(bv, ss, temp_block, op);

2870

<a name="l02843"></a>02843 }

2871

<a name="l02844"></a>02844 case <a class="code" href="a00115.html#a577905b348676c2bc556b51793350dbba5ebe266b6d18ee74483c2bbf624e2cc2">LittleEndian</a>:

2872

<a name="l02845"></a>02845 {

2873

<a name="l02846"></a>02846 <a class="code" href="a00082.html" title="Serialization stream iterator.">serial_stream_le</a> ss(buf);

2874

<a name="l02847"></a>02847 return

2875

<a name="l02848"></a>02848 <a class="code" href="a00076.html#aa2af1e50d6a0a0ddae72b5b0888f3e6f">iterator_deserializer<BV, serial_stream_le>::</a>

2876

<a name="l02849"></a>02849 <a class="code" href="a00076.html#aa2af1e50d6a0a0ddae72b5b0888f3e6f"> deserialize</a>(bv, ss, temp_block, op);

2877

<a name="l02850"></a>02850 }

2878

<a name="l02851"></a>02851 default:

2879

<a name="l02852"></a>02852 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

2880

<a name="l02853"></a>02853 };

2881

<a name="l02854"></a>02854 return 0;

2882

<a name="l02855"></a>02855 }

2883

<a name="l02856"></a>02856

2884

<a name="l02857"></a>02857

2885

<a name="l02858"></a>02858 template<class BV, class SerialIterator>

2886

<a name="l02859"></a>02859 void <a class="code" href="a00073.html" title="Iterator to walk forward the serialized stream.">iterator_deserializer<BV, SerialIterator>::load_id_list</a>(

2887

<a name="l02860"></a>02860 bvector_type& bv,

2888

<a name="l02861"></a>02861 serial_iterator_type& sit,

2889

<a name="l02862"></a>02862 unsigned id_count,

2890

<a name="l02863"></a>02863 bool set_clear)

2891

<a name="l02864"></a>02864 {

2892

<a name="l02865"></a>02865 const unsigned win_size = 64;

2893

<a name="l02866"></a>02866 <a class="code" href="a00115.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> id_buffer[win_size+1];

2894

<a name="l02867"></a>02867

2895

<a name="l02868"></a>02868 if (set_clear) // set bits

2896

<a name="l02869"></a>02869 {

2897

<a name="l02870"></a>02870 for (unsigned i = 0; i <= id_count;)

2898

<a name="l02871"></a>02871 {

2899

<a name="l02872"></a>02872 unsigned j;

2900

<a name="l02873"></a>02873 for (j = 0; j < win_size && i <= id_count; ++j, ++i)

2901

<a name="l02874"></a>02874 {

2902

<a name="l02875"></a>02875 id_buffer[j] = sit.get_id();

2903

<a name="l02876"></a>02876 sit.next();

2904

<a name="l02877"></a>02877 } // for j

2905

<a name="l02878"></a>02878 <a class="code" href="a00124.html#ga54ff78528c99ae3ca443eb99ba44785b" title="OR Combine bitvector and the iterable sequence.">bm::combine_or</a>(bv, id_buffer, id_buffer + j);

2906

<a name="l02879"></a>02879 } // for i

2907

<a name="l02880"></a>02880 }

2908

<a name="l02881"></a>02881 else // clear bits

2909

<a name="l02882"></a>02882 {

2910

<a name="l02883"></a>02883 for (unsigned i = 0; i <= id_count;)

2911

<a name="l02884"></a>02884 {

2912

<a name="l02885"></a>02885 unsigned j;

2913

<a name="l02886"></a>02886 for (j = 0; j < win_size && i <= id_count; ++j, ++i)

2914

<a name="l02887"></a>02887 {

2915

<a name="l02888"></a>02888 id_buffer[j] = sit.get_id();

2916

<a name="l02889"></a>02889 sit.next();

2917

<a name="l02890"></a>02890 } // for j

2918

<a name="l02891"></a>02891 <a class="code" href="a00124.html#gab88c5bf51484323e0139aa789d7f0b98" title="SUB Combine bitvector and the iterable sequence.">bm::combine_sub</a>(bv, id_buffer, id_buffer + j);

2919

<a name="l02892"></a>02892 } // for i

2920

<a name="l02893"></a>02893 }

2921

<a name="l02894"></a>02894 }

2922

<a name="l02895"></a>02895

2923

<a name="l02896"></a>02896

2924

<a name="l02897"></a>02897 template<class BV, class SerialIterator>

2925

<a name="l02898"></a>02898 unsigned

2926

<a name="l02899"></a><a class="code" href="a00073.html#ac193063e13965f5d5cfb28cf2440f92c">02899</a> <a class="code" href="a00073.html#ac193063e13965f5d5cfb28cf2440f92c">iterator_deserializer<BV, SerialIterator>::deserialize</a>(

2927

<a name="l02900"></a>02900 bvector_type& bv,

2928

<a name="l02901"></a>02901 serial_iterator_type& sit,

2929

<a name="l02902"></a>02902 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_block,

2930

<a name="l02903"></a>02903 <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109" title="Nomenclature of set operations.">set_operation</a> op)

2931

<a name="l02904"></a>02904 {

2932

<a name="l02905"></a>02905 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(temp_block);

2933

<a name="l02906"></a>02906

2934

<a name="l02907"></a>02907 unsigned count = 0;

2935

<a name="l02908"></a>02908 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> gap_temp_block[<a class="code" href="a00115.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a>*3];

2936

<a name="l02909"></a>02909 gap_temp_block[0] = 0;

2937

<a name="l02910"></a>02910

2938

<a name="l02911"></a>02911 blocks_manager_type& bman = bv.get_blocks_manager();

2939

<a name="l02912"></a>02912

2940

<a name="l02913"></a>02913 bv.forget_count();

2941

<a name="l02914"></a>02914

2942

<a name="l02915"></a>02915 if (sit.bv_size() && (sit.bv_size() > bv.size()))

2943

<a name="l02916"></a>02916 {

2944

<a name="l02917"></a>02917 bv.resize(sit.bv_size());

2945

<a name="l02918"></a>02918 }

2946

<a name="l02919"></a>02919

2947

<a name="l02920"></a>02920 <a class="code" href="a00092.html#a7e6f87ba3230dece2125af5c32e84b05">BM_SET_MMX_GUARD</a>

2948

<a name="l02921"></a>02921

2949

<a name="l02922"></a>02922 typename serial_iterator_type::iterator_state state;

2950

<a name="l02923"></a>02923 state = sit.get_state();

2951

<a name="l02924"></a>02924 if (state == serial_iterator_type::e_list_ids)

2952

<a name="l02925"></a>02925 {

2953

<a name="l02926"></a>02926 unsigned id_count = sit.get_id_count();

2954

<a name="l02927"></a>02927 bool set_clear = true;

2955

<a name="l02928"></a>02928 switch (op)

2956

<a name="l02929"></a>02929 {

2957

<a name="l02930"></a>02930 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a949fba4d9b152e1cbba9a450e05e21a3">set_AND</a>:

2958

<a name="l02931"></a>02931 {

2959

<a name="l02932"></a>02932 // TODO: use some more optimal algorithm without temp vector

2960

<a name="l02933"></a>02933 BV bv_tmp(<a class="code" href="a00118.html#ggad0b87b3b7292383a864d27feaf1c9effa7fe09d1d7c62a813db922c396c0cbc9c" title="GAP compression is ON.">BM_GAP</a>);

2961

<a name="l02934"></a>02934 load_id_list(bv_tmp, sit, id_count, true);

2962

<a name="l02935"></a>02935 bv &= bv_tmp;

2963

<a name="l02936"></a>02936 }

2964

<a name="l02937"></a>02937 break;

2965

<a name="l02938"></a>02938 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a34150dd6a8ac2e70b887565bd1c3f788">set_ASSIGN</a>:

2966

<a name="l02939"></a>02939 bv.clear(true);

2967

<a name="l02940"></a>02940 // intentional case fall through here (not a bug)

2968

<a name="l02941"></a>02941 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a05d88a2639cbd3d2ac63436df3ed6780">set_OR</a>:

2969

<a name="l02942"></a>02942 set_clear = true;

2970

<a name="l02943"></a>02943 // fall to SUB

2971

<a name="l02944"></a>02944 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a348f23af148237ac49194815b222b769">set_SUB</a>:

2972

<a name="l02945"></a>02945 load_id_list(bv, sit, id_count, set_clear);

2973

<a name="l02946"></a>02946 break;

2974

<a name="l02947"></a>02947 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109ab823123a0d630167532a96be004e6304">set_XOR</a>:

2975

<a name="l02948"></a>02948 for (unsigned i = 0; i < id_count; ++i)

2976

<a name="l02949"></a>02949 {

2977

<a name="l02950"></a>02950 <a class="code" href="a00115.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> id = sit.get_id();

2978

<a name="l02951"></a>02951 bv[id] ^= true;

2979

<a name="l02952"></a>02952 sit.next();

2980

<a name="l02953"></a>02953 } // for

2981

<a name="l02954"></a>02954 break;

2982

<a name="l02955"></a>02955 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a3f165b7944e33214e8721aaf2eb8378e">set_COUNT</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2ac4eb7f41d00f8387d5dd3ffb9d0617">set_COUNT_B</a>:

2983

<a name="l02956"></a>02956 for (unsigned i = 0; i < id_count; ++i)

2984

<a name="l02957"></a>02957 {

2985

<a name="l02958"></a>02958 /* bm::id_t id = */ sit.get_id();

2986

<a name="l02959"></a>02959 ++count;

2987

<a name="l02960"></a>02960 sit.next();

2988

<a name="l02961"></a>02961 } // for

2989

<a name="l02962"></a>02962 break;

2990

<a name="l02963"></a>02963 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109abafe8a971864164aeec7f43d1205ed29">set_COUNT_A</a>:

2991

<a name="l02964"></a>02964 return bv.count();

2992

<a name="l02965"></a>02965 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a378be4b14cee6a341e859fd3157ab959">set_COUNT_AND</a>:

2993

<a name="l02966"></a>02966 for (unsigned i = 0; i < id_count; ++i)

2994

<a name="l02967"></a>02967 {

2995

<a name="l02968"></a>02968 <a class="code" href="a00115.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> id = sit.get_id();

2996

<a name="l02969"></a>02969 count += bv.get_bit(id);

2997

<a name="l02970"></a>02970 sit.next();

2998

<a name="l02971"></a>02971 } // for

2999

<a name="l02972"></a>02972 break;

3000

<a name="l02973"></a>02973 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a1373054e4f243dffb762a55b8a8bfe4c">set_COUNT_XOR</a>:

3001

<a name="l02974"></a>02974 {

3002

<a name="l02975"></a>02975 // TODO: get rid of the temp vector

3003

<a name="l02976"></a>02976 BV bv_tmp(<a class="code" href="a00118.html#ggad0b87b3b7292383a864d27feaf1c9effa7fe09d1d7c62a813db922c396c0cbc9c" title="GAP compression is ON.">BM_GAP</a>);

3004

<a name="l02977"></a>02977 load_id_list(bv_tmp, sit, id_count, true);

3005

<a name="l02978"></a>02978 count += <a class="code" href="a00125.html#gafc64a082dcaee07f70f7faf3e24f844e" title="Computes bitcount of XOR operation of two bitsets.">count_xor</a>(bv, bv_tmp);

3006

<a name="l02979"></a>02979 }

3007

<a name="l02980"></a>02980 break;

3008

<a name="l02981"></a>02981 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a27e34c148d06e3d8a405482d820cd7fb">set_COUNT_OR</a>:

3009

<a name="l02982"></a>02982 {

3010

<a name="l02983"></a>02983 // TODO: get rid of the temp. vector

3011

<a name="l02984"></a>02984 BV bv_tmp(<a class="code" href="a00118.html#ggad0b87b3b7292383a864d27feaf1c9effa7fe09d1d7c62a813db922c396c0cbc9c" title="GAP compression is ON.">BM_GAP</a>);

3012

<a name="l02985"></a>02985 load_id_list(bv_tmp, sit, id_count, true);

3013

<a name="l02986"></a>02986 count += <a class="code" href="a00125.html#ga803c564668703fc3bf80067570c2c905" title="Computes bitcount of OR operation of two bitsets.">count_or</a>(bv, bv_tmp);

3014

<a name="l02987"></a>02987 }

3015

<a name="l02988"></a>02988 break;

3016

<a name="l02989"></a>02989 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a0028cc7084b37fe66ce5ae459b93b7f1">set_COUNT_SUB_AB</a>:

3017

<a name="l02990"></a>02990 {

3018

<a name="l02991"></a>02991 // TODO: get rid of the temp. vector

3019

<a name="l02992"></a>02992 BV bv_tmp(bv);

3020

<a name="l02993"></a>02993 load_id_list(bv_tmp, sit, id_count, false);

3021

<a name="l02994"></a>02994 count += bv_tmp.count();

3022

<a name="l02995"></a>02995 }

3023

<a name="l02996"></a>02996 break;

3024

<a name="l02997"></a>02997 default:

3025

<a name="l02998"></a>02998 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

3026

<a name="l02999"></a>02999 } // switch

3027

<a name="l03000"></a>03000 return count;

3028

<a name="l03001"></a>03001 } // state

3029

<a name="l03002"></a>03002

3030

<a name="l03003"></a>03003 unsigned bv_block_idx = 0;

3031

<a name="l03004"></a>03004

3032

<a name="l03005"></a>03005 for (;1;)

3033

<a name="l03006"></a>03006 {

3034

<a name="l03007"></a>03007 <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109" title="Nomenclature of set operations.">bm::set_operation</a> sop = op;

3035

<a name="l03008"></a>03008 if (sit.is_eof()) // argument stream ended

3036

<a name="l03009"></a>03009 {

3037

<a name="l03010"></a>03010 // deserialization finalization

3038

<a name="l03011"></a>03011 switch (op)

3039

<a name="l03012"></a>03012 {

3040

<a name="l03013"></a>03013 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a05d88a2639cbd3d2ac63436df3ed6780">set_OR</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a348f23af148237ac49194815b222b769">set_SUB</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109ab823123a0d630167532a96be004e6304">set_XOR</a>:

3041

<a name="l03014"></a>03014 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a3f165b7944e33214e8721aaf2eb8378e">set_COUNT</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2ac4eb7f41d00f8387d5dd3ffb9d0617">set_COUNT_B</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a378be4b14cee6a341e859fd3157ab959">set_COUNT_AND</a>:

3042

<a name="l03015"></a>03015 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2f7b894c11c058598d02722a7eeef03b">set_COUNT_SUB_BA</a>:

3043

<a name="l03016"></a>03016 // nothing to do

3044

<a name="l03017"></a>03017 break;

3045

<a name="l03018"></a>03018 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a949fba4d9b152e1cbba9a450e05e21a3">set_AND</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a34150dd6a8ac2e70b887565bd1c3f788">set_ASSIGN</a>:

3046

<a name="l03019"></a>03019 // clear the rest of the target vector

3047

<a name="l03020"></a>03020 {

3048

<a name="l03021"></a>03021 unsigned i, j;

3049

<a name="l03022"></a>03022 bman.get_block_coord(bv_block_idx, &i, &j);

3050

<a name="l03023"></a>03023 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*** blk_root = bman.get_rootblock();

3051

<a name="l03024"></a>03024 unsigned effective_top_size =

3052

<a name="l03025"></a>03025 bman.effective_top_block_size();

3053

<a name="l03026"></a>03026 for (;i < effective_top_size; ++i)

3054

<a name="l03027"></a>03027 {

3055

<a name="l03028"></a>03028 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>** blk_blk = blk_root[i];

3056

<a name="l03029"></a>03029 if (blk_blk == 0)

3057

<a name="l03030"></a>03030 {

3058

<a name="l03031"></a>03031 bv_block_idx+=<a class="code" href="a00115.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>-j;

3059

<a name="l03032"></a>03032 j = 0;

3060

<a name="l03033"></a>03033 continue;

3061

<a name="l03034"></a>03034 }

3062

<a name="l03035"></a>03035 for (;j < <a class="code" href="a00115.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>; ++j, ++bv_block_idx)

3063

<a name="l03036"></a>03036 {

3064

<a name="l03037"></a>03037 if (blk_blk[j])

3065

<a name="l03038"></a>03038 bman.zero_block(bv_block_idx);

3066

<a name="l03039"></a>03039 } // for j

3067

<a name="l03040"></a>03040 j = 0;

3068

<a name="l03041"></a>03041 } // for i

3069

<a name="l03042"></a>03042

3070

<a name="l03043"></a>03043 }

3071

<a name="l03044"></a>03044 break;

3072

<a name="l03045"></a>03045 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109abafe8a971864164aeec7f43d1205ed29">set_COUNT_A</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a27e34c148d06e3d8a405482d820cd7fb">set_COUNT_OR</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a1373054e4f243dffb762a55b8a8bfe4c">set_COUNT_XOR</a>:

3073

<a name="l03046"></a>03046 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a0028cc7084b37fe66ce5ae459b93b7f1">set_COUNT_SUB_AB</a>:

3074

<a name="l03047"></a>03047 // count bits in the target vector

3075

<a name="l03048"></a>03048 {

3076

<a name="l03049"></a>03049 unsigned i, j;

3077

<a name="l03050"></a>03050 bman.get_block_coord(bv_block_idx, &i, &j);

3078

<a name="l03051"></a>03051 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*** blk_root = bman.get_rootblock();

3079

<a name="l03052"></a>03052 unsigned effective_top_size =

3080

<a name="l03053"></a>03053 bman.effective_top_block_size();

3081

<a name="l03054"></a>03054 for (;i < effective_top_size; ++i)

3082

<a name="l03055"></a>03055 {

3083

<a name="l03056"></a>03056 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>** blk_blk = blk_root[i];

3084

<a name="l03057"></a>03057 if (blk_blk == 0)

3085

<a name="l03058"></a>03058 {

3086

<a name="l03059"></a>03059 bv_block_idx+=<a class="code" href="a00115.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>-j;

3087

<a name="l03060"></a>03060 j = 0;

3088

<a name="l03061"></a>03061 continue;

3089

<a name="l03062"></a>03062 }

3090

<a name="l03063"></a>03063 for (;j < <a class="code" href="a00115.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>; ++j, ++bv_block_idx)

3091

<a name="l03064"></a>03064 {

3092

<a name="l03065"></a>03065 if (blk_blk[j])

3093

<a name="l03066"></a>03066 count += bman.block_bitcount(blk_blk[j], bv_block_idx);

3094

<a name="l03067"></a>03067 } // for j

3095

<a name="l03068"></a>03068 j = 0;

3096

<a name="l03069"></a>03069 } // for i

3097

<a name="l03070"></a>03070

3098

<a name="l03071"></a>03071 }

3099

<a name="l03072"></a>03072 break;

3100

<a name="l03073"></a>03073 default:

3101

<a name="l03074"></a>03074 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

3102

<a name="l03075"></a>03075 }

3103

<a name="l03076"></a>03076 return count;

3104

<a name="l03077"></a>03077 }

3105

<a name="l03078"></a>03078

3106

<a name="l03079"></a>03079 state = sit.state();

3107

<a name="l03080"></a>03080 switch (state)

3108

<a name="l03081"></a>03081 {

3109

<a name="l03082"></a>03082 case serial_iterator_type::e_blocks:

3110

<a name="l03083"></a>03083 sit.next();

3111

<a name="l03084"></a>03084 continue;

3112

<a name="l03085"></a>03085 case serial_iterator_type::e_bit_block:

3113

<a name="l03086"></a>03086 {

3114

<a name="l03087"></a>03087 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(sit.block_idx() == bv_block_idx);

3115

<a name="l03088"></a>03088 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk = bman.get_block(bv_block_idx);

3116

<a name="l03089"></a>03089

3117

<a name="l03090"></a>03090 if (!blk)

3118

<a name="l03091"></a>03091 {

3119

<a name="l03092"></a>03092 switch (op)

3120

<a name="l03093"></a>03093 {

3121

<a name="l03094"></a>03094 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a949fba4d9b152e1cbba9a450e05e21a3">set_AND</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a348f23af148237ac49194815b222b769">set_SUB</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a378be4b14cee6a341e859fd3157ab959">set_COUNT_AND</a>:

3122

<a name="l03095"></a>03095 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a0028cc7084b37fe66ce5ae459b93b7f1">set_COUNT_SUB_AB</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109abafe8a971864164aeec7f43d1205ed29">set_COUNT_A</a>:

3123

<a name="l03096"></a>03096 // one arg is 0, so the operation gives us zero

3124

<a name="l03097"></a>03097 // all we need to do is to seek the input stream

3125

<a name="l03098"></a>03098 sop = <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a34150dd6a8ac2e70b887565bd1c3f788">set_ASSIGN</a>;

3126

<a name="l03099"></a>03099 break;

3127

<a name="l03100"></a>03100

3128

<a name="l03101"></a>03101 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a05d88a2639cbd3d2ac63436df3ed6780">set_OR</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109ab823123a0d630167532a96be004e6304">set_XOR</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a34150dd6a8ac2e70b887565bd1c3f788">set_ASSIGN</a>:

3129

<a name="l03102"></a>03102 blk = bman.make_bit_block(bv_block_idx);

3130

<a name="l03103"></a>03103 break;

3131

<a name="l03104"></a>03104

3132

<a name="l03105"></a>03105 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a3f165b7944e33214e8721aaf2eb8378e">set_COUNT</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a1373054e4f243dffb762a55b8a8bfe4c">set_COUNT_XOR</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a27e34c148d06e3d8a405482d820cd7fb">set_COUNT_OR</a>:

3133

<a name="l03106"></a>03106 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2f7b894c11c058598d02722a7eeef03b">set_COUNT_SUB_BA</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2ac4eb7f41d00f8387d5dd3ffb9d0617">set_COUNT_B</a>:

3134

<a name="l03107"></a>03107 // first arg is not required (should work as is)

3135

<a name="l03108"></a>03108 sop = <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a3f165b7944e33214e8721aaf2eb8378e">set_COUNT</a>;

3136

<a name="l03109"></a>03109 break;

3137

<a name="l03110"></a>03110

3138

<a name="l03111"></a>03111 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109ad894d257a23664720dbf4155153a1e5c">set_END</a>:

3139

<a name="l03112"></a>03112 default:

3140

<a name="l03113"></a>03113 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

3141

<a name="l03114"></a>03114 }

3142

<a name="l03115"></a>03115 }

3143

<a name="l03116"></a>03116 else // block exists

3144

<a name="l03117"></a>03117 {

3145

<a name="l03118"></a>03118 int is_gap = <a class="code" href="a00092.html#a862d6f92b4de3ddb94fd367a800512eb">BM_IS_GAP</a>(bman, blk, bv_block_idx);

3146

<a name="l03119"></a>03119 if (is_gap || <a class="code" href="a00092.html#a074acb37afea68caaffe3832d326eb44">IS_FULL_BLOCK</a>(blk))

3147

<a name="l03120"></a>03120 {

3148

<a name="l03121"></a>03121 if (<a class="code" href="a00092.html#a074acb37afea68caaffe3832d326eb44">IS_FULL_BLOCK</a>(blk) && <a class="code" href="a00115.html#a3deb310cdf11bca948817f94adfec160" title="Returns true if set operation is constant (bitcount).">is_const_set_operation</a>(op))

3149

<a name="l03122"></a>03122 {

3150

<a name="l03123"></a>03123 }

3151

<a name="l03124"></a>03124 else

3152

<a name="l03125"></a>03125 {

3153

<a name="l03126"></a>03126 // TODO: make sure const operations do not

3154

<a name="l03127"></a>03127 // deoptimize GAP blocks

3155

<a name="l03128"></a>03128 blk = bman.deoptimize_block(bv_block_idx);

3156

<a name="l03129"></a>03129 }

3157

<a name="l03130"></a>03130 }

3158

<a name="l03131"></a>03131 }

3159

<a name="l03132"></a>03132

3160

<a name="l03133"></a>03133 // 2 bit blocks recombination

3161

<a name="l03134"></a>03134 unsigned c = sit.get_bit_block(blk, temp_block, sop);

3162

<a name="l03135"></a>03135 count += c;

3163

<a name="l03136"></a>03136 }

3164

<a name="l03137"></a>03137 break;

3165

<a name="l03138"></a>03138

3166

<a name="l03139"></a>03139 case serial_iterator_type::e_zero_blocks:

3167

<a name="l03140"></a>03140 {

3168

<a name="l03141"></a>03141 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(bv_block_idx == sit.block_idx());

3169

<a name="l03142"></a>03142 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk = bman.get_block(bv_block_idx);

3170

<a name="l03143"></a>03143 sit.next();

3171

<a name="l03144"></a>03144

3172

<a name="l03145"></a>03145 if (blk)

3173

<a name="l03146"></a>03146 {

3174

<a name="l03147"></a>03147 switch (op)

3175

<a name="l03148"></a>03148 {

3176

<a name="l03149"></a>03149 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a949fba4d9b152e1cbba9a450e05e21a3">set_AND</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a34150dd6a8ac2e70b887565bd1c3f788">set_ASSIGN</a>:

3177

<a name="l03150"></a>03150 // the result is 0

3178

<a name="l03151"></a>03151 blk = bman.zero_block(bv_block_idx);

3179

<a name="l03152"></a>03152 break;

3180

<a name="l03153"></a>03153

3181

<a name="l03154"></a>03154 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a348f23af148237ac49194815b222b769">set_SUB</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a378be4b14cee6a341e859fd3157ab959">set_COUNT_AND</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a05d88a2639cbd3d2ac63436df3ed6780">set_OR</a>:

3182

<a name="l03155"></a>03155 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109ab823123a0d630167532a96be004e6304">set_XOR</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2f7b894c11c058598d02722a7eeef03b">set_COUNT_SUB_BA</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2ac4eb7f41d00f8387d5dd3ffb9d0617">set_COUNT_B</a>:

3183

<a name="l03156"></a>03156 // nothing to do

3184

<a name="l03157"></a>03157 break;

3185

<a name="l03158"></a>03158

3186

<a name="l03159"></a>03159 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a0028cc7084b37fe66ce5ae459b93b7f1">set_COUNT_SUB_AB</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109abafe8a971864164aeec7f43d1205ed29">set_COUNT_A</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a27e34c148d06e3d8a405482d820cd7fb">set_COUNT_OR</a>:

3187

<a name="l03160"></a>03160 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a3f165b7944e33214e8721aaf2eb8378e">set_COUNT</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a1373054e4f243dffb762a55b8a8bfe4c">set_COUNT_XOR</a>:

3188

<a name="l03161"></a>03161 // valid bit block recombined with 0 block

3189

<a name="l03162"></a>03162 // results with same block data

3190

<a name="l03163"></a>03163 // all we need is to bitcount bv block

3191

<a name="l03164"></a>03164 {

3192

<a name="l03165"></a>03165 unsigned c = bman.block_bitcount(blk, bv_block_idx);

3193

<a name="l03166"></a>03166 count += c;

3194

<a name="l03167"></a>03167 }

3195

<a name="l03168"></a>03168 break;

3196

<a name="l03169"></a>03169 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109ad894d257a23664720dbf4155153a1e5c">set_END</a>:

3197

<a name="l03170"></a>03170 default:

3198

<a name="l03171"></a>03171 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

3199

<a name="l03172"></a>03172 } // switch op

3200

<a name="l03173"></a>03173 } // if blk

3201

<a name="l03174"></a>03174 }

3202

<a name="l03175"></a>03175 break;

3203

<a name="l03176"></a>03176

3204

<a name="l03177"></a>03177 case serial_iterator_type::e_one_blocks:

3205

<a name="l03178"></a>03178 {

3206

<a name="l03179"></a>03179 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(bv_block_idx == sit.block_idx());

3207

<a name="l03180"></a>03180 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk = bman.get_block(bv_block_idx);

3208

<a name="l03181"></a>03181 sit.next();

3209

<a name="l03182"></a>03182

3210

<a name="l03183"></a>03183 switch (op)

3211

<a name="l03184"></a>03184 {

3212

<a name="l03185"></a>03185 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a05d88a2639cbd3d2ac63436df3ed6780">set_OR</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a34150dd6a8ac2e70b887565bd1c3f788">set_ASSIGN</a>:

3213

<a name="l03186"></a>03186 bman.set_block_all_set(bv_block_idx);

3214

<a name="l03187"></a>03187 break;

3215

<a name="l03188"></a>03188 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a27e34c148d06e3d8a405482d820cd7fb">set_COUNT_OR</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2ac4eb7f41d00f8387d5dd3ffb9d0617">set_COUNT_B</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a3f165b7944e33214e8721aaf2eb8378e">set_COUNT</a>:

3216

<a name="l03189"></a>03189 // block becomes all set

3217

<a name="l03190"></a>03190 count += <a class="code" href="a00115.html#ae9916f69ced0347d94472d7944ea0e45">bm::bits_in_block</a>;

3218

<a name="l03191"></a>03191 break;

3219

<a name="l03192"></a>03192 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a348f23af148237ac49194815b222b769">set_SUB</a>:

3220

<a name="l03193"></a>03193 blk = bman.zero_block(bv_block_idx);

3221

<a name="l03194"></a>03194 break;

3222

<a name="l03195"></a>03195 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a0028cc7084b37fe66ce5ae459b93b7f1">set_COUNT_SUB_AB</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a949fba4d9b152e1cbba9a450e05e21a3">set_AND</a>:

3223

<a name="l03196"></a>03196 // nothing to do

3224

<a name="l03197"></a>03197 break;

3225

<a name="l03198"></a>03198 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a378be4b14cee6a341e859fd3157ab959">set_COUNT_AND</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109abafe8a971864164aeec7f43d1205ed29">set_COUNT_A</a>:

3226

<a name="l03199"></a>03199 count += bman.block_bitcount(blk, bv_block_idx);

3227

<a name="l03200"></a>03200 break;

3228

<a name="l03201"></a>03201 default:

3229

<a name="l03202"></a>03202 if (blk)

3230

<a name="l03203"></a>03203 {

3231

<a name="l03204"></a>03204 switch (op)

3232

<a name="l03205"></a>03205 {

3233

<a name="l03206"></a>03206 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109ab823123a0d630167532a96be004e6304">set_XOR</a>:

3234

<a name="l03207"></a>03207 blk = bman.deoptimize_block(bv_block_idx);

3235

<a name="l03208"></a>03208 <a class="code" href="a00120.html#gae6a46c5e671ea1c9312219ceb41025ef" title="Plain bitblock XOR operation. Function does not analyse availability of source and...">bit_block_xor</a>(blk, <a class="code" href="a00092.html#a1365569f85f442c4914a3579f55df99b">FULL_BLOCK_ADDR</a>);

3236

<a name="l03209"></a>03209 break;

3237

<a name="l03210"></a>03210 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a1373054e4f243dffb762a55b8a8bfe4c">set_COUNT_XOR</a>:

3238

<a name="l03211"></a>03211 {

3239

<a name="l03212"></a>03212 int is_gap = <a class="code" href="a00092.html#a862d6f92b4de3ddb94fd367a800512eb">BM_IS_GAP</a>(bman, blk, bv_block_idx);

3240

<a name="l03213"></a>03213 count +=

3241

<a name="l03214"></a>03214 <a class="code" href="a00115.html#abecd5b24d5e394fd46a9db514cfa659a" title="Internal function computes different distance metrics.">combine_count_operation_with_block</a>(

3242

<a name="l03215"></a>03215 blk,

3243

<a name="l03216"></a>03216 is_gap,

3244

<a name="l03217"></a>03217 <a class="code" href="a00092.html#a1365569f85f442c4914a3579f55df99b">FULL_BLOCK_ADDR</a>,

3245

<a name="l03218"></a>03218 0,

3246

<a name="l03219"></a>03219 temp_block,

3247

<a name="l03220"></a>03220 <a class="code" href="a00125.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">bm::COUNT_XOR</a>);

3248

<a name="l03221"></a>03221 }

3249

<a name="l03222"></a>03222 break;

3250

<a name="l03223"></a>03223 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2f7b894c11c058598d02722a7eeef03b">set_COUNT_SUB_BA</a>:

3251

<a name="l03224"></a>03224 {

3252

<a name="l03225"></a>03225 int is_gap = <a class="code" href="a00092.html#a862d6f92b4de3ddb94fd367a800512eb">BM_IS_GAP</a>(bman, blk, bv_block_idx);

3253

<a name="l03226"></a>03226 count +=

3254

<a name="l03227"></a>03227 <a class="code" href="a00115.html#abecd5b24d5e394fd46a9db514cfa659a" title="Internal function computes different distance metrics.">combine_count_operation_with_block</a>(

3255

<a name="l03228"></a>03228 blk,

3256

<a name="l03229"></a>03229 is_gap,

3257

<a name="l03230"></a>03230 <a class="code" href="a00092.html#a1365569f85f442c4914a3579f55df99b">FULL_BLOCK_ADDR</a>,

3258

<a name="l03231"></a>03231 0,

3259

<a name="l03232"></a>03232 temp_block,

3260

<a name="l03233"></a>03233 <a class="code" href="a00125.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>);

3261

<a name="l03234"></a>03234 }

3262

<a name="l03235"></a>03235 break;

3263

<a name="l03236"></a>03236 default:

3264

<a name="l03237"></a>03237 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

3265

<a name="l03238"></a>03238 } // switch

3266

<a name="l03239"></a>03239 }

3267

<a name="l03240"></a>03240 else // blk == 0

3268

<a name="l03241"></a>03241 {

3269

<a name="l03242"></a>03242 switch (op)

3270

<a name="l03243"></a>03243 {

3271

<a name="l03244"></a>03244 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109ab823123a0d630167532a96be004e6304">set_XOR</a>:

3272

<a name="l03245"></a>03245 // 0 XOR 1 = 1

3273

<a name="l03246"></a>03246 bman.set_block_all_set(bv_block_idx);

3274

<a name="l03247"></a>03247 break;

3275

<a name="l03248"></a>03248 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a1373054e4f243dffb762a55b8a8bfe4c">set_COUNT_XOR</a>:

3276

<a name="l03249"></a>03249 count += <a class="code" href="a00115.html#ae9916f69ced0347d94472d7944ea0e45">bm::bits_in_block</a>;

3277

<a name="l03250"></a>03250 break;

3278

<a name="l03251"></a>03251 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a2f7b894c11c058598d02722a7eeef03b">set_COUNT_SUB_BA</a>:

3279

<a name="l03252"></a>03252 // 1 - 0 = 1

3280

<a name="l03253"></a>03253 count += <a class="code" href="a00115.html#ae9916f69ced0347d94472d7944ea0e45">bm::bits_in_block</a>;

3281

<a name="l03254"></a>03254 break;

3282

<a name="l03255"></a>03255 default:

3283

<a name="l03256"></a>03256 break;

3284

<a name="l03257"></a>03257 } // switch

3285

<a name="l03258"></a>03258 } // else

3286

<a name="l03259"></a>03259 } // switch

3287

<a name="l03260"></a>03260

3288

<a name="l03261"></a>03261 }

3289

<a name="l03262"></a>03262 break;

3290

<a name="l03263"></a>03263

3291

<a name="l03264"></a>03264 case serial_iterator_type::e_gap_block:

3292

<a name="l03265"></a>03265 {

3293

<a name="l03266"></a>03266 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(bv_block_idx == sit.block_idx());

3294

<a name="l03267"></a>03267 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk = bman.get_block(bv_block_idx);

3295

<a name="l03268"></a>03268

3296

<a name="l03269"></a>03269 sit.get_gap_block(gap_temp_block);

3297

<a name="l03270"></a>03270 // gap_word_t gap_head = gap_temp_block[0];

3298

<a name="l03271"></a>03271

3299

<a name="l03272"></a>03272 unsigned len = <a class="code" href="a00119.html#gad6bfb9da9950b0df8983a9faf9db5042" title="Returs GAP block length.">gap_length</a>(gap_temp_block);

3300

<a name="l03273"></a>03273 int level = <a class="code" href="a00119.html#ga3bfaebeeb4b2d479c5a9ac9d57607165" title="Calculates GAP block capacity level.">gap_calc_level</a>(len, bman.glen());

3301

<a name="l03274"></a>03274 --len;

3302

<a name="l03275"></a>03275

3303

<a name="l03276"></a>03276 bool const_op = <a class="code" href="a00115.html#a3deb310cdf11bca948817f94adfec160" title="Returns true if set operation is constant (bitcount).">is_const_set_operation</a>(op);

3304

<a name="l03277"></a>03277 if (const_op)

3305

<a name="l03278"></a>03278 {

3306

<a name="l03279"></a>03279 <a class="code" href="a00125.html#gac38d64c8b27b652413a664cddd4d40ab" title="Distance metrics codes defined for vectors A and B.">distance_metric</a> metric = <a class="code" href="a00125.html#ga158946ea41ca66c3e1bca62c92684788" title="Convert set operation into compatible distance metric.">operation2metric</a>(op);

3307

<a name="l03280"></a>03280 int is_gap = blk ? <a class="code" href="a00092.html#a862d6f92b4de3ddb94fd367a800512eb">BM_IS_GAP</a>(bman, blk, bv_block_idx) : 0;

3308

<a name="l03281"></a>03281 unsigned c =

3309

<a name="l03282"></a>03282 <a class="code" href="a00115.html#abecd5b24d5e394fd46a9db514cfa659a" title="Internal function computes different distance metrics.">combine_count_operation_with_block</a>(

3310

<a name="l03283"></a>03283 blk,

3311

<a name="l03284"></a>03284 is_gap,

3312

<a name="l03285"></a>03285 (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)gap_temp_block,

3313

<a name="l03286"></a>03286 1, // gap

3314

<a name="l03287"></a>03287 temp_block,

3315

<a name="l03288"></a>03288 metric);

3316

<a name="l03289"></a>03289 count += c;

3317

<a name="l03290"></a>03290 }

3318

<a name="l03291"></a>03291 else // non-const set operation

3319

<a name="l03292"></a>03292 {

3320

<a name="l03293"></a>03293 if ((sop == <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a34150dd6a8ac2e70b887565bd1c3f788">set_ASSIGN</a>) && blk) // target block override

3321

<a name="l03294"></a>03294 {

3322

<a name="l03295"></a>03295 blk = bman.zero_block(bv_block_idx);

3323

<a name="l03296"></a>03296 sop = <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a05d88a2639cbd3d2ac63436df3ed6780">set_OR</a>;

3324

<a name="l03297"></a>03297 }

3325

<a name="l03298"></a>03298 if (blk == 0) // target block not found

3326

<a name="l03299"></a>03299 {

3327

<a name="l03300"></a>03300 switch (sop)

3328

<a name="l03301"></a>03301 {

3329

<a name="l03302"></a>03302 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a949fba4d9b152e1cbba9a450e05e21a3">set_AND</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a348f23af148237ac49194815b222b769">set_SUB</a>:

3330

<a name="l03303"></a>03303 break;

3331

<a name="l03304"></a>03304 case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a05d88a2639cbd3d2ac63436df3ed6780">set_OR</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109ab823123a0d630167532a96be004e6304">set_XOR</a>: case <a class="code" href="a00115.html#a76b70d2b9182a6dcac151d1bd9ec6109a34150dd6a8ac2e70b887565bd1c3f788">set_ASSIGN</a>:

3332

<a name="l03305"></a>03305 if (level == -1) // too big to be GAP: convert to BIT

3333

<a name="l03306"></a>03306 {

3334

<a name="l03307"></a>03307 blk = bman.get_allocator().alloc_bit_block();

3335

<a name="l03308"></a>03308 bman.set_block(bv_block_idx, blk);

3336

<a name="l03309"></a>03309 <a class="code" href="a00119.html#ga4862f4dcdcb7c0575e2e2db9e5f2a849" title="GAP block to bitblock conversion.">gap_convert_to_bitset</a>(blk, gap_temp_block);

3337

<a name="l03310"></a>03310 }

3338

<a name="l03311"></a>03311 else // GAP block fits

3339

<a name="l03312"></a>03312 {

3340

<a name="l03313"></a>03313 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* gap_blk =

3341

<a name="l03314"></a>03314 bman.get_allocator().alloc_gap_block(

3342

<a name="l03315"></a>03315 level, bman.glen());

3343

<a name="l03316"></a>03316 <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* gap_blk_ptr = <a class="code" href="a00092.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(gap_blk);

3344

<a name="l03317"></a>03317 ::memcpy(gap_blk_ptr,

3345

<a name="l03318"></a>03318 gap_temp_block,

3346

<a name="l03319"></a>03319 <a class="code" href="a00119.html#gad6bfb9da9950b0df8983a9faf9db5042" title="Returs GAP block length.">gap_length</a>(gap_temp_block)

3347

<a name="l03320"></a>03320 * sizeof(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>));

3348

<a name="l03321"></a>03321 <a class="code" href="a00119.html#ga501aa9bf029e7f9ea9518e7003fe5549" title="Sets GAP block capacity level.">set_gap_level</a>(gap_blk_ptr, level);

3349

<a name="l03322"></a>03322 bman.set_block(bv_block_idx,

3350

<a name="l03323"></a>03323 (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)gap_blk, true /*GAP*/);

3351

<a name="l03324"></a>03324 }

3352

<a name="l03325"></a>03325 break;

3353

<a name="l03326"></a>03326 default:

3354

<a name="l03327"></a>03327 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

3355

<a name="l03328"></a>03328 } // switch

3356

<a name="l03329"></a>03329 }

3357

<a name="l03330"></a>03330 else // target block exists

3358

<a name="l03331"></a>03331 {

3359

<a name="l03332"></a>03332 <a class="code" href="a00115.html#a42405343976ec931388381cea4092bf1" title="Bit operations enumeration.">bm::operation</a> bop = <a class="code" href="a00115.html#a7c192b64adb0590a09b5c2dad77c4b76" title="Convert set operation to operation.">bm::setop2op</a>(op);

3360

<a name="l03333"></a>03333 if (level == -1) // too big to GAP

3361

<a name="l03334"></a>03334 {

3362

<a name="l03335"></a>03335 <a class="code" href="a00119.html#ga4862f4dcdcb7c0575e2e2db9e5f2a849" title="GAP block to bitblock conversion.">gap_convert_to_bitset</a>(temp_block, gap_temp_block);

3363

<a name="l03336"></a>03336 bv.combine_operation_with_block(bv_block_idx,

3364

<a name="l03337"></a>03337 temp_block,

3365

<a name="l03338"></a>03338 0, // BIT

3366

<a name="l03339"></a>03339 bop);

3367

<a name="l03340"></a>03340 }

3368

<a name="l03341"></a>03341 else // GAP fits

3369

<a name="l03342"></a>03342 {

3370

<a name="l03343"></a>03343 <a class="code" href="a00119.html#ga501aa9bf029e7f9ea9518e7003fe5549" title="Sets GAP block capacity level.">set_gap_level</a>(gap_temp_block, level);

3371

<a name="l03344"></a>03344 bv.combine_operation_with_block(

3372

<a name="l03345"></a>03345 bv_block_idx,

3373

<a name="l03346"></a>03346 (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)gap_temp_block,

3374

<a name="l03347"></a>03347 1, // GAP

3375

<a name="l03348"></a>03348 bop);

3376

<a name="l03349"></a>03349 }

3377

<a name="l03350"></a>03350 }

3378

<a name="l03351"></a>03351 }

3379

<a name="l03352"></a>03352 }

3380

<a name="l03353"></a>03353 break;

3381

<a name="l03354"></a>03354

3382

<a name="l03355"></a>03355 default:

3383

<a name="l03356"></a>03356 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

3384

<a name="l03357"></a>03357 } // switch

3385

<a name="l03358"></a>03358

3386

<a name="l03359"></a>03359 ++bv_block_idx;

3387

<a name="l03360"></a>03360

3388

<a name="l03361"></a>03361 } // for (deserialization)

3389

<a name="l03362"></a>03362

3390

<a name="l03363"></a>03363 return count;

3391

<a name="l03364"></a>03364 }

3392

<a name="l03365"></a>03365

3393

<a name="l03366"></a>03366

3394

<a name="l03367"></a>03367

3395

<a name="l03368"></a>03368

3396

<a name="l03369"></a>03369 } // namespace bm

3397

<a name="l03370"></a>03370

3398

<a name="l03371"></a>03371 #include "<a class="code" href="a00101.html">bmundef.h</a>"

3399

<a name="l03372"></a>03372

3400

<a name="l03373"></a>03373 #ifdef _MSC_VER

3401

<a name="l03374"></a>03374 #pragma warning( default : 4311 4312)

3402

<a name="l03375"></a>03375 #endif

3403

<a name="l03376"></a>03376

3404

<a name="l03377"></a>03377

3405

<a name="l03378"></a>03378 #endif

684

3406

</pre></div></div>

685

<hr size="1"/><address style="text-align: right;">Generated on Sun Nov 22 10:49:35 2009 for BitMagic by

3407

<hr size="1"/><address style="text-align: right;">Generated on Fri Jan 8 20:09:19 2010 for BitMagic by

686

3408

687

3409

688

3410

</body>

Older »