~ubuntu-branches/ubuntu/precise/bmagic/precise

<h1>bmfunc.h</h1><a href="a00064.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 /*

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

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

<a name="l00005"></a>00005 obtaining a copy of this software and associated documentation

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

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

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

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

<a name="l00010"></a>00010 subject to the following conditions:

<a name="l00011"></a>00011

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

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

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

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

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

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

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

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

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

<a name="l00021"></a>00021 OTHER DEALINGS IN THE SOFTWARE.

<a name="l00022"></a>00022

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

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

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

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

<a name="l00027"></a>00027 #ifndef BMFUNC__H__INCLUDED__

<a name="l00028"></a>00028 #define BMFUNC__H__INCLUDED__

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

<a name="l00030"></a>00030 #include <memory.h>

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

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

<a name="l00033"></a>00033 #ifdef _MSC_VER

<a name="l00034"></a>00034 # pragma warning( disable: 4146 )

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

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

<a name="l00037"></a>00037 namespace bm

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

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

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

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

<a name="l00042"></a>00042 @brief Structure with statistical information about bitset's memory

<a name="l00043"></a>00043 allocation details.

<a name="l00044"></a>00044 @ingroup bvector

<a name="l00045"></a>00045 */

<a name="l00046"></a><a class="code" href="a00034.html">00046</a> struct <a class="code" href="a00034.html" title="Structure with statistical information about bitset&#39;s memory allocation details...">bv_statistics</a>

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

<a name="l00048"></a>00048 /// Number of bit blocks.

<a name="l00049"></a><a class="code" href="a00034.html#4ec8ba190b4ba31c431c008402881c62">00049</a> unsigned <a class="code" href="a00034.html#4ec8ba190b4ba31c431c008402881c62" title="Number of bit blocks.">bit_blocks</a>;

<a name="l00050"></a>00050 /// Number of GAP blocks.

<a name="l00051"></a><a class="code" href="a00034.html#4dcfd64e9ab0be5472e3c2b04e551f81">00051</a> unsigned <a class="code" href="a00034.html#4dcfd64e9ab0be5472e3c2b04e551f81" title="Number of GAP blocks.">gap_blocks</a>;

<a name="l00052"></a>00052 /// Estimated maximum of memory required for serialization.

<a name="l00053"></a><a class="code" href="a00034.html#92f800e8649a1455c17019c8ec882b4b">00053</a> unsigned <a class="code" href="a00034.html#92f800e8649a1455c17019c8ec882b4b" title="Estimated maximum of memory required for serialization.">max_serialize_mem</a>;

<a name="l00054"></a>00054 /// Memory used by bitvector including temp and service blocks

<a name="l00055"></a><a class="code" href="a00034.html#d3b2190eb4afe24ecd56323cbc0a7666">00055</a> unsigned <a class="code" href="a00034.html#d3b2190eb4afe24ecd56323cbc0a7666" title="Memory used by bitvector including temp and service blocks.">memory_used</a>;

<a name="l00056"></a>00056 /// Array of all GAP block lengths in the bvector.

<a name="l00057"></a><a class="code" href="a00034.html#824dd18d515305d159c48a697696cbb6">00057</a> <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a> <a class="code" href="a00034.html#824dd18d515305d159c48a697696cbb6" title="Array of all GAP block lengths in the bvector.">gap_length</a>[<a class="code" href="a00078.html#505011007f54598794e0b9477c0b0b11">bm::set_total_blocks</a>];

<a name="l00058"></a>00058 /// GAP lengths used by bvector

<a name="l00059"></a><a class="code" href="a00034.html#cc08d9637cc25d02d3a50c061ba221e1">00059</a> <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a> <a class="code" href="a00034.html#cc08d9637cc25d02d3a50c061ba221e1" title="GAP lengths used by bvector.">gap_levels</a>[<a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>];

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

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

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

<a name="l00063"></a>00063 /// cound bit block

<a name="l00064"></a><a class="code" href="a00034.html#78e63355a6d8985da253ebaa594223ff">00064</a> void <a class="code" href="a00034.html#78e63355a6d8985da253ebaa594223ff" title="cound bit block">add_bit_block</a>()

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

<a name="l00066"></a>00066 ++<a class="code" href="a00034.html#4ec8ba190b4ba31c431c008402881c62" title="Number of bit blocks.">bit_blocks</a>;

<a name="l00067"></a>00067 unsigned mem_used = sizeof(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>) * <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;

<a name="l00068"></a>00068 <a class="code" href="a00034.html#d3b2190eb4afe24ecd56323cbc0a7666" title="Memory used by bitvector including temp and service blocks.">memory_used</a> += mem_used;

<a name="l00069"></a>00069 <a class="code" href="a00034.html#92f800e8649a1455c17019c8ec882b4b" title="Estimated maximum of memory required for serialization.">max_serialize_mem</a> += mem_used;

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

<a name="l00071"></a>00071

<a name="l00072"></a>00072 /// count gap block

<a name="l00073"></a><a class="code" href="a00034.html#1bb9ac89eb4e09368373737d1da1a978">00073</a> void <a class="code" href="a00034.html#1bb9ac89eb4e09368373737d1da1a978" title="count gap block">add_gap_block</a>(unsigned capacity, unsigned length)

<a name="l00074"></a>00074 {

<a name="l00075"></a>00075 ++<a class="code" href="a00034.html#4dcfd64e9ab0be5472e3c2b04e551f81" title="Number of GAP blocks.">gap_blocks</a>;

100

<a name="l00076"></a>00076 unsigned mem_used = capacity * sizeof(<a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>);

101

<a name="l00077"></a>00077 <a class="code" href="a00034.html#d3b2190eb4afe24ecd56323cbc0a7666" title="Memory used by bitvector including temp and service blocks.">memory_used</a> += mem_used;

102

<a name="l00078"></a>00078 <a class="code" href="a00034.html#92f800e8649a1455c17019c8ec882b4b" title="Estimated maximum of memory required for serialization.">max_serialize_mem</a> += length * sizeof(<a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>);

103

<a name="l00079"></a>00079 }

104

<a name="l00080"></a>00080 };

105

<a name="l00081"></a>00081

106

<a name="l00082"></a>00082

107

<a name="l00083"></a>00083 /*! @defgroup gapfunc GAP functions

108

<a name="l00084"></a>00084 * GAP functions implement different opereations on GAP compressed blocks

109

<a name="l00085"></a>00085 * and serve as a minimal building blocks.

110

<a name="l00086"></a>00086 * @ingroup bmagic

111

<a name="l00087"></a>00087 *

112

<a name="l00088"></a>00088 */

113

<a name="l00089"></a>00089

114

<a name="l00090"></a>00090 /*! @defgroup bitfunc BIT functions

115

<a name="l00091"></a>00091 * Bit functions implement different opereations on bit blocks

116

<a name="l00092"></a>00092 * and serve as a minimal building blocks.

117

<a name="l00093"></a>00093 * @ingroup bmagic

118

<a name="l00094"></a>00094 */

119

<a name="l00095"></a>00095

120

<a name="l00096"></a>00096

121

<a name="l00097"></a>00097 /*! @brief Default GAP lengths table.

122

<a name="l00098"></a>00098 @ingroup gapfunc

123

<a name="l00099"></a>00099 */

124

<a name="l00100"></a><a class="code" href="a00050.html">00100</a> template<bool T> struct <a class="code" href="a00050.html" title="Default GAP lengths table.">gap_len_table</a>

125

<a name="l00101"></a>00101 {

126

<a name="l00102"></a><a class="code" href="a00050.html#f9260645490e8cac0769ba84847d4512">00102</a> static const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a> <a class="code" href="a00050.html#f9260645490e8cac0769ba84847d4512">_len</a>[<a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>];

127

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

128

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

129

<a name="l00105"></a>00105 template<bool T>

130

<a name="l00106"></a>00106 const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a> <a class="code" href="a00050.html" title="Default GAP lengths table.">gap_len_table<T>::_len</a>[<a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>] =

131

<a name="l00107"></a>00107 { 128, 256, 512, <a class="code" href="a00078.html#a5e01dfb650d168f9be0525e042af647">bm::gap_max_buff_len</a> };

132

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

133

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

134

<a name="l00110"></a>00110 /*! @brief Alternative GAP lengths table.

135

<a name="l00111"></a>00111 Good for for memory saver mode and very sparse bitsets.

136

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

137

<a name="l00113"></a>00113 @ingroup gapfunc

138

<a name="l00114"></a>00114 */

139

<a name="l00115"></a><a class="code" href="a00051.html">00115</a> template<bool T> struct <a class="code" href="a00051.html" title="Alternative GAP lengths table. Good for for memory saver mode and very sparse bitsets...">gap_len_table_min</a>

140

<a name="l00116"></a>00116 {

141

<a name="l00117"></a><a class="code" href="a00051.html#7049262dea6250b11522da8e8359eefc">00117</a> static const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a> <a class="code" href="a00051.html#7049262dea6250b11522da8e8359eefc">_len</a>[<a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>];

142

<a name="l00118"></a>00118 };

143

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

144

<a name="l00120"></a>00120 template<bool T>

145

<a name="l00121"></a>00121 const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a> <a class="code" href="a00051.html" title="Alternative GAP lengths table. Good for for memory saver mode and very sparse bitsets...">gap_len_table_min<T>::_len</a>[<a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>] =

146

<a name="l00122"></a>00122 { 32, 96, 128, 512 };

147

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

148

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

149

<a name="l00125"></a>00125 //---------------------------------------------------------------------

150

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

151

<a name="l00127"></a>00127 /** Structure to aid in counting bits

152

<a name="l00128"></a>00128 table contains count of bits in 0-255 diapason of numbers

153

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

154

<a name="l00130"></a>00130 @ingroup bitfunc

155

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

156

<a name="l00132"></a><a class="code" href="a00022.html">00132</a> template<bool T> struct <a class="code" href="a00022.html" title="Structure to aid in counting bits table contains count of bits in 0-255 diapason...">bit_count_table</a>

157

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

158

<a name="l00134"></a><a class="code" href="a00022.html#eeb872f5ae25ea7f7977decb8fa42296">00134</a> static const unsigned char <a class="code" href="a00022.html#eeb872f5ae25ea7f7977decb8fa42296">_count</a>[256];

159

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

160

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

161

<a name="l00137"></a>00137 template<bool T>

162

<a name="l00138"></a>00138 const unsigned char <a class="code" href="a00022.html" title="Structure to aid in counting bits table contains count of bits in 0-255 diapason...">bit_count_table<T>::_count</a>[256] = {

163

<a name="l00139"></a>00139 0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,

164

<a name="l00140"></a>00140 1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,

165

<a name="l00141"></a>00141 1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,

166

<a name="l00142"></a>00142 2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,

167

<a name="l00143"></a>00143 1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,

168

<a name="l00144"></a>00144 2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,

169

<a name="l00145"></a>00145 2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,

170

<a name="l00146"></a>00146 3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8

171

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

172

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

173

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

174

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

175

<a name="l00151"></a>00151 /** Structure keeps all-left/right ON bits masks.

176

<a name="l00152"></a>00152 @ingroup bitfunc

177

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

178

<a name="l00154"></a><a class="code" href="a00032.html">00154</a> template<bool T> struct <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table</a>

179

<a name="l00155"></a>00155 {

180

<a name="l00156"></a><a class="code" href="a00032.html#1232d75261b0e191a7c1716bcb6b9986">00156</a> static const unsigned <a class="code" href="a00032.html#1232d75261b0e191a7c1716bcb6b9986">_left</a>[32];

181

<a name="l00157"></a><a class="code" href="a00032.html#b572931e24924b8632189403d6078b52">00157</a> static const unsigned <a class="code" href="a00032.html#b572931e24924b8632189403d6078b52">_right</a>[32];

182

<a name="l00158"></a>00158 };

183

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

184

<a name="l00160"></a>00160 template<bool T>

185

<a name="l00161"></a>00161 const unsigned <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<T>::_left</a>[32] = {

186

<a name="l00162"></a>00162 0x1, 0x3, 0x7, 0xf, 0x1f, 0x3f, 0x7f, 0xff, 0x1ff, 0x3ff, 0x7ff,

187

<a name="l00163"></a>00163 0xfff, 0x1fff, 0x3fff, 0x7fff, 0xffff, 0x1ffff, 0x3ffff, 0x7ffff,

188

<a name="l00164"></a>00164 0xfffff, 0x1fffff, 0x3fffff, 0x7fffff, 0xffffff, 0x1ffffff, 0x3ffffff,

189

<a name="l00165"></a>00165 0x7ffffff, 0xfffffff, 0x1fffffff, 0x3fffffff, 0x7fffffff, 0xffffffff

190

<a name="l00166"></a>00166 };

191

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

192

<a name="l00168"></a>00168 template<bool T>

193

<a name="l00169"></a>00169 const unsigned block_set_table<T>::_right[32] = {

194

<a name="l00170"></a>00170 0xffffffff, 0xfffffffe, 0xfffffffc, 0xfffffff8, 0xfffffff0,

195

<a name="l00171"></a>00171 0xffffffe0, 0xffffffc0, 0xffffff80, 0xffffff00, 0xfffffe00,

196

<a name="l00172"></a>00172 0xfffffc00, 0xfffff800, 0xfffff000, 0xffffe000, 0xffffc000,

197

<a name="l00173"></a>00173 0xffff8000, 0xffff0000, 0xfffe0000, 0xfffc0000, 0xfff80000,

198

<a name="l00174"></a>00174 0xfff00000, 0xffe00000, 0xffc00000, 0xff800000, 0xff000000,

199

<a name="l00175"></a>00175 0xfe000000, 0xfc000000, 0xf8000000, 0xf0000000, 0xe0000000,

200

<a name="l00176"></a>00176 0xc0000000, 0x80000000

201

<a name="l00177"></a>00177 };

202

<a name="l00178"></a>00178

203

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

204

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

205

<a name="l00181"></a>00181 /** Structure keeps index of first ON bit for every byte.

206

<a name="l00182"></a>00182 @ingroup bitfunc

207

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

208

<a name="l00184"></a><a class="code" href="a00049.html">00184</a> template<bool T> struct <a class="code" href="a00049.html" title="Structure keeps index of first ON bit for every byte.">first_bit_table</a>

209

<a name="l00185"></a>00185 {

210

<a name="l00186"></a><a class="code" href="a00049.html#b40e3234d06d1fadbd82ea00e59d17d7">00186</a> static const char <a class="code" href="a00049.html#b40e3234d06d1fadbd82ea00e59d17d7">_idx</a>[256];

211

<a name="l00187"></a>00187 };

212

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

213

<a name="l00189"></a>00189 template<bool T>

214

<a name="l00190"></a>00190 const char <a class="code" href="a00049.html" title="Structure keeps index of first ON bit for every byte.">first_bit_table<T>::_idx</a>[256] = {

215

<a name="l00191"></a>00191 -1,

216

<a name="l00192"></a>00192 0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,

217

<a name="l00193"></a>00193 1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1, 0,2,0,1,0,3,0,

218

<a name="l00194"></a>00194 1,0,2,0,1,0,6,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,

219

<a name="l00195"></a>00195 0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,0,1,0,

220

<a name="l00196"></a>00196 2,0,1,0,3,0,1,0,2,0,1,0,7,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,4,

221

<a name="l00197"></a>00197 0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,2,0,

222

<a name="l00198"></a>00198 1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,6,0,1,0,2,0,1,0,3,0,1,

223

<a name="l00199"></a>00199 0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,

224

<a name="l00200"></a>00200 3,0,1,0,2,0,1,0,4,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0

225

<a name="l00201"></a>00201 };

226

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

227

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

228

<a name="l00204"></a>00204 /*!

229

<a name="l00205"></a>00205 Define calculates number of 1 bits in 32-bit word.

230

<a name="l00206"></a>00206 @ingroup bitfunc

231

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

232

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

233

<a name="l00209"></a><a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">00209</a> #define BM_INCWORD_BITCOUNT(cnt, w) cnt += \

234

<a name="l00210"></a>00210 bm::bit_count_table<true>::_count[(unsigned char)(w)] + \

235

<a name="l00211"></a>00211 bm::bit_count_table<true>::_count[(unsigned char)((w) >> 8)] + \

236

<a name="l00212"></a>00212 bm::bit_count_table<true>::_count[(unsigned char)((w) >> 16)] + \

237

<a name="l00213"></a>00213 bm::bit_count_table<true>::_count[(unsigned char)((w) >> 24)];

238

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

239

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

240

<a name="l00216"></a>00216 Returns bit count

241

<a name="l00217"></a>00217 @ingroup bitfunc

242

<a name="l00218"></a>00218 */

243

<a name="l00219"></a>00219 <a class="code" href="a00063.html#938734d014fb68dd8b2251fe8ec2b025">BMFORCEINLINE</a>

244

<a name="l00220"></a><a class="code" href="a00083.html#gef40342b0c318391df3db2b891acf7c1">00220</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#gef40342b0c318391df3db2b891acf7c1">word_bitcount</a>(<a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> w)

245

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

246

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

247

<a name="l00223"></a>00223 <a class="code" href="a00022.html" title="Structure to aid in counting bits table contains count of bits in 0-255 diapason...">bm::bit_count_table<true>::_count</a>[(unsigned char)(w)] +

248

<a name="l00224"></a>00224 <a class="code" href="a00022.html" title="Structure to aid in counting bits table contains count of bits in 0-255 diapason...">bm::bit_count_table<true>::_count</a>[(unsigned char)((w) >> 8)] +

249

<a name="l00225"></a>00225 <a class="code" href="a00022.html" title="Structure to aid in counting bits table contains count of bits in 0-255 diapason...">bm::bit_count_table<true>::_count</a>[(unsigned char)((w) >> 16)] +

250

<a name="l00226"></a>00226 <a class="code" href="a00022.html" title="Structure to aid in counting bits table contains count of bits in 0-255 diapason...">bm::bit_count_table<true>::_count</a>[(unsigned char)((w) >> 24)];

251

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

252

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

253

<a name="l00229"></a>00229 #ifdef BM64OPT

254

<a name="l00230"></a>00230 /*!

255

<a name="l00231"></a>00231 Function calculates number of 1 bits in 64-bit word.

256

<a name="l00232"></a>00232 @ingroup bitfunc

257

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

258

<a name="l00234"></a><a class="code" href="a00083.html#g6db64a80e9d66e4338c6cfdd38464d77">00234</a> inline <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g6db64a80e9d66e4338c6cfdd38464d77">word_bitcount64</a>(<a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a> w)

259

<a name="l00235"></a>00235 {

260

<a name="l00236"></a>00236 w = (w & 0x5555555555555555LU) + (w >> 1 & 0x5555555555555555LU);

261

<a name="l00237"></a>00237 w = (w & 0x3333333333333333LU) + (w >> 2 & 0x3333333333333333LU);

262

<a name="l00238"></a>00238 w = w + (w >> 4) & 0x0F0F0F0F0F0F0F0FLU;

263

<a name="l00239"></a>00239 w = w + (w >> 8);

264

<a name="l00240"></a>00240 w = w + (w >> 16);

265

<a name="l00241"></a>00241 w = w + (w >> 32) & 0x0000007F;

266

<a name="l00242"></a>00242 return (<a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a>)w;

267

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

268

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

269

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

270

<a name="l00246"></a>00246

271

<a name="l00247"></a>00247

272

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

273

<a name="l00249"></a>00249

274

<a name="l00250"></a>00250 /**

275

<a name="l00251"></a>00251 Nomenclature of set operations

276

<a name="l00252"></a>00252 */

277

<a name="l00253"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109">00253</a> enum <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109" title="Nomenclature of set operations.">set_operation</a>

278

<a name="l00254"></a>00254 {

279

<a name="l00255"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109949fba4d9b152e1cbba9a450e05e21a3">00255</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109949fba4d9b152e1cbba9a450e05e21a3">set_AND</a> = 0,

280

<a name="l00256"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec610905d88a2639cbd3d2ac63436df3ed6780">00256</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec610905d88a2639cbd3d2ac63436df3ed6780">set_OR</a> = 1,

281

<a name="l00257"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109348f23af148237ac49194815b222b769">00257</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109348f23af148237ac49194815b222b769">set_SUB</a> = 2,

282

<a name="l00258"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109b823123a0d630167532a96be004e6304">00258</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109b823123a0d630167532a96be004e6304">set_XOR</a> = 3,

283

<a name="l00259"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec610934150dd6a8ac2e70b887565bd1c3f788">00259</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec610934150dd6a8ac2e70b887565bd1c3f788">set_ASSIGN</a> = 4,

284

<a name="l00260"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec61093f165b7944e33214e8721aaf2eb8378e">00260</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec61093f165b7944e33214e8721aaf2eb8378e">set_COUNT</a> = 5,

285

<a name="l00261"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109378be4b14cee6a341e859fd3157ab959">00261</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109378be4b14cee6a341e859fd3157ab959">set_COUNT_AND</a> = 6,

286

<a name="l00262"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec61091373054e4f243dffb762a55b8a8bfe4c">00262</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec61091373054e4f243dffb762a55b8a8bfe4c">set_COUNT_XOR</a> = 7,

287

<a name="l00263"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec610927e34c148d06e3d8a405482d820cd7fb">00263</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec610927e34c148d06e3d8a405482d820cd7fb">set_COUNT_OR</a> = 8,

288

<a name="l00264"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec61090028cc7084b37fe66ce5ae459b93b7f1">00264</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec61090028cc7084b37fe66ce5ae459b93b7f1">set_COUNT_SUB_AB</a>= 9,

289

<a name="l00265"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec61092f7b894c11c058598d02722a7eeef03b">00265</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec61092f7b894c11c058598d02722a7eeef03b">set_COUNT_SUB_BA</a>= 10,

290

<a name="l00266"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109bafe8a971864164aeec7f43d1205ed29">00266</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109bafe8a971864164aeec7f43d1205ed29">set_COUNT_A</a> = 11,

291

<a name="l00267"></a><a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec61092ac4eb7f41d00f8387d5dd3ffb9d0617">00267</a> <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec61092ac4eb7f41d00f8387d5dd3ffb9d0617">set_COUNT_B</a> = 12,

292

<a name="l00268"></a>00268

293

294

<a name="l00270"></a>00270 };

295

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

296

<a name="l00272"></a>00272 /// Returns true if set operation is constant (bitcount)

297

<a name="l00273"></a>00273 inline

298

<a name="l00274"></a><a class="code" href="a00078.html#3deb310cdf11bca948817f94adfec160">00274</a> bool <a class="code" href="a00078.html#3deb310cdf11bca948817f94adfec160" title="Returns true if set operation is constant (bitcount).">is_const_set_operation</a>(<a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109" title="Nomenclature of set operations.">set_operation</a> op)

299

<a name="l00275"></a>00275 {

300

<a name="l00276"></a>00276 return (int(op) >= int(<a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec61093f165b7944e33214e8721aaf2eb8378e">set_COUNT</a>));

301

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

302

<a name="l00278"></a>00278

303

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

304

<a name="l00280"></a>00280 Bit operations enumeration.

305

<a name="l00281"></a>00281 */

306

<a name="l00282"></a><a class="code" href="a00078.html#42405343976ec931388381cea4092bf1">00282</a> enum <a class="code" href="a00078.html#42405343976ec931388381cea4092bf1" title="Bit operations enumeration.">operation</a>

307

<a name="l00283"></a>00283 {

308

<a name="l00284"></a><a class="code" href="a00078.html#42405343976ec931388381cea4092bf1546fdf33b301e5b9bee0591522ed9250">00284</a> <a class="code" href="a00078.html#42405343976ec931388381cea4092bf1546fdf33b301e5b9bee0591522ed9250">BM_AND</a> = <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109949fba4d9b152e1cbba9a450e05e21a3">set_AND</a>,

309

<a name="l00285"></a><a class="code" href="a00078.html#42405343976ec931388381cea4092bf10c8cf0197857d0bd73a63037e2f2c5c5">00285</a> <a class="code" href="a00078.html#42405343976ec931388381cea4092bf10c8cf0197857d0bd73a63037e2f2c5c5">BM_OR</a> = <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec610905d88a2639cbd3d2ac63436df3ed6780">set_OR</a>,

310

<a name="l00286"></a><a class="code" href="a00078.html#42405343976ec931388381cea4092bf11df0f4de7126bb2f7ce69d7a005affb5">00286</a> <a class="code" href="a00078.html#42405343976ec931388381cea4092bf11df0f4de7126bb2f7ce69d7a005affb5">BM_SUB</a> = <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109348f23af148237ac49194815b222b769">set_SUB</a>,

311

312

<a name="l00288"></a>00288 };

313

<a name="l00289"></a>00289

314

<a name="l00290"></a>00290 /**

315

<a name="l00291"></a>00291 Convert set operation to operation

316

<a name="l00292"></a>00292 */

317

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

318

<a name="l00294"></a><a class="code" href="a00078.html#7c192b64adb0590a09b5c2dad77c4b76">00294</a> <a class="code" href="a00078.html#42405343976ec931388381cea4092bf1" title="Bit operations enumeration.">bm::operation</a> <a class="code" href="a00078.html#7c192b64adb0590a09b5c2dad77c4b76" title="Convert set operation to operation.">setop2op</a>(<a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109" title="Nomenclature of set operations.">bm::set_operation</a> op)

319

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

320

<a name="l00296"></a>00296 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(op == <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109949fba4d9b152e1cbba9a450e05e21a3">set_AND</a> ||

321

<a name="l00297"></a>00297 op == <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec610905d88a2639cbd3d2ac63436df3ed6780">set_OR</a> ||

322

<a name="l00298"></a>00298 op == <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109348f23af148237ac49194815b222b769">set_SUB</a> ||

323

<a name="l00299"></a>00299 op == <a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109b823123a0d630167532a96be004e6304">set_XOR</a>);

324

<a name="l00300"></a>00300 return (<a class="code" href="a00078.html#42405343976ec931388381cea4092bf1" title="Bit operations enumeration.">bm::operation</a>) op;

325

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

326

<a name="l00302"></a>00302

327

<a name="l00303"></a>00303 //---------------------------------------------------------------------

328

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

329

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

330

<a name="l00306"></a>00306 Structure carries pointer on bit block with all bits 1

331

<a name="l00307"></a>00307 @ingroup bitfunc

332

<a name="l00308"></a>00308 */

333

<a name="l00309"></a><a class="code" href="a00011.html">00309</a> template<bool T> struct <a class="code" href="a00011.html" title="Structure carries pointer on bit block with all bits 1.">all_set</a>

334

<a name="l00310"></a>00310 {

335

<a name="l00311"></a><a class="code" href="a00012.html">00311</a> struct <a class="code" href="a00012.html">all_set_block</a>

336

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

337

<a name="l00313"></a><a class="code" href="a00012.html#5649986a520b0e413becb609331af061">00313</a> <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> <a class="code" href="a00012.html#5649986a520b0e413becb609331af061">_p</a>[<a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>];

338

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

339

<a name="l00315"></a><a class="code" href="a00012.html#c6ded50eaae111db18cc2a8c3570d3ad">00315</a> <a class="code" href="a00012.html#c6ded50eaae111db18cc2a8c3570d3ad">all_set_block</a>()

340

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

341

<a name="l00317"></a>00317 ::memset(<a class="code" href="a00012.html#5649986a520b0e413becb609331af061">_p</a>, 0xFF, sizeof(<a class="code" href="a00012.html#5649986a520b0e413becb609331af061">_p</a>));

342

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

343

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

344

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

345

<a name="l00321"></a><a class="code" href="a00011.html#76b3fc3c84247ee6d0b8b0b062ece168">00321</a> static <a class="code" href="a00012.html">all_set_block</a> <a class="code" href="a00011.html#76b3fc3c84247ee6d0b8b0b062ece168">_block</a>;

346

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

347

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

348

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

349

<a name="l00325"></a>00325 template<bool T> typename <a class="code" href="a00012.html">all_set<T>::all_set_block</a> <a class="code" href="a00011.html" title="Structure carries pointer on bit block with all bits 1.">all_set<T>::_block</a>;

350

<a name="l00326"></a>00326

351

<a name="l00327"></a>00327 /// XOR swap two scalar variables

352

<a name="l00328"></a>00328 template<typename W>

353

<a name="l00329"></a><a class="code" href="a00078.html#fb2c1acc56270abb381741a709a2b17c">00329</a> void <a class="code" href="a00078.html#fb2c1acc56270abb381741a709a2b17c" title="XOR swap two scalar variables.">xor_swap</a>(W& x, W& y)

354

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

355

<a name="l00331"></a>00331 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(&x != &y);

356

<a name="l00332"></a>00332 x ^= y;

357

<a name="l00333"></a>00333 y ^= x;

358

<a name="l00334"></a>00334 x ^= y;

359

<a name="l00335"></a>00335 }

360

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

361

<a name="l00337"></a>00337

362

<a name="l00338"></a>00338 //---------------------------------------------------------------------

363

<a name="l00339"></a>00339

364

<a name="l00340"></a>00340 /*!

365

<a name="l00341"></a>00341 \brief Lexicographical comparison of two words as bit strings.

366

<a name="l00342"></a>00342 Auxiliary implementation for testing and reference purposes.

367

<a name="l00343"></a>00343 \param buf1 - First word.

368

<a name="l00344"></a>00344 \param buf2 - Second word.

369

<a name="l00345"></a>00345 \return <0 - less, =0 - equal, >0 - greater.

370

<a name="l00346"></a>00346

371

<a name="l00347"></a>00347 @ingroup bitfunc

372

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

373

<a name="l00349"></a><a class="code" href="a00083.html#gfee2e8361c2e90a67dbaf9c7559d50e4">00349</a> template<typename T> int <a class="code" href="a00083.html#gfee2e8361c2e90a67dbaf9c7559d50e4" title="Lexicographical comparison of two words as bit strings. Auxiliary implementation...">wordcmp0</a>(T w1, T w2)

374

<a name="l00350"></a>00350 {

375

<a name="l00351"></a>00351 while (w1 != w2)

376

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

377

<a name="l00353"></a>00353 int res = (w1 & 1) - (w2 & 1);

378

<a name="l00354"></a>00354 if (res != 0) return res;

379

<a name="l00355"></a>00355 w1 >>= 1;

380

<a name="l00356"></a>00356 w2 >>= 1;

381

<a name="l00357"></a>00357 }

382

<a name="l00358"></a>00358 return 0;

383

<a name="l00359"></a>00359 }

384

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

385

<a name="l00361"></a>00361

386

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

387

<a name="l00363"></a>00363 \brief Lexicographical comparison of two words as bit strings.

388

<a name="l00364"></a>00364 Auxiliary implementation for testing and reference purposes.

389

<a name="l00365"></a>00365 \param buf1 - First word.

390

<a name="l00366"></a>00366 \param buf2 - Second word.

391

<a name="l00367"></a>00367 \return <0 - less, =0 - equal, >0 - greater.

392

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

393

<a name="l00369"></a>00369 @ingroup bitfunc

394

<a name="l00370"></a>00370 */

395

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

396

<a name="l00372"></a>00372 template<typename T> int wordcmp(T w1, T w2)

397

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

398

<a name="l00374"></a>00374 T diff = w1 ^ w2;

399

<a name="l00375"></a>00375 return diff ? ((w1 & diff & (diff ^ (diff - 1)))? 1 : -1) : 0;

400

<a name="l00376"></a>00376 }

401

<a name="l00377"></a>00377 */

402

<a name="l00378"></a>00378

403

<a name="l00379"></a><a class="code" href="a00083.html#g5847533a73b7a5125fe5c2888ec827bd">00379</a> template<typename T> int <a class="code" href="a00083.html#g5847533a73b7a5125fe5c2888ec827bd" title="Lexicographical comparison of two words as bit strings. Auxiliary implementation...">wordcmp</a>(T a, T b)

404

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

405

<a name="l00381"></a>00381 T diff = a ^ b;

406

<a name="l00382"></a>00382 return diff? ( (a & diff & -diff)? 1 : -1 ) : 0;

407

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

408

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

409

<a name="l00385"></a>00385

410

<a name="l00386"></a>00386 // Low bit extraction

411

<a name="l00387"></a>00387 // x & (x ^ (x-1))

412

<a name="l00388"></a>00388

413

<a name="l00389"></a>00389

414

<a name="l00390"></a>00390 /**

415

<a name="l00391"></a>00391 Internal structure. Copyright information.

416

<a name="l00392"></a>00392 */

417

<a name="l00393"></a><a class="code" href="a00010.html">00393</a> template<bool T> struct <a class="code" href="a00010.html" title="Internal structure.">_copyright</a>

418

<a name="l00394"></a>00394 {

419

<a name="l00395"></a><a class="code" href="a00010.html#e984547ed47f625743248a9f15654261">00395</a> static const char <a class="code" href="a00010.html#e984547ed47f625743248a9f15654261">_p</a>[];

420

<a name="l00396"></a>00396 };

421

<a name="l00397"></a>00397

422

<a name="l00398"></a>00398 template<bool T> const char <a class="code" href="a00010.html" title="Internal structure.">_copyright<T>::_p</a>[] =

423

424

<a name="l00400"></a>00400

425

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

426

<a name="l00402"></a>00402 /*!

427

<a name="l00403"></a>00403 \brief Byte orders recognized by the library.

428

<a name="l00404"></a>00404 */

429

<a name="l00405"></a><a class="code" href="a00078.html#577905b348676c2bc556b51793350dbb">00405</a> enum <a class="code" href="a00078.html#577905b348676c2bc556b51793350dbb" title="Byte orders recognized by the library.">ByteOrder</a>

430

<a name="l00406"></a>00406 {

431

<a name="l00407"></a><a class="code" href="a00078.html#577905b348676c2bc556b51793350dbbc959b97503c42581f3dd81fd3b93fff2">00407</a> <a class="code" href="a00078.html#577905b348676c2bc556b51793350dbbc959b97503c42581f3dd81fd3b93fff2">BigEndian</a> = 0,

432

<a name="l00408"></a><a class="code" href="a00078.html#577905b348676c2bc556b51793350dbb5ebe266b6d18ee74483c2bbf624e2cc2">00408</a> <a class="code" href="a00078.html#577905b348676c2bc556b51793350dbb5ebe266b6d18ee74483c2bbf624e2cc2">LittleEndian</a> = 1

433

<a name="l00409"></a>00409 };

434

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

435

<a name="l00411"></a>00411

436

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

437

<a name="l00413"></a>00413 Internal structure. Different global settings.

438

<a name="l00414"></a>00414 */

439

<a name="l00415"></a><a class="code" href="a00052.html">00415</a> template<bool T> struct <a class="code" href="a00052.html" title="Internal structure.">globals</a>

440

<a name="l00416"></a>00416 {

441

<a name="l00417"></a><a class="code" href="a00033.html">00417</a> struct <a class="code" href="a00033.html">bo</a>

442

<a name="l00418"></a>00418 {

443

<a name="l00419"></a><a class="code" href="a00033.html#4504994d99344a3d0764398252c22b75">00419</a> <a class="code" href="a00078.html#577905b348676c2bc556b51793350dbb" title="Byte orders recognized by the library.">ByteOrder</a> <a class="code" href="a00033.html#4504994d99344a3d0764398252c22b75">_byte_order</a>;

444

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

445

<a name="l00421"></a><a class="code" href="a00033.html#a0baaeae4028ababdcc71cabd5432360">00421</a> <a class="code" href="a00033.html#a0baaeae4028ababdcc71cabd5432360">bo</a>()

446

<a name="l00422"></a>00422 {

447

<a name="l00423"></a>00423 unsigned x;

448

<a name="l00424"></a>00424 unsigned char *s = (unsigned char *)&x;

449

<a name="l00425"></a>00425 s[0] = 1;

450

<a name="l00426"></a>00426 s[1] = 2;

451

<a name="l00427"></a>00427 s[2] = 3;

452

<a name="l00428"></a>00428 s[3] = 4;

453

<a name="l00429"></a>00429

454

<a name="l00430"></a>00430 if(x == 0x04030201)

455

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

456

<a name="l00432"></a>00432 <a class="code" href="a00033.html#4504994d99344a3d0764398252c22b75">_byte_order</a> = <a class="code" href="a00078.html#577905b348676c2bc556b51793350dbb5ebe266b6d18ee74483c2bbf624e2cc2">LittleEndian</a>;

457

<a name="l00433"></a>00433 return;

458

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

459

<a name="l00435"></a>00435

460

<a name="l00436"></a>00436 if(x == 0x01020304)

461

<a name="l00437"></a>00437 {

462

<a name="l00438"></a>00438 <a class="code" href="a00033.html#4504994d99344a3d0764398252c22b75">_byte_order</a> = <a class="code" href="a00078.html#577905b348676c2bc556b51793350dbbc959b97503c42581f3dd81fd3b93fff2">BigEndian</a>;

463

<a name="l00439"></a>00439 return;

464

<a name="l00440"></a>00440 }

465

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

466

<a name="l00442"></a>00442 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0); // "Invalid Byte Order\n"

467

<a name="l00443"></a>00443 <a class="code" href="a00033.html#4504994d99344a3d0764398252c22b75">_byte_order</a> = <a class="code" href="a00078.html#577905b348676c2bc556b51793350dbb5ebe266b6d18ee74483c2bbf624e2cc2">LittleEndian</a>;

468

<a name="l00444"></a>00444 }

469

<a name="l00445"></a>00445 };

470

<a name="l00446"></a>00446

471

<a name="l00447"></a><a class="code" href="a00052.html#f40c2cad39a7b344ba7d62ff4594669d">00447</a> static <a class="code" href="a00033.html">bo</a> <a class="code" href="a00052.html#f40c2cad39a7b344ba7d62ff4594669d">_bo</a>;

472

<a name="l00448"></a>00448

473

<a name="l00449"></a><a class="code" href="a00052.html#133786f6db9267b0760de9158bee0c36">00449</a> static <a class="code" href="a00078.html#577905b348676c2bc556b51793350dbb" title="Byte orders recognized by the library.">ByteOrder</a> <a class="code" href="a00052.html#133786f6db9267b0760de9158bee0c36">byte_order</a>() { return <a class="code" href="a00052.html#f40c2cad39a7b344ba7d62ff4594669d">_bo</a>.<a class="code" href="a00033.html#4504994d99344a3d0764398252c22b75">_byte_order</a>; }

474

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

475

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

476

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

477

<a name="l00453"></a>00453 template<bool T> typename globals<T>::bo globals<T>::_bo;

478

<a name="l00454"></a>00454

479

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

480

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

481

<a name="l00457"></a>00457

482

<a name="l00458"></a>00458

483

<a name="l00459"></a>00459

484

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

485

<a name="l00461"></a>00461 \brief Binary search for the block where bit = pos located.

486

<a name="l00462"></a>00462 \param buf - GAP buffer pointer.

487

<a name="l00463"></a>00463 \param pos - index of the element.

488

<a name="l00464"></a>00464 \param is_set - output. GAP value (0 or 1).

489

<a name="l00465"></a>00465 \return GAP index.

490

<a name="l00466"></a>00466 @ingroup gapfunc

491

<a name="l00467"></a>00467 */

492

<a name="l00468"></a>00468 template<typename T>

493

<a name="l00469"></a><a class="code" href="a00078.html#cebed8b533c2c9e17167617501477693">00469</a> unsigned <a class="code" href="a00078.html#cebed8b533c2c9e17167617501477693">gap_bfind</a>(const T* buf, unsigned pos, unsigned* is_set)

494

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

495

<a name="l00471"></a>00471 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(pos < <a class="code" href="a00078.html#d0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>);

496

<a name="l00472"></a>00472 *is_set = (*buf) & 1;

497

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

498

<a name="l00474"></a>00474 register unsigned start = 1;

499

<a name="l00475"></a>00475 register unsigned end = 1 + ((*buf) >> 3);

500

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

501

<a name="l00477"></a>00477 while ( start != end )

502

<a name="l00478"></a>00478 {

503

<a name="l00479"></a>00479 unsigned curr = (start + end) >> 1;

504

<a name="l00480"></a>00480 if ( buf[curr] < pos )

505

<a name="l00481"></a>00481 start = curr + 1;

506

<a name="l00482"></a>00482 else

507

<a name="l00483"></a>00483 end = curr;

508

<a name="l00484"></a>00484 }

509

<a name="l00485"></a>00485 *is_set ^= ((start-1) & 1);

510

<a name="l00486"></a>00486 return start;

511

<a name="l00487"></a>00487 }

512

<a name="l00488"></a>00488

513

<a name="l00489"></a>00489

514

<a name="l00490"></a>00490 /*!

515

<a name="l00491"></a>00491 \brief Tests if bit = pos is true.

516

<a name="l00492"></a>00492 \param buf - GAP buffer pointer.

517

<a name="l00493"></a>00493 \param pos - index of the element.

518

<a name="l00494"></a>00494 \return true if position is in "1" gap

519

<a name="l00495"></a>00495 @ingroup gapfunc

520

<a name="l00496"></a>00496 */

521

<a name="l00497"></a><a class="code" href="a00082.html#g866352ef5986a7d2b709795d127b666b">00497</a> template<typename T> unsigned <a class="code" href="a00082.html#g866352ef5986a7d2b709795d127b666b" title="Tests if bit = pos is true.">gap_test</a>(const T* buf, unsigned pos)

522

<a name="l00498"></a>00498 {

523

<a name="l00499"></a>00499 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(pos < <a class="code" href="a00078.html#d0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>);

524

<a name="l00500"></a>00500

525

<a name="l00501"></a>00501 unsigned start = 1;

526

<a name="l00502"></a>00502 unsigned end = 1 + ((*buf) >> 3);

527

<a name="l00503"></a>00503

528

<a name="l00504"></a>00504 if (end - start < 10)

529

<a name="l00505"></a>00505 {

530

<a name="l00506"></a>00506 unsigned sv = *buf & 1;

531

<a name="l00507"></a>00507 unsigned sv1= sv ^ 1;

532

<a name="l00508"></a>00508 if (buf[1] >= pos) return sv;

533

<a name="l00509"></a>00509 if (buf[2] >= pos) return sv1;

534

<a name="l00510"></a>00510 if (buf[3] >= pos) return sv;

535

<a name="l00511"></a>00511 if (buf[4] >= pos) return sv1;

536

<a name="l00512"></a>00512 if (buf[5] >= pos) return sv;

537

<a name="l00513"></a>00513 if (buf[6] >= pos) return sv1;

538

<a name="l00514"></a>00514 if (buf[7] >= pos) return sv;

539

<a name="l00515"></a>00515 if (buf[8] >= pos) return sv1;

540

<a name="l00516"></a>00516 if (buf[9] >= pos) return sv;

541

<a name="l00517"></a>00517 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

542

<a name="l00518"></a>00518 }

543

<a name="l00519"></a>00519 else

544

<a name="l00520"></a>00520 while ( start != end )

545

<a name="l00521"></a>00521 {

546

<a name="l00522"></a>00522 unsigned curr = (start + end) >> 1;

547

<a name="l00523"></a>00523 if ( buf[curr] < pos )

548

<a name="l00524"></a>00524 start = curr + 1;

549

<a name="l00525"></a>00525 else

550

<a name="l00526"></a>00526 end = curr;

551

<a name="l00527"></a>00527 }

552

<a name="l00528"></a>00528 return ((*buf) & 1) ^ ((--start) & 1);

553

<a name="l00529"></a>00529 }

554

<a name="l00530"></a>00530

555

<a name="l00531"></a>00531

556

<a name="l00532"></a>00532 /*! For each non-zero block executes supplied function.

557

<a name="l00533"></a>00533 */

558

<a name="l00534"></a>00534 template<class T, class F>

559

<a name="l00535"></a><a class="code" href="a00078.html#e8b342c25dc22d6cd26cb96d7ae796db">00535</a> void <a class="code" href="a00078.html#e8b342c25dc22d6cd26cb96d7ae796db">for_each_nzblock</a>(T*** root, unsigned size1, unsigned size2,

560

<a name="l00536"></a>00536 F& f)

561

<a name="l00537"></a>00537 {

562

<a name="l00538"></a>00538 unsigned block_idx = 0;

563

<a name="l00539"></a>00539 for (unsigned i = 0; i < size1; ++i)

564

<a name="l00540"></a>00540 {

565

<a name="l00541"></a>00541 T** blk_blk = root[i];

566

<a name="l00542"></a>00542

567

<a name="l00543"></a>00543 if (!blk_blk)

568

<a name="l00544"></a>00544 {

569

<a name="l00545"></a>00545 f.on_empty_top(i);

570

<a name="l00546"></a>00546 block_idx += size2;

571

<a name="l00547"></a>00547 continue;

572

<a name="l00548"></a>00548 }

573

<a name="l00549"></a>00549

574

<a name="l00550"></a>00550 unsigned non_empty_top = 0;

575

<a name="l00551"></a>00551 for (unsigned j = 0;j < size2; ++j, ++block_idx)

576

<a name="l00552"></a>00552 {

577

<a name="l00553"></a>00553 if (blk_blk[j])

578

<a name="l00554"></a>00554 {

579

<a name="l00555"></a>00555 f(blk_blk[j], block_idx);

580

<a name="l00556"></a>00556 // re-check (blk_blk[j]): could be a mutation

581

<a name="l00557"></a>00557 non_empty_top += (blk_blk[j] != 0);

582

<a name="l00558"></a>00558 }

583

<a name="l00559"></a>00559 else

584

<a name="l00560"></a>00560 {

585

<a name="l00561"></a>00561 f.on_empty_block(block_idx);

586

<a name="l00562"></a>00562 }

587

<a name="l00563"></a>00563 } // for j

588

<a name="l00564"></a>00564 if (non_empty_top == 0)

589

<a name="l00565"></a>00565 {

590

<a name="l00566"></a>00566 f.on_empty_top(i);

591

<a name="l00567"></a>00567 }

592

<a name="l00568"></a>00568 } // for i

593

<a name="l00569"></a>00569 }

594

<a name="l00570"></a>00570

595

<a name="l00571"></a>00571 /*! For each non-zero block executes supplied function-predicate.

596

<a name="l00572"></a>00572 Function returns if function-predicate returns true

597

<a name="l00573"></a>00573 */

598

<a name="l00574"></a>00574 template<class T, class F>

599

<a name="l00575"></a><a class="code" href="a00078.html#6f5cb8cbb105eae84d4b0f8a3bc1230f">00575</a> bool <a class="code" href="a00078.html#6f5cb8cbb105eae84d4b0f8a3bc1230f">for_each_nzblock_if</a>(T*** root, unsigned size1, unsigned size2, F& f)

600

<a name="l00576"></a>00576 {

601

<a name="l00577"></a>00577 unsigned block_idx = 0;

602

<a name="l00578"></a>00578 for (unsigned i = 0; i < size1; ++i)

603

<a name="l00579"></a>00579 {

604

<a name="l00580"></a>00580 T** blk_blk = root[i];

605

<a name="l00581"></a>00581

606

<a name="l00582"></a>00582 if (!blk_blk)

607

<a name="l00583"></a>00583 {

608

<a name="l00584"></a>00584 block_idx += <a class="code" href="a00078.html#40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>;

609

<a name="l00585"></a>00585 continue;

610

<a name="l00586"></a>00586 }

611

<a name="l00587"></a>00587

612

<a name="l00588"></a>00588 for (unsigned j = 0;j < size2; ++j, ++block_idx)

613

<a name="l00589"></a>00589 {

614

<a name="l00590"></a>00590 if (blk_blk[j])

615

<a name="l00591"></a>00591 if (f(blk_blk[j], block_idx)) return true;

616

<a name="l00592"></a>00592 }

617

<a name="l00593"></a>00593 }

618

<a name="l00594"></a>00594 return false;

619

<a name="l00595"></a>00595 }

620

<a name="l00596"></a>00596

621

<a name="l00597"></a>00597 /*! For each block executes supplied function.

622

<a name="l00598"></a>00598 */

623

<a name="l00599"></a>00599 template<class T, class F>

624

<a name="l00600"></a><a class="code" href="a00078.html#86742a3e17527be5a9743f26b36a7691">00600</a> void <a class="code" href="a00078.html#86742a3e17527be5a9743f26b36a7691">for_each_block</a>(T*** root, unsigned size1, unsigned size2, F& f)

625

<a name="l00601"></a>00601 {

626

<a name="l00602"></a>00602 unsigned block_idx = 0;

627

<a name="l00603"></a>00603

628

<a name="l00604"></a>00604 for (unsigned i = 0; i < size1; ++i)

629

<a name="l00605"></a>00605 {

630

<a name="l00606"></a>00606 T** blk_blk = root[i];

631

<a name="l00607"></a>00607

632

<a name="l00608"></a>00608 if (blk_blk)

633

<a name="l00609"></a>00609 {

634

<a name="l00610"></a>00610 for (unsigned j = 0;j < size2; ++j, ++block_idx)

635

<a name="l00611"></a>00611 {

636

<a name="l00612"></a>00612 f(blk_blk[j], block_idx);

637

<a name="l00613"></a>00613 }

638

<a name="l00614"></a>00614 }

639

<a name="l00615"></a>00615 else

640

<a name="l00616"></a>00616 {

641

<a name="l00617"></a>00617 for (unsigned j = 0;j < size2; ++j, ++block_idx)

642

<a name="l00618"></a>00618 {

643

<a name="l00619"></a>00619 f(0, block_idx);

644

<a name="l00620"></a>00620 }

645

<a name="l00621"></a>00621 }

646

<a name="l00622"></a>00622 }

647

<a name="l00623"></a>00623 }

648

<a name="l00624"></a>00624

649

<a name="l00625"></a>00625

650

<a name="l00626"></a>00626

651

<a name="l00627"></a>00627 /*! Special BM optimized analog of STL for_each

652

<a name="l00628"></a>00628 */

653

<a name="l00629"></a><a class="code" href="a00078.html#bf587377ca70f11b8eb75f95494830b5">00629</a> template<class T, class F> F <a class="code" href="a00078.html#bf587377ca70f11b8eb75f95494830b5">bmfor_each</a>(T first, T last, F f)

654

<a name="l00630"></a>00630 {

655

<a name="l00631"></a>00631 do

656

<a name="l00632"></a>00632 {

657

<a name="l00633"></a>00633 f(*first);

658

<a name="l00634"></a>00634 ++first;

659

<a name="l00635"></a>00635 } while (first < last);

660

<a name="l00636"></a>00636 return f;

661

<a name="l00637"></a>00637 }

662

<a name="l00638"></a>00638

663

<a name="l00639"></a>00639 /*! Computes SUM of all elements of the sequence

664

<a name="l00640"></a>00640 */

665

<a name="l00641"></a><a class="code" href="a00078.html#c8f3443ba8fcd1b28face4b09dfd21bf">00641</a> template<class T> T <a class="code" href="a00078.html#c8f3443ba8fcd1b28face4b09dfd21bf">sum_arr</a>(T* first, T* last)

666

<a name="l00642"></a>00642 {

667

<a name="l00643"></a>00643 T sum = 0;

668

<a name="l00644"></a>00644 while (first < last)

669

<a name="l00645"></a>00645 {

670

<a name="l00646"></a>00646 sum += *first;

671

<a name="l00647"></a>00647 ++first;

672

<a name="l00648"></a>00648 }

673

<a name="l00649"></a>00649 return sum;

674

<a name="l00650"></a>00650 }

675

<a name="l00651"></a>00651

676

<a name="l00652"></a>00652

677

<a name="l00653"></a>00653 /*!

678

<a name="l00654"></a>00654 \brief Calculates number of bits ON in GAP buffer.

679

<a name="l00655"></a>00655 \param buf - GAP buffer pointer.

680

<a name="l00656"></a>00656 \return Number of non-zero bits.

681

<a name="l00657"></a>00657 @ingroup gapfunc

682

<a name="l00658"></a>00658 */

683

<a name="l00659"></a><a class="code" href="a00082.html#g226273a798a07069564e73eb98d06838">00659</a> template<typename T> unsigned <a class="code" href="a00082.html#g226273a798a07069564e73eb98d06838" title="Calculates number of bits ON in GAP buffer.">gap_bit_count</a>(const T* buf)

684

<a name="l00660"></a>00660 {

685

<a name="l00661"></a>00661 register const T* pcurr = buf;

686

<a name="l00662"></a>00662 register const T* pend = pcurr + (*pcurr >> 3);

687

<a name="l00663"></a>00663

688

<a name="l00664"></a>00664 register unsigned bits_counter = 0;

689

<a name="l00665"></a>00665 ++pcurr;

690

<a name="l00666"></a>00666

691

<a name="l00667"></a>00667 if (*buf & 1)

692

<a name="l00668"></a>00668 {

693

<a name="l00669"></a>00669 bits_counter += *pcurr + 1;

694

<a name="l00670"></a>00670 ++pcurr;

695

<a name="l00671"></a>00671 }

696

<a name="l00672"></a>00672 ++pcurr; // set GAP to 1

697

<a name="l00673"></a>00673

698

<a name="l00674"></a>00674 while (pcurr <= pend)

699

<a name="l00675"></a>00675 {

700

<a name="l00676"></a>00676 bits_counter += *pcurr - *(pcurr-1);

701

<a name="l00677"></a>00677 pcurr += 2; // jump to the next positive GAP

702

<a name="l00678"></a>00678 }

703

<a name="l00679"></a>00679

704

<a name="l00680"></a>00680 return bits_counter;

705

<a name="l00681"></a>00681 }

706

<a name="l00682"></a>00682

707

<a name="l00683"></a>00683 /*!

708

<a name="l00684"></a>00684 \brief Counts 1 bits in GAP buffer in the closed [left, right] diapason.

709

<a name="l00685"></a>00685 \param buf - GAP buffer pointer.

710

<a name="l00686"></a>00686 \param left - leftmost bit index to start from

711

<a name="l00687"></a>00687 \param right- rightmost bit index

712

<a name="l00688"></a>00688 \return Number of non-zero bits.

713

<a name="l00689"></a>00689 */

714

<a name="l00690"></a>00690 template<typename T>

715

<a name="l00691"></a><a class="code" href="a00078.html#7324ebded429e15361f62117a2ff18d1">00691</a> unsigned <a class="code" href="a00078.html#7324ebded429e15361f62117a2ff18d1" title="Counts 1 bits in GAP buffer in the closed [left, right] diapason.">gap_bit_count_range</a>(const T* buf, T left, T right)

716

<a name="l00692"></a>00692 {

717

<a name="l00693"></a>00693 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(left <= right);

718

<a name="l00694"></a>00694

719

<a name="l00695"></a>00695 const T* pcurr = buf;

720

<a name="l00696"></a>00696 const T* pend = pcurr + (*pcurr >> 3);

721

<a name="l00697"></a>00697

722

<a name="l00698"></a>00698 unsigned bits_counter = 0;

723

<a name="l00699"></a>00699 unsigned is_set;

724

<a name="l00700"></a>00700 unsigned start_pos = <a class="code" href="a00078.html#cebed8b533c2c9e17167617501477693">gap_bfind</a>(buf, left, &is_set);

725

<a name="l00701"></a>00701

726

<a name="l00702"></a>00702 pcurr = buf + start_pos;

727

<a name="l00703"></a>00703 if (right <= *pcurr) // we are in the target block right now

728

<a name="l00704"></a>00704 {

729

<a name="l00705"></a>00705 if (is_set)

730

<a name="l00706"></a>00706 bits_counter = (right - left + 1);

731

<a name="l00707"></a>00707 return bits_counter;

732

<a name="l00708"></a>00708 }

733

<a name="l00709"></a>00709 if (is_set)

734

<a name="l00710"></a>00710 bits_counter += *pcurr - left + 1;

735

<a name="l00711"></a>00711

736

<a name="l00712"></a>00712 unsigned prev_gap = *pcurr++;

737

<a name="l00713"></a>00713 is_set ^= 1;

738

<a name="l00714"></a>00714 while (right > *pcurr)

739

<a name="l00715"></a>00715 {

740

<a name="l00716"></a>00716 if (is_set)

741

<a name="l00717"></a>00717 bits_counter += *pcurr - prev_gap;

742

<a name="l00718"></a>00718 if (pcurr == pend)

743

<a name="l00719"></a>00719 return bits_counter;

744

<a name="l00720"></a>00720 prev_gap = *pcurr++;

745

<a name="l00721"></a>00721 is_set ^= 1;

746

<a name="l00722"></a>00722 }

747

<a name="l00723"></a>00723 if (is_set)

748

<a name="l00724"></a>00724 bits_counter += right - prev_gap;

749

<a name="l00725"></a>00725

750

<a name="l00726"></a>00726 return bits_counter;

751

<a name="l00727"></a>00727 }

752

<a name="l00728"></a>00728

753

<a name="l00729"></a>00729

754

<a name="l00730"></a>00730

755

<a name="l00731"></a>00731 /*!

756

<a name="l00732"></a>00732 \brief Lexicographical comparison of GAP buffers.

757

<a name="l00733"></a>00733 \param buf1 - First GAP buffer pointer.

758

<a name="l00734"></a>00734 \param buf2 - Second GAP buffer pointer.

759

<a name="l00735"></a>00735 \return <0 - less, =0 - equal, >0 - greater.

760

<a name="l00736"></a>00736

761

<a name="l00737"></a>00737 @ingroup gapfunc

762

<a name="l00738"></a>00738 */

763

<a name="l00739"></a><a class="code" href="a00082.html#g406952734f1b05962941b32e37b3eb96">00739</a> template<typename T> int <a class="code" href="a00082.html#g406952734f1b05962941b32e37b3eb96" title="Lexicographical comparison of GAP buffers.">gapcmp</a>(const T* buf1, const T* buf2)

764

<a name="l00740"></a>00740 {

765

<a name="l00741"></a>00741 const T* pcurr1 = buf1;

766

<a name="l00742"></a>00742 const T* pend1 = pcurr1 + (*pcurr1 >> 3);

767

<a name="l00743"></a>00743 unsigned bitval1 = *buf1 & 1;

768

<a name="l00744"></a>00744 ++pcurr1;

769

<a name="l00745"></a>00745

770

<a name="l00746"></a>00746 const T* pcurr2 = buf2;

771

<a name="l00747"></a>00747 unsigned bitval2 = *buf2 & 1;

772

<a name="l00748"></a>00748 ++pcurr2;

773

<a name="l00749"></a>00749

774

<a name="l00750"></a>00750 while (pcurr1 <= pend1)

775

<a name="l00751"></a>00751 {

776

<a name="l00752"></a>00752 if (*pcurr1 == *pcurr2)

777

<a name="l00753"></a>00753 {

778

<a name="l00754"></a>00754 if (bitval1 != bitval2)

779

<a name="l00755"></a>00755 {

780

<a name="l00756"></a>00756 return (bitval1) ? 1 : -1;

781

<a name="l00757"></a>00757 }

782

<a name="l00758"></a>00758 }

783

<a name="l00759"></a>00759 else

784

<a name="l00760"></a>00760 {

785

<a name="l00761"></a>00761 if (bitval1 == bitval2)

786

<a name="l00762"></a>00762 {

787

<a name="l00763"></a>00763 if (bitval1)

788

<a name="l00764"></a>00764 {

789

<a name="l00765"></a>00765 return (*pcurr1 < *pcurr2) ? -1 : 1;

790

<a name="l00766"></a>00766 }

791

<a name="l00767"></a>00767 else

792

<a name="l00768"></a>00768 {

793

<a name="l00769"></a>00769 return (*pcurr1 < *pcurr2) ? 1 : -1;

794

<a name="l00770"></a>00770 }

795

<a name="l00771"></a>00771 }

796

<a name="l00772"></a>00772 else

797

<a name="l00773"></a>00773 {

798

<a name="l00774"></a>00774 return (bitval1) ? 1 : -1;

799

<a name="l00775"></a>00775 }

800

<a name="l00776"></a>00776 }

801

<a name="l00777"></a>00777

802

<a name="l00778"></a>00778 ++pcurr1; ++pcurr2;

803

<a name="l00779"></a>00779

804

<a name="l00780"></a>00780 bitval1 ^= 1;

805

<a name="l00781"></a>00781 bitval2 ^= 1;

806

<a name="l00782"></a>00782 }

807

<a name="l00783"></a>00783

808

<a name="l00784"></a>00784 return 0;

809

<a name="l00785"></a>00785 }

810

<a name="l00786"></a>00786

811

<a name="l00787"></a>00787

812

<a name="l00788"></a>00788 /*!

813

<a name="l00789"></a>00789 \brief Abstract operation for GAP buffers.

814

<a name="l00790"></a>00790 Receives functor F as a template argument

815

<a name="l00791"></a>00791 \param dest - destination memory buffer.

816

<a name="l00792"></a>00792 \param vect1 - operand 1 GAP encoded buffer.

817

<a name="l00793"></a>00793 \param vect1_mask - XOR mask for starting bitflag for vector1

818

<a name="l00794"></a>00794 can be 0 or 1 (1 inverts the vector)

819

<a name="l00795"></a>00795 \param vect2 - operand 2 GAP encoded buffer.

820

<a name="l00796"></a>00796 \param vect2_mask - same as vect1_mask

821

<a name="l00797"></a>00797 \param f - operation functor.

822

<a name="l00798"></a>00798 \note Internal function.

823

<a name="l00799"></a>00799

824

<a name="l00800"></a>00800 @ingroup gapfunc

825

<a name="l00801"></a>00801 */

826

<a name="l00802"></a>00802 template<typename T, class F>

827

<a name="l00803"></a><a class="code" href="a00082.html#g871d779996e976755140eb7dc1553e23">00803</a> void <a class="code" href="a00082.html#g871d779996e976755140eb7dc1553e23" title="Abstract operation for GAP buffers. Receives functor F as a template argument.">gap_buff_op</a>(T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dest,

828

<a name="l00804"></a>00804 const T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect1,

829

<a name="l00805"></a>00805 unsigned vect1_mask,

830

<a name="l00806"></a>00806 const T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect2,

831

<a name="l00807"></a>00807 unsigned vect2_mask,

832

<a name="l00808"></a>00808 F f)

833

<a name="l00809"></a>00809 {

834

<a name="l00810"></a>00810 register const T* cur1 = vect1;

835

<a name="l00811"></a>00811 register const T* cur2 = vect2;

836

<a name="l00812"></a>00812

837

<a name="l00813"></a>00813 unsigned bitval1 = (*cur1++ & 1) ^ vect1_mask;

838

<a name="l00814"></a>00814 unsigned bitval2 = (*cur2++ & 1) ^ vect2_mask;

839

<a name="l00815"></a>00815

840

<a name="l00816"></a>00816 unsigned bitval = f(bitval1, bitval2);

841

<a name="l00817"></a>00817 unsigned bitval_prev = bitval;

842

<a name="l00818"></a>00818

843

<a name="l00819"></a>00819 register T* res = dest;

844

<a name="l00820"></a>00820 *res = bitval;

845

<a name="l00821"></a>00821 ++res;

846

<a name="l00822"></a>00822

847

<a name="l00823"></a>00823 while (1)

848

<a name="l00824"></a>00824 {

849

<a name="l00825"></a>00825 bitval = f(bitval1, bitval2);

850

<a name="l00826"></a>00826

851

<a name="l00827"></a>00827 // Check if GAP value changes and we need to

852

<a name="l00828"></a>00828 // start the next one.

853

<a name="l00829"></a>00829 if (bitval != bitval_prev)

854

<a name="l00830"></a>00830 {

855

<a name="l00831"></a>00831 ++res;

856

<a name="l00832"></a>00832 bitval_prev = bitval;

857

<a name="l00833"></a>00833 }

858

<a name="l00834"></a>00834

859

<a name="l00835"></a>00835 if (*cur1 < *cur2)

860

<a name="l00836"></a>00836 {

861

<a name="l00837"></a>00837 *res = *cur1;

862

<a name="l00838"></a>00838 ++cur1;

863

<a name="l00839"></a>00839 bitval1 ^= 1;

864

<a name="l00840"></a>00840 }

865

<a name="l00841"></a>00841 else // >=

866

<a name="l00842"></a>00842 {

867

<a name="l00843"></a>00843 *res = *cur2;

868

<a name="l00844"></a>00844 if (*cur2 < *cur1)

869

<a name="l00845"></a>00845 {

870

<a name="l00846"></a>00846 bitval2 ^= 1;

871

<a name="l00847"></a>00847 }

872

<a name="l00848"></a>00848 else // equal

873

<a name="l00849"></a>00849 {

874

<a name="l00850"></a>00850 if (*cur2 == (<a class="code" href="a00078.html#d0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a> - 1))

875

<a name="l00851"></a>00851 {

876

<a name="l00852"></a>00852 break;

877

<a name="l00853"></a>00853 }

878

<a name="l00854"></a>00854

879

<a name="l00855"></a>00855 ++cur1;

880

<a name="l00856"></a>00856 bitval1 ^= 1;

881

<a name="l00857"></a>00857 bitval2 ^= 1;

882

<a name="l00858"></a>00858 }

883

<a name="l00859"></a>00859 ++cur2;

884

<a name="l00860"></a>00860 }

885

<a name="l00861"></a>00861

886

<a name="l00862"></a>00862 } // while

887

<a name="l00863"></a>00863

888

<a name="l00864"></a>00864 unsigned dlen = (unsigned)(res - dest);

889

<a name="l00865"></a>00865 *dest = (*dest & 7) + (dlen << 3);

890

<a name="l00866"></a>00866

891

<a name="l00867"></a>00867 }

892

<a name="l00868"></a>00868

893

<a name="l00869"></a>00869 /*!

894

<a name="l00870"></a>00870 \brief Abstract distance test operation for GAP buffers.

895

<a name="l00871"></a>00871 Receives functor F as a template argument

896

<a name="l00872"></a>00872 \param vect1 - operand 1 GAP encoded buffer.

897

<a name="l00873"></a>00873 \param vect1_mask - XOR mask for starting bitflag for vector1

898

<a name="l00874"></a>00874 can be 0 or 1 (1 inverts the vector)

899

<a name="l00875"></a>00875 \param vect2 - operand 2 GAP encoded buffer.

900

<a name="l00876"></a>00876 \param vect2_mask - same as vect1_mask

901

<a name="l00877"></a>00877 \param f - operation functor.

902

<a name="l00878"></a>00878 \note Internal function.

903

<a name="l00879"></a>00879 \return non zero value if operation result returns any 1 bit

904

<a name="l00880"></a>00880

905

<a name="l00881"></a>00881 @ingroup gapfunc

906

<a name="l00882"></a>00882 */

907

<a name="l00883"></a>00883 template<typename T, class F>

908

<a name="l00884"></a><a class="code" href="a00082.html#g5e3123c3c9d3587f470abdbe6c8c3ad3">00884</a> unsigned <a class="code" href="a00082.html#g5e3123c3c9d3587f470abdbe6c8c3ad3" title="Abstract distance test operation for GAP buffers. Receives functor F as a template...">gap_buff_any_op</a>(const T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect1,

909

<a name="l00885"></a>00885 unsigned vect1_mask,

910

<a name="l00886"></a>00886 const T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect2,

911

<a name="l00887"></a>00887 unsigned vect2_mask,

912

<a name="l00888"></a>00888 F f)

913

<a name="l00889"></a>00889 {

914

<a name="l00890"></a>00890 register const T* cur1 = vect1;

915

<a name="l00891"></a>00891 register const T* cur2 = vect2;

916

<a name="l00892"></a>00892

917

<a name="l00893"></a>00893 unsigned bitval1 = (*cur1++ & 1) ^ vect1_mask;

918

<a name="l00894"></a>00894 unsigned bitval2 = (*cur2++ & 1) ^ vect2_mask;

919

<a name="l00895"></a>00895

920

<a name="l00896"></a>00896 unsigned bitval = f(bitval1, bitval2);

921

<a name="l00897"></a>00897 if (bitval)

922

<a name="l00898"></a>00898 return bitval;

923

<a name="l00899"></a>00899 unsigned bitval_prev = bitval;

924

<a name="l00900"></a>00900

925

<a name="l00901"></a>00901 while (1)

926

<a name="l00902"></a>00902 {

927

<a name="l00903"></a>00903 bitval = f(bitval1, bitval2);

928

<a name="l00904"></a>00904 if (bitval)

929

<a name="l00905"></a>00905 return bitval;

930

<a name="l00906"></a>00906

931

<a name="l00907"></a>00907 if (bitval != bitval_prev)

932

<a name="l00908"></a>00908 bitval_prev = bitval;

933

<a name="l00909"></a>00909

934

<a name="l00910"></a>00910 if (*cur1 < *cur2)

935

<a name="l00911"></a>00911 {

936

<a name="l00912"></a>00912 ++cur1;

937

<a name="l00913"></a>00913 bitval1 ^= 1;

938

<a name="l00914"></a>00914 }

939

<a name="l00915"></a>00915 else // >=

940

<a name="l00916"></a>00916 {

941

<a name="l00917"></a>00917 if (*cur2 < *cur1)

942

<a name="l00918"></a>00918 {

943

<a name="l00919"></a>00919 bitval2 ^= 1;

944

<a name="l00920"></a>00920 }

945

<a name="l00921"></a>00921 else // equal

946

<a name="l00922"></a>00922 {

947

<a name="l00923"></a>00923 if (*cur2 == (<a class="code" href="a00078.html#d0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a> - 1))

948

<a name="l00924"></a>00924 {

949

<a name="l00925"></a>00925 break;

950

<a name="l00926"></a>00926 }

951

<a name="l00927"></a>00927

952

<a name="l00928"></a>00928 ++cur1;

953

<a name="l00929"></a>00929 bitval1 ^= 1;

954

<a name="l00930"></a>00930 bitval2 ^= 1;

955

<a name="l00931"></a>00931 }

956

<a name="l00932"></a>00932 ++cur2;

957

<a name="l00933"></a>00933 }

958

<a name="l00934"></a>00934

959

<a name="l00935"></a>00935 } // while

960

<a name="l00936"></a>00936

961

<a name="l00937"></a>00937 return 0;

962

<a name="l00938"></a>00938 }

963

<a name="l00939"></a>00939

964

<a name="l00940"></a>00940

965

<a name="l00941"></a>00941

966

<a name="l00942"></a>00942 /*!

967

<a name="l00943"></a>00943 \brief Abstract distance(similarity) operation for GAP buffers.

968

<a name="l00944"></a>00944 Receives functor F as a template argument

969

<a name="l00945"></a>00945 \param vect1 - operand 1 GAP encoded buffer.

970

<a name="l00946"></a>00946 \param vect2 - operand 2 GAP encoded buffer.

971

<a name="l00947"></a>00947 \param f - operation functor.

972

<a name="l00948"></a>00948 \note Internal function.

973

<a name="l00949"></a>00949

974

<a name="l00950"></a>00950 @ingroup gapfunc

975

<a name="l00951"></a>00951 */

976

<a name="l00952"></a>00952 /*

977

<a name="l00953"></a>00953 template<typename T, class F>

978

<a name="l00954"></a>00954 unsigned gap_buff_count_op(const T* vect1, const T* vect2, F f)

979

<a name="l00955"></a>00955 {

980

<a name="l00956"></a>00956 register const T* cur1 = vect1;

981

<a name="l00957"></a>00957 register const T* cur2 = vect2;

982

<a name="l00958"></a>00958

983

<a name="l00959"></a>00959 unsigned bitval1 = (*cur1++ & 1);

984

<a name="l00960"></a>00960 unsigned bitval2 = (*cur2++ & 1);

985

<a name="l00961"></a>00961 unsigned bitval = f(bitval1, bitval2);

986

<a name="l00962"></a>00962 unsigned bitval_prev = bitval;

987

<a name="l00963"></a>00963

988

<a name="l00964"></a>00964 unsigned count = 0;

989

<a name="l00965"></a>00965 T res;

990

<a name="l00966"></a>00966 T res_prev;

991

<a name="l00967"></a>00967

992

<a name="l00968"></a>00968 while (1)

993

<a name="l00969"></a>00969 {

994

<a name="l00970"></a>00970 bitval = f(bitval1, bitval2);

995

<a name="l00971"></a>00971

996

<a name="l00972"></a>00972 // Check if GAP value changes and we need to

997

<a name="l00973"></a>00973 // start the next one.

998

<a name="l00974"></a>00974 if (bitval != bitval_prev)

999

<a name="l00975"></a>00975 {

1000

<a name="l00976"></a>00976 bitval_prev = bitval;

1001

<a name="l00977"></a>00977 }

1002

<a name="l00978"></a>00978

1003

<a name="l00979"></a>00979 if (*cur1 < *cur2)

1004

<a name="l00980"></a>00980 {

1005

<a name="l00981"></a>00981 if (bitval)

1006

<a name="l00982"></a>00982 count += *cur1;

1007

<a name="l00983"></a>00983 ++cur1;

1008

<a name="l00984"></a>00984 bitval1 ^= 1;

1009

<a name="l00985"></a>00985 }

1010

<a name="l00986"></a>00986 else // >=

1011

<a name="l00987"></a>00987 {

1012

<a name="l00988"></a>00988 if (bitval)

1013

<a name="l00989"></a>00989 count += *cur2;

1014

<a name="l00990"></a>00990 if (*cur2 < *cur1)

1015

<a name="l00991"></a>00991 {

1016

<a name="l00992"></a>00992 bitval2 ^= 1;

1017

<a name="l00993"></a>00993 }

1018

<a name="l00994"></a>00994 else // equal

1019

<a name="l00995"></a>00995 {

1020

<a name="l00996"></a>00996 if (*cur2 == (bm::gap_max_bits - 1))

1021

<a name="l00997"></a>00997 {

1022

<a name="l00998"></a>00998 break;

1023

<a name="l00999"></a>00999 }

1024

<a name="l01000"></a>01000

1025

<a name="l01001"></a>01001 ++cur1;

1026

<a name="l01002"></a>01002 bitval1 ^= 1;

1027

<a name="l01003"></a>01003 bitval2 ^= 1;

1028

<a name="l01004"></a>01004 }

1029

<a name="l01005"></a>01005 ++cur2;

1030

<a name="l01006"></a>01006 }

1031

<a name="l01007"></a>01007

1032

<a name="l01008"></a>01008 } // while

1033

<a name="l01009"></a>01009

1034

<a name="l01010"></a>01010 return count;

1035

<a name="l01011"></a>01011 }

1036

<a name="l01012"></a>01012 */

1037

<a name="l01013"></a>01013

1038

<a name="l01014"></a>01014

1039

<a name="l01015"></a>01015 /*!

1040

<a name="l01016"></a>01016 \brief Sets or clears bit in the GAP buffer.

1041

<a name="l01017"></a>01017

1042

<a name="l01018"></a>01018 \param val - new bit value

1043

<a name="l01019"></a>01019 \param buf - GAP buffer.

1044

<a name="l01020"></a>01020 \param pos - Index of bit to set.

1045

<a name="l01021"></a>01021 \param is_set - (OUT) flag if bit was actually set.

1046

<a name="l01022"></a>01022

1047

<a name="l01023"></a>01023 \return New GAP buffer length.

1048

<a name="l01024"></a>01024

1049

<a name="l01025"></a>01025 @ingroup gapfunc

1050

<a name="l01026"></a>01026 */

1051

<a name="l01027"></a><a class="code" href="a00082.html#g69186bd13bda27e04b3e33683ff884c2">01027</a> template<typename T> unsigned <a class="code" href="a00082.html#g69186bd13bda27e04b3e33683ff884c2" title="Abstract distance(similarity) operation for GAP buffers. Receives functor F as a...">gap_set_value</a>(unsigned val,

1052

<a name="l01028"></a>01028 T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> buf,

1053

<a name="l01029"></a>01029 unsigned pos,

1054

<a name="l01030"></a>01030 unsigned* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> is_set)

1055

<a name="l01031"></a>01031 {

1056

<a name="l01032"></a>01032 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(pos < <a class="code" href="a00078.html#d0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>);

1057

<a name="l01033"></a>01033 unsigned curr = <a class="code" href="a00078.html#cebed8b533c2c9e17167617501477693">gap_bfind</a>(buf, pos, is_set);

1058

<a name="l01034"></a>01034

1059

<a name="l01035"></a>01035 register T end = (*buf >> 3);

1060

<a name="l01036"></a>01036 if (*is_set == val)

1061

<a name="l01037"></a>01037 {

1062

<a name="l01038"></a>01038 *is_set = 0;

1063

<a name="l01039"></a>01039 return end;

1064

<a name="l01040"></a>01040 }

1065

<a name="l01041"></a>01041 *is_set = 1;

1066

<a name="l01042"></a>01042

1067

<a name="l01043"></a>01043 register T* pcurr = buf + curr;

1068

<a name="l01044"></a>01044 register T* pprev = pcurr - 1;

1069

<a name="l01045"></a>01045 register T* pend = buf + end;

1070

<a name="l01046"></a>01046

1071

<a name="l01047"></a>01047 // Special case, first bit GAP operation. There is no platform beside it.

1072

<a name="l01048"></a>01048 // initial flag must be inverted.

1073

<a name="l01049"></a>01049 if (pos == 0)

1074

<a name="l01050"></a>01050 {

1075

<a name="l01051"></a>01051 *buf ^= 1;

1076

<a name="l01052"></a>01052 if ( buf[1] ) // We need to insert a 1 bit platform here.

1077

<a name="l01053"></a>01053 {

1078

<a name="l01054"></a>01054 ::memmove(&buf[2], &buf[1], (end - 1) * sizeof(<a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>));

1079

<a name="l01055"></a>01055 buf[1] = 0;

1080

<a name="l01056"></a>01056 ++end;

1081

<a name="l01057"></a>01057 }

1082

<a name="l01058"></a>01058 else // Only 1 bit in the GAP. We need to delete the first GAP.

1083

<a name="l01059"></a>01059 {

1084

<a name="l01060"></a>01060 pprev = buf + 1;

1085

<a name="l01061"></a>01061 pcurr = pprev + 1;

1086

<a name="l01062"></a>01062 do

1087

<a name="l01063"></a>01063 {

1088

<a name="l01064"></a>01064 *pprev++ = *pcurr++;

1089

<a name="l01065"></a>01065 } while (pcurr < pend);

1090

<a name="l01066"></a>01066 --end;

1091

<a name="l01067"></a>01067 }

1092

<a name="l01068"></a>01068 }

1093

<a name="l01069"></a>01069 else if (curr > 1 && ((unsigned)(*pprev))+1 == pos) // Left border bit

1094

<a name="l01070"></a>01070 {

1095

<a name="l01071"></a>01071 ++(*pprev);

1096

<a name="l01072"></a>01072 if (*pprev == *pcurr) // Curr. GAP to be merged with prev.GAP.

1097

<a name="l01073"></a>01073 {

1098

<a name="l01074"></a>01074 --end;

1099

<a name="l01075"></a>01075 if (pcurr != pend) // GAP merge: 2 GAPS to be deleted

1100

<a name="l01076"></a>01076 {

1101

<a name="l01077"></a>01077 --end;

1102

<a name="l01078"></a>01078 ++pcurr;

1103

<a name="l01079"></a>01079 do

1104

<a name="l01080"></a>01080 {

1105

<a name="l01081"></a>01081 *pprev++ = *pcurr++;

1106

<a name="l01082"></a>01082 } while (pcurr < pend);

1107

<a name="l01083"></a>01083 }

1108

<a name="l01084"></a>01084 }

1109

<a name="l01085"></a>01085 }

1110

<a name="l01086"></a>01086 else if (*pcurr == pos) // Rightmost bit in the GAP. Border goes left.

1111

<a name="l01087"></a>01087 {

1112

<a name="l01088"></a>01088 --(*pcurr);

1113

<a name="l01089"></a>01089 if (pcurr == pend)

1114

<a name="l01090"></a>01090 {

1115

<a name="l01091"></a>01091 ++end;

1116

<a name="l01092"></a>01092 }

1117

<a name="l01093"></a>01093 }

1118

<a name="l01094"></a>01094 else // Worst case we need to split current block.

1119

<a name="l01095"></a>01095 {

1120

<a name="l01096"></a>01096 ::memmove(pcurr+2, pcurr,(end - curr + 1)*sizeof(T));

1121

<a name="l01097"></a>01097 *pcurr++ = pos - 1;

1122

<a name="l01098"></a>01098 *pcurr = pos;

1123

<a name="l01099"></a>01099 end+=2;

1124

<a name="l01100"></a>01100 }

1125

<a name="l01101"></a>01101

1126

<a name="l01102"></a>01102 // Set correct length word.

1127

<a name="l01103"></a>01103 *buf = (*buf & 7) + (end << 3);

1128

<a name="l01104"></a>01104

1129

<a name="l01105"></a>01105 buf[end] = <a class="code" href="a00078.html#d0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a> - 1;

1130

<a name="l01106"></a>01106 return end;

1131

<a name="l01107"></a>01107 }

1132

<a name="l01108"></a>01108

1133

<a name="l01109"></a>01109 //------------------------------------------------------------------------

1134

<a name="l01110"></a>01110

1135

<a name="l01111"></a>01111 /**

1136

<a name="l01112"></a>01112 \brief Searches for the next 1 bit in the GAP block

1137

<a name="l01113"></a>01113 \param buf - GAP buffer

1138

<a name="l01114"></a>01114 \param nbit - bit index to start checking from.

1139

<a name="l01115"></a>01115 \param prev - returns previously checked value

1140

<a name="l01116"></a>01116

1141

<a name="l01117"></a>01117 @ingroup gapfunc

1142

<a name="l01118"></a>01118 */

1143

<a name="l01119"></a><a class="code" href="a00082.html#ga7df7193094353ea24b8519debf745be">01119</a> template<typename T> int <a class="code" href="a00082.html#ga7df7193094353ea24b8519debf745be" title="Searches for the next 1 bit in the GAP block.">gap_find_in_block</a>(const T* buf,

1144

<a name="l01120"></a>01120 unsigned nbit,

1145

<a name="l01121"></a>01121 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a>* prev)

1146

<a name="l01122"></a>01122 {

1147

<a name="l01123"></a>01123 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(nbit < <a class="code" href="a00078.html#d0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>);

1148

<a name="l01124"></a>01124

1149

<a name="l01125"></a>01125 unsigned bitval;

1150

<a name="l01126"></a>01126 unsigned gap_idx = <a class="code" href="a00078.html#cebed8b533c2c9e17167617501477693">bm::gap_bfind</a>(buf, nbit, &bitval);

1151

<a name="l01127"></a>01127

1152

<a name="l01128"></a>01128 if (bitval) // positive block.

1153

<a name="l01129"></a>01129 {

1154

<a name="l01130"></a>01130 return 1;

1155

<a name="l01131"></a>01131 }

1156

<a name="l01132"></a>01132

1157

<a name="l01133"></a>01133 register unsigned val = buf[gap_idx] + 1;

1158

<a name="l01134"></a>01134 *prev += val - nbit;

1159

<a name="l01135"></a>01135

1160

<a name="l01136"></a>01136 return (val != <a class="code" href="a00078.html#d0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>); // no bug here.

1161

<a name="l01137"></a>01137 }

1162

<a name="l01138"></a>01138

1163

<a name="l01139"></a>01139 /*!

1164

<a name="l01140"></a>01140 \brief Set 1 bit in a block

1165

<a name="l01141"></a>01141 */

1166

<a name="l01142"></a><a class="code" href="a00078.html#2becf9a16ec20ab124ca8938e34b4aa8">01142</a> <a class="code" href="a00063.html#938734d014fb68dd8b2251fe8ec2b025">BMFORCEINLINE</a> void <a class="code" href="a00078.html#2becf9a16ec20ab124ca8938e34b4aa8" title="Set 1 bit in a block.">set_bit</a>(unsigned* dest, unsigned bitpos)

1167

<a name="l01143"></a>01143 {

1168

<a name="l01144"></a>01144 unsigned nbit = unsigned(bitpos & <a class="code" href="a00078.html#201fb8b1f81b7487f1c1c129fc3d6557">bm::set_block_mask</a>);

1169

<a name="l01145"></a>01145 unsigned nword = unsigned(nbit >> <a class="code" href="a00078.html#83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>);

1170

<a name="l01146"></a>01146 nbit &= <a class="code" href="a00078.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>;

1171

<a name="l01147"></a>01147 dest[nword] |= unsigned(1 << nbit);

1172

<a name="l01148"></a>01148 }

1173

<a name="l01149"></a>01149

1174

<a name="l01150"></a>01150

1175

<a name="l01151"></a>01151 /*!

1176

<a name="l01152"></a>01152 \brief Sets bits to 1 in the bitblock.

1177

<a name="l01153"></a>01153 \param dest - Bitset buffer.

1178

<a name="l01154"></a>01154 \param bitpos - Offset of the start bit.

1179

<a name="l01155"></a>01155 \param bitcount - number of bits to set.

1180

<a name="l01156"></a>01156

1181

<a name="l01157"></a>01157 @ingroup bitfunc

1182

<a name="l01158"></a>01158 */

1183

<a name="l01159"></a><a class="code" href="a00083.html#gd698b5242f5b629aa28e7338b7150497">01159</a> inline void <a class="code" href="a00083.html#gd698b5242f5b629aa28e7338b7150497" title="Sets bits to 1 in the bitblock.">or_bit_block</a>(unsigned* dest,

1184

<a name="l01160"></a>01160 unsigned bitpos,

1185

<a name="l01161"></a>01161 unsigned bitcount)

1186

<a name="l01162"></a>01162 {

1187

<a name="l01163"></a>01163 unsigned nbit = unsigned(bitpos & <a class="code" href="a00078.html#201fb8b1f81b7487f1c1c129fc3d6557">bm::set_block_mask</a>);

1188

<a name="l01164"></a>01164 unsigned nword = unsigned(nbit >> <a class="code" href="a00078.html#83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>);

1189

<a name="l01165"></a>01165 nbit &= <a class="code" href="a00078.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>;

1190

<a name="l01166"></a>01166

1191

<a name="l01167"></a>01167 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* word = dest + nword;

1192

<a name="l01168"></a>01168

1193

<a name="l01169"></a>01169 if (bitcount == 1) // special case (only 1 bit to set)

1194

<a name="l01170"></a>01170 {

1195

<a name="l01171"></a>01171 *word |= unsigned(1 << nbit);

1196

<a name="l01172"></a>01172 return;

1197

<a name="l01173"></a>01173 }

1198

<a name="l01174"></a>01174

1199

<a name="l01175"></a>01175 if (nbit) // starting position is not aligned

1200

<a name="l01176"></a>01176 {

1201

<a name="l01177"></a>01177 unsigned right_margin = nbit + bitcount;

1202

<a name="l01178"></a>01178

1203

<a name="l01179"></a>01179 // here we checking if we setting bits only in the current

1204

<a name="l01180"></a>01180 // word. Example: 00111000000000000000000000000000 (32 bits word)

1205

<a name="l01181"></a>01181

1206

<a name="l01182"></a>01182 if (right_margin < 32)

1207

<a name="l01183"></a>01183 {

1208

<a name="l01184"></a>01184 unsigned mask =

1209

<a name="l01185"></a>01185 <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_right</a>[nbit] &

1210

<a name="l01186"></a>01186 <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_left</a>[right_margin-1];

1211

<a name="l01187"></a>01187 *word |= mask;

1212

<a name="l01188"></a>01188 return; // we are done

1213

<a name="l01189"></a>01189 }

1214

<a name="l01190"></a>01190 else

1215

<a name="l01191"></a>01191 {

1216

<a name="l01192"></a>01192 *word |= <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_right</a>[nbit];

1217

<a name="l01193"></a>01193 bitcount -= 32 - nbit;

1218

<a name="l01194"></a>01194 }

1219

<a name="l01195"></a>01195 ++word;

1220

<a name="l01196"></a>01196 }

1221

<a name="l01197"></a>01197

1222

<a name="l01198"></a>01198 // now we are word aligned, lets find out how many words we

1223

<a name="l01199"></a>01199 // can now turn ON using loop

1224

<a name="l01200"></a>01200

1225

<a name="l01201"></a>01201 for ( ;bitcount >= 32; bitcount -= 32)

1226

<a name="l01202"></a>01202 {

1227

<a name="l01203"></a>01203 *word++ = 0xffffffff;

1228

<a name="l01204"></a>01204 }

1229

<a name="l01205"></a>01205

1230

<a name="l01206"></a>01206 if (bitcount)

1231

<a name="l01207"></a>01207 {

1232

<a name="l01208"></a>01208 *word |= <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_left</a>[bitcount-1];

1233

<a name="l01209"></a>01209 }

1234

<a name="l01210"></a>01210 }

1235

<a name="l01211"></a>01211

1236

<a name="l01212"></a>01212

1237

<a name="l01213"></a>01213 /*!

1238

<a name="l01214"></a>01214 \brief SUB (AND NOT) bit interval to 1 in the bitblock.

1239

<a name="l01215"></a>01215 \param dest - Bitset buffer.

1240

<a name="l01216"></a>01216 \param bitpos - Offset of the start bit.

1241

<a name="l01217"></a>01217 \param bitcount - number of bits to set.

1242

<a name="l01218"></a>01218

1243

<a name="l01219"></a>01219 @ingroup bitfunc

1244

<a name="l01220"></a>01220 */

1245

<a name="l01221"></a><a class="code" href="a00083.html#gceaa54aa59b16299f5a87b925715e5e8">01221</a> inline void <a class="code" href="a00083.html#gceaa54aa59b16299f5a87b925715e5e8" title="SUB (AND NOT) bit interval to 1 in the bitblock.">sub_bit_block</a>(unsigned* dest,

1246

<a name="l01222"></a>01222 unsigned bitpos,

1247

<a name="l01223"></a>01223 unsigned bitcount)

1248

<a name="l01224"></a>01224 {

1249

<a name="l01225"></a>01225 unsigned nbit = unsigned(bitpos & <a class="code" href="a00078.html#201fb8b1f81b7487f1c1c129fc3d6557">bm::set_block_mask</a>);

1250

<a name="l01226"></a>01226 unsigned nword = unsigned(nbit >> <a class="code" href="a00078.html#83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>);

1251

<a name="l01227"></a>01227 nbit &= <a class="code" href="a00078.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>;

1252

<a name="l01228"></a>01228

1253

<a name="l01229"></a>01229 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* word = dest + nword;

1254

<a name="l01230"></a>01230

1255

<a name="l01231"></a>01231 if (bitcount == 1) // special case (only 1 bit to set)

1256

<a name="l01232"></a>01232 {

1257

<a name="l01233"></a>01233 *word &= ~unsigned(1 << nbit);

1258

<a name="l01234"></a>01234 return;

1259

<a name="l01235"></a>01235 }

1260

<a name="l01236"></a>01236

1261

<a name="l01237"></a>01237 if (nbit) // starting position is not aligned

1262

<a name="l01238"></a>01238 {

1263

<a name="l01239"></a>01239 unsigned right_margin = nbit + bitcount;

1264

<a name="l01240"></a>01240

1265

<a name="l01241"></a>01241 // here we checking if we setting bits only in the current

1266

<a name="l01242"></a>01242 // word. Example: 00111000000000000000000000000000 (32 bits word)

1267

<a name="l01243"></a>01243

1268

<a name="l01244"></a>01244 if (right_margin < 32)

1269

<a name="l01245"></a>01245 {

1270

<a name="l01246"></a>01246 unsigned mask =

1271

<a name="l01247"></a>01247 <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_right</a>[nbit] &

1272

<a name="l01248"></a>01248 <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_left</a>[right_margin-1];

1273

<a name="l01249"></a>01249 *word &= ~mask;

1274

<a name="l01250"></a>01250 return; // we are done

1275

<a name="l01251"></a>01251 }

1276

<a name="l01252"></a>01252 else

1277

<a name="l01253"></a>01253 {

1278

<a name="l01254"></a>01254 *word &= ~<a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_right</a>[nbit];

1279

<a name="l01255"></a>01255 bitcount -= 32 - nbit;

1280

<a name="l01256"></a>01256 }

1281

<a name="l01257"></a>01257 ++word;

1282

<a name="l01258"></a>01258 }

1283

<a name="l01259"></a>01259

1284

<a name="l01260"></a>01260 // now we are word aligned, lets find out how many words we

1285

<a name="l01261"></a>01261 // can now turn ON using loop

1286

<a name="l01262"></a>01262

1287

<a name="l01263"></a>01263 for ( ;bitcount >= 32; bitcount -= 32)

1288

<a name="l01264"></a>01264 {

1289

<a name="l01265"></a>01265 *word++ = 0;

1290

<a name="l01266"></a>01266 }

1291

<a name="l01267"></a>01267

1292

<a name="l01268"></a>01268 if (bitcount)

1293

<a name="l01269"></a>01269 {

1294

<a name="l01270"></a>01270 *word &= ~<a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_left</a>[bitcount-1];

1295

<a name="l01271"></a>01271 }

1296

<a name="l01272"></a>01272 }

1297

<a name="l01273"></a>01273

1298

<a name="l01274"></a>01274

1299

<a name="l01275"></a>01275 /*!

1300

<a name="l01276"></a>01276 \brief XOR bit interval to 1 in the bitblock.

1301

<a name="l01277"></a>01277 \param dest - Bitset buffer.

1302

<a name="l01278"></a>01278 \param bitpos - Offset of the start bit.

1303

<a name="l01279"></a>01279 \param bitcount - number of bits to set.

1304

<a name="l01280"></a>01280

1305

<a name="l01281"></a>01281 @ingroup bitfunc

1306

<a name="l01282"></a>01282 */

1307

<a name="l01283"></a><a class="code" href="a00083.html#g6191abb017003b633fab24e0c6357521">01283</a> inline void <a class="code" href="a00083.html#g6191abb017003b633fab24e0c6357521" title="XOR bit interval to 1 in the bitblock.">xor_bit_block</a>(unsigned* dest,

1308

<a name="l01284"></a>01284 unsigned bitpos,

1309

<a name="l01285"></a>01285 unsigned bitcount)

1310

<a name="l01286"></a>01286 {

1311

<a name="l01287"></a>01287 unsigned nbit = unsigned(bitpos & <a class="code" href="a00078.html#201fb8b1f81b7487f1c1c129fc3d6557">bm::set_block_mask</a>);

1312

<a name="l01288"></a>01288 unsigned nword = unsigned(nbit >> <a class="code" href="a00078.html#83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>);

1313

<a name="l01289"></a>01289 nbit &= <a class="code" href="a00078.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>;

1314

<a name="l01290"></a>01290

1315

<a name="l01291"></a>01291 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* word = dest + nword;

1316

<a name="l01292"></a>01292

1317

<a name="l01293"></a>01293 if (bitcount == 1) // special case (only 1 bit to set)

1318

<a name="l01294"></a>01294 {

1319

<a name="l01295"></a>01295 *word ^= unsigned(1 << nbit);

1320

<a name="l01296"></a>01296 return;

1321

<a name="l01297"></a>01297 }

1322

<a name="l01298"></a>01298

1323

<a name="l01299"></a>01299 if (nbit) // starting position is not aligned

1324

<a name="l01300"></a>01300 {

1325

<a name="l01301"></a>01301 unsigned right_margin = nbit + bitcount;

1326

<a name="l01302"></a>01302

1327

<a name="l01303"></a>01303 // here we checking if we setting bits only in the current

1328

<a name="l01304"></a>01304 // word. Example: 00111000000000000000000000000000 (32 bits word)

1329

<a name="l01305"></a>01305

1330

<a name="l01306"></a>01306 if (right_margin < 32)

1331

<a name="l01307"></a>01307 {

1332

<a name="l01308"></a>01308 unsigned mask =

1333

<a name="l01309"></a>01309 <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_right</a>[nbit] &

1334

<a name="l01310"></a>01310 <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_left</a>[right_margin-1];

1335

<a name="l01311"></a>01311 *word ^= mask;

1336

<a name="l01312"></a>01312 return; // we are done

1337

<a name="l01313"></a>01313 }

1338

<a name="l01314"></a>01314 else

1339

<a name="l01315"></a>01315 {

1340

<a name="l01316"></a>01316 *word ^= <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_right</a>[nbit];

1341

<a name="l01317"></a>01317 bitcount -= 32 - nbit;

1342

<a name="l01318"></a>01318 }

1343

<a name="l01319"></a>01319 ++word;

1344

<a name="l01320"></a>01320 }

1345

<a name="l01321"></a>01321

1346

<a name="l01322"></a>01322 // now we are word aligned, lets find out how many words we

1347

<a name="l01323"></a>01323 // can now turn ON using loop

1348

<a name="l01324"></a>01324

1349

<a name="l01325"></a>01325 for ( ;bitcount >= 32; bitcount -= 32)

1350

<a name="l01326"></a>01326 {

1351

<a name="l01327"></a>01327 *word++ ^= 0xffffffff;

1352

<a name="l01328"></a>01328 }

1353

<a name="l01329"></a>01329

1354

<a name="l01330"></a>01330 if (bitcount)

1355

<a name="l01331"></a>01331 {

1356

<a name="l01332"></a>01332 *word ^= <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_left</a>[bitcount-1];

1357

<a name="l01333"></a>01333 }

1358

<a name="l01334"></a>01334 }

1359

<a name="l01335"></a>01335

1360

<a name="l01336"></a>01336

1361

<a name="l01337"></a>01337 /*!

1362

<a name="l01338"></a>01338 \brief SUB (AND NOT) GAP block to bitblock.

1363

<a name="l01339"></a>01339 \param dest - bitblock buffer pointer.

1364

<a name="l01340"></a>01340 \param buf - GAP buffer pointer.

1365

<a name="l01341"></a>01341

1366

<a name="l01342"></a>01342 @ingroup gapfunc

1367

<a name="l01343"></a>01343 */

1368

<a name="l01344"></a>01344 template<typename T>

1369

<a name="l01345"></a><a class="code" href="a00082.html#g08e0ae8b2fd5869aa31cfad7d47177c4">01345</a> void <a class="code" href="a00082.html#g08e0ae8b2fd5869aa31cfad7d47177c4" title="SUB (AND NOT) GAP block to bitblock.">gap_sub_to_bitset</a>(unsigned* dest, const T* buf)

1370

<a name="l01346"></a>01346 {

1371

<a name="l01347"></a>01347 register const T* pcurr = buf;

1372

<a name="l01348"></a>01348 register const T* pend = pcurr + (*pcurr >> 3);

1373

<a name="l01349"></a>01349 ++pcurr;

1374

<a name="l01350"></a>01350

1375

<a name="l01351"></a>01351 if (*buf & 1) // Starts with 1

1376

<a name="l01352"></a>01352 {

1377

<a name="l01353"></a>01353 <a class="code" href="a00083.html#gceaa54aa59b16299f5a87b925715e5e8" title="SUB (AND NOT) bit interval to 1 in the bitblock.">sub_bit_block</a>(dest, 0, *pcurr + 1);

1378

<a name="l01354"></a>01354 ++pcurr;

1379

<a name="l01355"></a>01355 }

1380

<a name="l01356"></a>01356 ++pcurr; // now we are in GAP "1" again

1381

<a name="l01357"></a>01357

1382

<a name="l01358"></a>01358 while (pcurr <= pend)

1383

<a name="l01359"></a>01359 {

1384

<a name="l01360"></a>01360 unsigned bitpos = *(pcurr-1) + 1;

1385

<a name="l01361"></a>01361 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(*pcurr > *(pcurr-1));

1386

<a name="l01362"></a>01362 unsigned gap_len = *pcurr - *(pcurr-1);

1387

<a name="l01363"></a>01363 <a class="code" href="a00083.html#gceaa54aa59b16299f5a87b925715e5e8" title="SUB (AND NOT) bit interval to 1 in the bitblock.">sub_bit_block</a>(dest, bitpos, gap_len);

1388

<a name="l01364"></a>01364 pcurr += 2;

1389

<a name="l01365"></a>01365 }

1390

<a name="l01366"></a>01366 }

1391

<a name="l01367"></a>01367

1392

<a name="l01368"></a>01368

1393

<a name="l01369"></a>01369 /*!

1394

<a name="l01370"></a>01370 \brief XOR GAP block to bitblock.

1395

<a name="l01371"></a>01371 \param dest - bitblock buffer pointer.

1396

<a name="l01372"></a>01372 \param buf - GAP buffer pointer.

1397

<a name="l01373"></a>01373

1398

<a name="l01374"></a>01374 @ingroup gapfunc

1399

<a name="l01375"></a>01375 */

1400

<a name="l01376"></a>01376 template<typename T>

1401

<a name="l01377"></a><a class="code" href="a00082.html#gb939656d4ea54fd3868aa236cdb20b82">01377</a> void <a class="code" href="a00082.html#gb939656d4ea54fd3868aa236cdb20b82" title="XOR GAP block to bitblock.">gap_xor_to_bitset</a>(unsigned* dest, const T* buf)

1402

<a name="l01378"></a>01378 {

1403

<a name="l01379"></a>01379 register const T* pcurr = buf;

1404

<a name="l01380"></a>01380 register const T* pend = pcurr + (*pcurr >> 3);

1405

<a name="l01381"></a>01381 ++pcurr;

1406

<a name="l01382"></a>01382

1407

<a name="l01383"></a>01383 if (*buf & 1) // Starts with 1

1408

<a name="l01384"></a>01384 {

1409

<a name="l01385"></a>01385 <a class="code" href="a00083.html#g6191abb017003b633fab24e0c6357521" title="XOR bit interval to 1 in the bitblock.">xor_bit_block</a>(dest, 0, *pcurr + 1);

1410

<a name="l01386"></a>01386 ++pcurr;

1411

<a name="l01387"></a>01387 }

1412

<a name="l01388"></a>01388 ++pcurr; // now we are in GAP "1" again

1413

<a name="l01389"></a>01389

1414

<a name="l01390"></a>01390 while (pcurr <= pend)

1415

<a name="l01391"></a>01391 {

1416

<a name="l01392"></a>01392 unsigned bitpos = *(pcurr-1) + 1;

1417

<a name="l01393"></a>01393 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(*pcurr > *(pcurr-1));

1418

<a name="l01394"></a>01394 unsigned gap_len = *pcurr - *(pcurr-1);

1419

<a name="l01395"></a>01395 <a class="code" href="a00083.html#g6191abb017003b633fab24e0c6357521" title="XOR bit interval to 1 in the bitblock.">xor_bit_block</a>(dest, bitpos, gap_len);

1420

<a name="l01396"></a>01396 pcurr += 2;

1421

<a name="l01397"></a>01397 }

1422

<a name="l01398"></a>01398 }

1423

<a name="l01399"></a>01399

1424

<a name="l01400"></a>01400

1425

<a name="l01401"></a>01401 /*!

1426

<a name="l01402"></a>01402 \brief Adds(OR) GAP block to bitblock.

1427

<a name="l01403"></a>01403 \param dest - bitblock buffer pointer.

1428

<a name="l01404"></a>01404 \param buf - GAP buffer pointer.

1429

<a name="l01405"></a>01405

1430

<a name="l01406"></a>01406 @ingroup gapfunc

1431

<a name="l01407"></a>01407 */

1432

<a name="l01408"></a>01408 template<typename T>

1433

<a name="l01409"></a><a class="code" href="a00082.html#g12615cd62f2e5367e1bc688d00a2188f">01409</a> void <a class="code" href="a00082.html#g12615cd62f2e5367e1bc688d00a2188f" title="Adds(OR) GAP block to bitblock.">gap_add_to_bitset</a>(unsigned* dest, const T* buf)

1434

<a name="l01410"></a>01410 {

1435

<a name="l01411"></a>01411 register const T* pcurr = buf;

1436

<a name="l01412"></a>01412 register const T* pend = pcurr + (*pcurr >> 3);

1437

<a name="l01413"></a>01413 ++pcurr;

1438

<a name="l01414"></a>01414

1439

<a name="l01415"></a>01415 if (*buf & 1) // Starts with 1

1440

<a name="l01416"></a>01416 {

1441

<a name="l01417"></a>01417 <a class="code" href="a00083.html#gd698b5242f5b629aa28e7338b7150497" title="Sets bits to 1 in the bitblock.">or_bit_block</a>(dest, 0, *pcurr + 1);

1442

<a name="l01418"></a>01418 ++pcurr;

1443

<a name="l01419"></a>01419 }

1444

<a name="l01420"></a>01420 ++pcurr; // now we are in GAP "1" again

1445

<a name="l01421"></a>01421

1446

<a name="l01422"></a>01422 while (pcurr <= pend)

1447

<a name="l01423"></a>01423 {

1448

<a name="l01424"></a>01424 unsigned bitpos = *(pcurr-1) + 1;

1449

<a name="l01425"></a>01425 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(*pcurr > *(pcurr-1));

1450

<a name="l01426"></a>01426 unsigned gap_len = *pcurr - *(pcurr-1);

1451

<a name="l01427"></a>01427 <a class="code" href="a00083.html#gd698b5242f5b629aa28e7338b7150497" title="Sets bits to 1 in the bitblock.">or_bit_block</a>(dest, bitpos, gap_len);

1452

<a name="l01428"></a>01428 pcurr += 2;

1453

<a name="l01429"></a>01429 }

1454

<a name="l01430"></a>01430 }

1455

<a name="l01431"></a>01431

1456

<a name="l01432"></a>01432

1457

<a name="l01433"></a>01433 /*!

1458

<a name="l01434"></a>01434 \brief ANDs GAP block to bitblock.

1459

<a name="l01435"></a>01435 \param dest - bitblock buffer pointer.

1460

<a name="l01436"></a>01436 \param buf - GAP buffer pointer.

1461

<a name="l01437"></a>01437

1462

<a name="l01438"></a>01438 @ingroup gapfunc

1463

<a name="l01439"></a>01439 */

1464

<a name="l01440"></a>01440 template<typename T>

1465

<a name="l01441"></a><a class="code" href="a00082.html#gfe6f72a009618290eeab3cddee869543">01441</a> void <a class="code" href="a00082.html#gfe6f72a009618290eeab3cddee869543" title="ANDs GAP block to bitblock.">gap_and_to_bitset</a>(unsigned* dest, const T* buf)

1466

<a name="l01442"></a>01442 {

1467

<a name="l01443"></a>01443 register const T* pcurr = buf;

1468

<a name="l01444"></a>01444 register const T* pend = pcurr + (*pcurr >> 3);

1469

<a name="l01445"></a>01445 ++pcurr;

1470

<a name="l01446"></a>01446

1471

<a name="l01447"></a>01447 if (! (*buf & 1) ) // Starts with 0

1472

<a name="l01448"></a>01448 {

1473

<a name="l01449"></a>01449 // Instead of AND we can SUB 0 gaps here

1474

<a name="l01450"></a>01450 <a class="code" href="a00083.html#gceaa54aa59b16299f5a87b925715e5e8" title="SUB (AND NOT) bit interval to 1 in the bitblock.">sub_bit_block</a>(dest, 0, *pcurr + 1);

1475

<a name="l01451"></a>01451 ++pcurr;

1476

<a name="l01452"></a>01452 }

1477

<a name="l01453"></a>01453 ++pcurr; // now we are in GAP "0" again

1478

<a name="l01454"></a>01454

1479

<a name="l01455"></a>01455 while (pcurr <= pend)

1480

<a name="l01456"></a>01456 {

1481

<a name="l01457"></a>01457 unsigned bitpos = *(pcurr-1) + 1;

1482

<a name="l01458"></a>01458 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(*pcurr > *(pcurr-1));

1483

<a name="l01459"></a>01459 unsigned gap_len = *pcurr - *(pcurr-1);

1484

<a name="l01460"></a>01460 <a class="code" href="a00083.html#gceaa54aa59b16299f5a87b925715e5e8" title="SUB (AND NOT) bit interval to 1 in the bitblock.">sub_bit_block</a>(dest, bitpos, gap_len);

1485

<a name="l01461"></a>01461 pcurr += 2;

1486

<a name="l01462"></a>01462 }

1487

<a name="l01463"></a>01463 }

1488

<a name="l01464"></a>01464

1489

<a name="l01465"></a>01465

1490

<a name="l01466"></a>01466 /*!

1491

<a name="l01467"></a>01467 \brief Compute bitcount of bit block AND masked by GAP block.

1492

<a name="l01468"></a>01468 \param dest - bitblock buffer pointer.

1493

<a name="l01469"></a>01469 \param buf - GAP buffer pointer.

1494

<a name="l01470"></a>01470

1495

<a name="l01471"></a>01471 @ingroup gapfunc bitfunc

1496

<a name="l01472"></a>01472 */

1497

<a name="l01473"></a>01473 template<typename T>

1498

<a name="l01474"></a><a class="code" href="a00083.html#gb87384cbf46a04d86c008ab2463d02cc">01474</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#gb87384cbf46a04d86c008ab2463d02cc" title="Compute bitcount of bit block AND masked by GAP block.">gap_bitset_and_count</a>(const unsigned* block, const T* buf)

1499

<a name="l01475"></a>01475 {

1500

<a name="l01476"></a>01476 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(block);

1501

<a name="l01477"></a>01477

1502

<a name="l01478"></a>01478 register const T* pcurr = buf;

1503

<a name="l01479"></a>01479 register const T* pend = pcurr + (*pcurr >> 3);

1504

<a name="l01480"></a>01480 ++pcurr;

1505

<a name="l01481"></a>01481

1506

<a name="l01482"></a>01482 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> count = 0;

1507

<a name="l01483"></a>01483

1508

<a name="l01484"></a>01484 if (*buf & 1) // Starts with 1

1509

<a name="l01485"></a>01485 {

1510

<a name="l01486"></a>01486 count += <a class="code" href="a00083.html#g2485f707b2629c5ce7681cf9fe385b91">bit_block_calc_count_range</a>(block, 0, *pcurr);

1511

<a name="l01487"></a>01487 ++pcurr;

1512

<a name="l01488"></a>01488 }

1513

<a name="l01489"></a>01489 ++pcurr; // now we are in GAP "1" again

1514

<a name="l01490"></a>01490

1515

<a name="l01491"></a>01491 while (pcurr <= pend)

1516

<a name="l01492"></a>01492 {

1517

<a name="l01493"></a>01493 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> c = <a class="code" href="a00083.html#g2485f707b2629c5ce7681cf9fe385b91">bit_block_calc_count_range</a>(block, *(pcurr-1)+1, *pcurr);

1518

<a name="l01494"></a>01494

1519

<a name="l01495"></a>01495 count += c;

1520

<a name="l01496"></a>01496 pcurr += 2;

1521

<a name="l01497"></a>01497 }

1522

<a name="l01498"></a>01498 return count;

1523

<a name="l01499"></a>01499 }

1524

<a name="l01500"></a>01500

1525

<a name="l01501"></a>01501

1526

<a name="l01502"></a>01502 /*!

1527

<a name="l01503"></a>01503 \brief Bitcount test of bit block AND masked by GAP block.

1528

<a name="l01504"></a>01504 \param dest - bitblock buffer pointer.

1529

<a name="l01505"></a>01505 \param buf - GAP buffer pointer.

1530

<a name="l01506"></a>01506

1531

<a name="l01507"></a>01507 @ingroup gapfunc bitfunc

1532

<a name="l01508"></a>01508 */

1533

<a name="l01509"></a>01509 template<typename T>

1534

<a name="l01510"></a><a class="code" href="a00083.html#gd6e40898b8836ae1923b06a3d028fcaa">01510</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#gd6e40898b8836ae1923b06a3d028fcaa" title="Bitcount test of bit block AND masked by GAP block.">gap_bitset_and_any</a>(const unsigned* block, const T* buf)

1535

<a name="l01511"></a>01511 {

1536

<a name="l01512"></a>01512 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(block);

1537

<a name="l01513"></a>01513

1538

<a name="l01514"></a>01514 register const T* pcurr = buf;

1539

<a name="l01515"></a>01515 register const T* pend = pcurr + (*pcurr >> 3);

1540

<a name="l01516"></a>01516 ++pcurr;

1541

<a name="l01517"></a>01517

1542

<a name="l01518"></a>01518 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> count = 0;

1543

<a name="l01519"></a>01519 if (*buf & 1) // Starts with 1

1544

<a name="l01520"></a>01520 {

1545

<a name="l01521"></a>01521 count += <a class="code" href="a00083.html#g503e0f3e79f819d9b58e4b0e905be116">bit_block_any_range</a>(block, 0, *pcurr);

1546

<a name="l01522"></a>01522 if (count)

1547

<a name="l01523"></a>01523 return count;

1548

<a name="l01524"></a>01524 ++pcurr;

1549

<a name="l01525"></a>01525 }

1550

<a name="l01526"></a>01526 ++pcurr; // now we are in GAP "1" again

1551

<a name="l01527"></a>01527

1552

<a name="l01528"></a>01528 while (pcurr <= pend)

1553

<a name="l01529"></a>01529 {

1554

<a name="l01530"></a>01530 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> c = <a class="code" href="a00083.html#g503e0f3e79f819d9b58e4b0e905be116">bit_block_any_range</a>(block, *(pcurr-1)+1, *pcurr);

1555

<a name="l01531"></a>01531 count += c;

1556

<a name="l01532"></a>01532 if (count)

1557

<a name="l01533"></a>01533 break;

1558

<a name="l01534"></a>01534 pcurr += 2;

1559

<a name="l01535"></a>01535 }

1560

<a name="l01536"></a>01536 return count;

1561

<a name="l01537"></a>01537 }

1562

<a name="l01538"></a>01538

1563

<a name="l01539"></a>01539

1564

<a name="l01540"></a>01540

1565

<a name="l01541"></a>01541 /*!

1566

<a name="l01542"></a>01542 \brief Compute bitcount of bit block SUB masked by GAP block.

1567

<a name="l01543"></a>01543 \param dest - bitblock buffer pointer.

1568

<a name="l01544"></a>01544 \param buf - GAP buffer pointer.

1569

<a name="l01545"></a>01545

1570

<a name="l01546"></a>01546 @ingroup gapfunc bitfunc

1571

<a name="l01547"></a>01547 */

1572

<a name="l01548"></a>01548 template<typename T>

1573

<a name="l01549"></a><a class="code" href="a00083.html#g15a780da58d5aeb67ffc51c84fa6152e">01549</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g15a780da58d5aeb67ffc51c84fa6152e" title="Compute bitcount of bit block SUB masked by GAP block.">gap_bitset_sub_count</a>(const unsigned* block, const T* buf)

1574

<a name="l01550"></a>01550 {

1575

<a name="l01551"></a>01551 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(block);

1576

<a name="l01552"></a>01552

1577

<a name="l01553"></a>01553 register const T* pcurr = buf;

1578

<a name="l01554"></a>01554 register const T* pend = pcurr + (*pcurr >> 3);

1579

<a name="l01555"></a>01555 ++pcurr;

1580

<a name="l01556"></a>01556

1581

<a name="l01557"></a>01557 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> count = 0;

1582

<a name="l01558"></a>01558

1583

<a name="l01559"></a>01559 if (!(*buf & 1)) // Starts with 0

1584

<a name="l01560"></a>01560 {

1585

<a name="l01561"></a>01561 count += <a class="code" href="a00083.html#g2485f707b2629c5ce7681cf9fe385b91">bit_block_calc_count_range</a>(block, 0, *pcurr);

1586

<a name="l01562"></a>01562 ++pcurr;

1587

<a name="l01563"></a>01563 }

1588

<a name="l01564"></a>01564 ++pcurr; // now we are in GAP "0" again

1589

<a name="l01565"></a>01565

1590

<a name="l01566"></a>01566 for (;pcurr <= pend; pcurr+=2)

1591

<a name="l01567"></a>01567 {

1592

<a name="l01568"></a>01568 count += <a class="code" href="a00083.html#g2485f707b2629c5ce7681cf9fe385b91">bit_block_calc_count_range</a>(block, *(pcurr-1)+1, *pcurr);

1593

<a name="l01569"></a>01569 }

1594

<a name="l01570"></a>01570 return count;

1595

<a name="l01571"></a>01571 }

1596

<a name="l01572"></a>01572

1597

<a name="l01573"></a>01573

1598

<a name="l01574"></a>01574 /*!

1599

<a name="l01575"></a>01575 \brief Compute bitcount test of bit block SUB masked by GAP block.

1600

<a name="l01576"></a>01576 \param dest - bitblock buffer pointer.

1601

<a name="l01577"></a>01577 \param buf - GAP buffer pointer.

1602

<a name="l01578"></a>01578

1603

<a name="l01579"></a>01579 @ingroup gapfunc bitfunc

1604

<a name="l01580"></a>01580 */

1605

<a name="l01581"></a>01581 template<typename T>

1606

<a name="l01582"></a><a class="code" href="a00083.html#gab7c711122e8f189555dffd83a21111c">01582</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#gab7c711122e8f189555dffd83a21111c" title="Compute bitcount test of bit block SUB masked by GAP block.">gap_bitset_sub_any</a>(const unsigned* block, const T* buf)

1607

<a name="l01583"></a>01583 {

1608

<a name="l01584"></a>01584 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(block);

1609

<a name="l01585"></a>01585

1610

<a name="l01586"></a>01586 register const T* pcurr = buf;

1611

<a name="l01587"></a>01587 register const T* pend = pcurr + (*pcurr >> 3);

1612

<a name="l01588"></a>01588 ++pcurr;

1613

<a name="l01589"></a>01589

1614

<a name="l01590"></a>01590 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> count = 0;

1615

<a name="l01591"></a>01591

1616

<a name="l01592"></a>01592 if (!(*buf & 1)) // Starts with 0

1617

<a name="l01593"></a>01593 {

1618

<a name="l01594"></a>01594 count += <a class="code" href="a00083.html#g503e0f3e79f819d9b58e4b0e905be116">bit_block_any_range</a>(block, 0, *pcurr);

1619

<a name="l01595"></a>01595 if (count)

1620

<a name="l01596"></a>01596 return count;

1621

<a name="l01597"></a>01597 ++pcurr;

1622

<a name="l01598"></a>01598 }

1623

<a name="l01599"></a>01599 ++pcurr; // now we are in GAP "0" again

1624

<a name="l01600"></a>01600

1625

<a name="l01601"></a>01601 for (;pcurr <= pend; pcurr+=2)

1626

<a name="l01602"></a>01602 {

1627

<a name="l01603"></a>01603 count += <a class="code" href="a00083.html#g503e0f3e79f819d9b58e4b0e905be116">bit_block_any_range</a>(block, *(pcurr-1)+1, *pcurr);

1628

<a name="l01604"></a>01604 if (count)

1629

<a name="l01605"></a>01605 return count;

1630

<a name="l01606"></a>01606 }

1631

<a name="l01607"></a>01607 return count;

1632

<a name="l01608"></a>01608 }

1633

<a name="l01609"></a>01609

1634

<a name="l01610"></a>01610

1635

<a name="l01611"></a>01611

1636

<a name="l01612"></a>01612 /*!

1637

<a name="l01613"></a>01613 \brief Compute bitcount of bit block XOR masked by GAP block.

1638

<a name="l01614"></a>01614 \param dest - bitblock buffer pointer.

1639

<a name="l01615"></a>01615 \param buf - GAP buffer pointer.

1640

<a name="l01616"></a>01616

1641

<a name="l01617"></a>01617 @ingroup gapfunc bitfunc

1642

<a name="l01618"></a>01618 */

1643

<a name="l01619"></a>01619 template<typename T>

1644

<a name="l01620"></a><a class="code" href="a00083.html#g803fbc7c790f07b14175303e524bd2d8">01620</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g803fbc7c790f07b14175303e524bd2d8" title="Compute bitcount of bit block XOR masked by GAP block.">gap_bitset_xor_count</a>(const unsigned* block, const T* buf)

1645

<a name="l01621"></a>01621 {

1646

<a name="l01622"></a>01622 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(block);

1647

<a name="l01623"></a>01623

1648

<a name="l01624"></a>01624 register const T* pcurr = buf;

1649

<a name="l01625"></a>01625 register const T* pend = pcurr + (*pcurr >> 3);

1650

<a name="l01626"></a>01626 ++pcurr;

1651

<a name="l01627"></a>01627

1652

<a name="l01628"></a>01628 unsigned bitval = *buf & 1;

1653

<a name="l01629"></a>01629

1654

<a name="l01630"></a>01630 register <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> count = <a class="code" href="a00083.html#g2485f707b2629c5ce7681cf9fe385b91">bit_block_calc_count_range</a>(block, 0, *pcurr);

1655

<a name="l01631"></a>01631 if (bitval)

1656

<a name="l01632"></a>01632 {

1657

<a name="l01633"></a>01633 count = *pcurr + 1 - count;

1658

<a name="l01634"></a>01634 }

1659

<a name="l01635"></a>01635

1660

<a name="l01636"></a>01636 for (bitval^=1, ++pcurr; pcurr <= pend; bitval^=1, ++pcurr)

1661

<a name="l01637"></a>01637 {

1662

<a name="l01638"></a>01638 T prev = *(pcurr-1)+1;

1663

<a name="l01639"></a>01639 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> c = <a class="code" href="a00083.html#g2485f707b2629c5ce7681cf9fe385b91">bit_block_calc_count_range</a>(block, prev, *pcurr);

1664

<a name="l01640"></a>01640

1665

<a name="l01641"></a>01641 if (bitval) // 1 gap; means Result = Total_Bits - BitCount;

1666

<a name="l01642"></a>01642 {

1667

<a name="l01643"></a>01643 c = (*pcurr - prev + 1) - c;

1668

<a name="l01644"></a>01644 }

1669

<a name="l01645"></a>01645

1670

<a name="l01646"></a>01646 count += c;

1671

<a name="l01647"></a>01647 }

1672

<a name="l01648"></a>01648 return count;

1673

<a name="l01649"></a>01649 }

1674

<a name="l01650"></a>01650

1675

<a name="l01651"></a>01651 /*!

1676

<a name="l01652"></a>01652 \brief Compute bitcount test of bit block XOR masked by GAP block.

1677

<a name="l01653"></a>01653 \param dest - bitblock buffer pointer.

1678

<a name="l01654"></a>01654 \param buf - GAP buffer pointer.

1679

<a name="l01655"></a>01655

1680

<a name="l01656"></a>01656 @ingroup gapfunc bitfunc

1681

<a name="l01657"></a>01657 */

1682

<a name="l01658"></a>01658 template<typename T>

1683

<a name="l01659"></a><a class="code" href="a00083.html#gd0f7ee00f84ea357d55e6a2f507c8918">01659</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#gd0f7ee00f84ea357d55e6a2f507c8918" title="Compute bitcount test of bit block XOR masked by GAP block.">gap_bitset_xor_any</a>(const unsigned* block, const T* buf)

1684

<a name="l01660"></a>01660 {

1685

<a name="l01661"></a>01661 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(block);

1686

<a name="l01662"></a>01662

1687

<a name="l01663"></a>01663 register const T* pcurr = buf;

1688

<a name="l01664"></a>01664 register const T* pend = pcurr + (*pcurr >> 3);

1689

<a name="l01665"></a>01665 ++pcurr;

1690

<a name="l01666"></a>01666

1691

<a name="l01667"></a>01667 unsigned bitval = *buf & 1;

1692

<a name="l01668"></a>01668

1693

<a name="l01669"></a>01669 register <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> count = <a class="code" href="a00083.html#g503e0f3e79f819d9b58e4b0e905be116">bit_block_any_range</a>(block, 0, *pcurr);

1694

<a name="l01670"></a>01670 if (bitval)

1695

<a name="l01671"></a>01671 {

1696

<a name="l01672"></a>01672 count = *pcurr + 1 - count;

1697

<a name="l01673"></a>01673 }

1698

<a name="l01674"></a>01674

1699

<a name="l01675"></a>01675 for (bitval^=1, ++pcurr; pcurr <= pend; bitval^=1, ++pcurr)

1700

<a name="l01676"></a>01676 {

1701

<a name="l01677"></a>01677 T prev = *(pcurr-1)+1;

1702

<a name="l01678"></a>01678 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> c = <a class="code" href="a00083.html#g503e0f3e79f819d9b58e4b0e905be116">bit_block_any_range</a>(block, prev, *pcurr);

1703

<a name="l01679"></a>01679

1704

<a name="l01680"></a>01680 if (bitval) // 1 gap; means Result = Total_Bits - BitCount;

1705

<a name="l01681"></a>01681 {

1706

<a name="l01682"></a>01682 c = (*pcurr - prev + 1) - c;

1707

<a name="l01683"></a>01683 }

1708

<a name="l01684"></a>01684

1709

<a name="l01685"></a>01685 count += c;

1710

<a name="l01686"></a>01686 if (count)

1711

<a name="l01687"></a>01687 return count;

1712

<a name="l01688"></a>01688 }

1713

<a name="l01689"></a>01689 return count;

1714

<a name="l01690"></a>01690 }

1715

<a name="l01691"></a>01691

1716

<a name="l01692"></a>01692

1717

<a name="l01693"></a>01693

1718

<a name="l01694"></a>01694 /*!

1719

<a name="l01695"></a>01695 \brief Compute bitcount of bit block OR masked by GAP block.

1720

<a name="l01696"></a>01696 \param dest - bitblock buffer pointer.

1721

<a name="l01697"></a>01697 \param buf - GAP buffer pointer.

1722

<a name="l01698"></a>01698

1723

<a name="l01699"></a>01699 @ingroup gapfunc bitfunc

1724

<a name="l01700"></a>01700 */

1725

<a name="l01701"></a>01701 template<typename T>

1726

<a name="l01702"></a><a class="code" href="a00083.html#g23733890861063a59f787e26763a734a">01702</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g23733890861063a59f787e26763a734a" title="Compute bitcount of bit block OR masked by GAP block.">gap_bitset_or_count</a>(const unsigned* block, const T* buf)

1727

<a name="l01703"></a>01703 {

1728

<a name="l01704"></a>01704 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(block);

1729

<a name="l01705"></a>01705

1730

<a name="l01706"></a>01706 register const T* pcurr = buf;

1731

<a name="l01707"></a>01707 register const T* pend = pcurr + (*pcurr >> 3);

1732

<a name="l01708"></a>01708 ++pcurr;

1733

<a name="l01709"></a>01709

1734

<a name="l01710"></a>01710 unsigned bitval = *buf & 1;

1735

<a name="l01711"></a>01711

1736

<a name="l01712"></a>01712 register <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> count;

1737

<a name="l01713"></a>01713 if (bitval)

1738

<a name="l01714"></a>01714 {

1739

<a name="l01715"></a>01715 count = *pcurr + 1;

1740

<a name="l01716"></a>01716 }

1741

<a name="l01717"></a>01717 else

1742

<a name="l01718"></a>01718 {

1743

<a name="l01719"></a>01719 count = <a class="code" href="a00083.html#g2485f707b2629c5ce7681cf9fe385b91">bit_block_calc_count_range</a>(block, 0, *pcurr);

1744

<a name="l01720"></a>01720 }

1745

<a name="l01721"></a>01721

1746

<a name="l01722"></a>01722 for (bitval^=1, ++pcurr; pcurr <= pend; bitval^=1, ++pcurr)

1747

<a name="l01723"></a>01723 {

1748

<a name="l01724"></a>01724 T prev = *(pcurr-1)+1;

1749

<a name="l01725"></a>01725 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> c;

1750

<a name="l01726"></a>01726

1751

<a name="l01727"></a>01727 if (bitval)

1752

<a name="l01728"></a>01728 {

1753

<a name="l01729"></a>01729 c = (*pcurr - prev + 1);

1754

<a name="l01730"></a>01730 }

1755

<a name="l01731"></a>01731 else

1756

<a name="l01732"></a>01732 {

1757

<a name="l01733"></a>01733 c = <a class="code" href="a00083.html#g2485f707b2629c5ce7681cf9fe385b91">bit_block_calc_count_range</a>(block, prev, *pcurr);

1758

<a name="l01734"></a>01734 }

1759

<a name="l01735"></a>01735

1760

<a name="l01736"></a>01736 count += c;

1761

<a name="l01737"></a>01737 }

1762

<a name="l01738"></a>01738 return count;

1763

<a name="l01739"></a>01739 }

1764

<a name="l01740"></a>01740

1765

<a name="l01741"></a>01741 /*!

1766

<a name="l01742"></a>01742 \brief Compute bitcount test of bit block OR masked by GAP block.

1767

<a name="l01743"></a>01743 \param dest - bitblock buffer pointer.

1768

<a name="l01744"></a>01744 \param buf - GAP buffer pointer.

1769

<a name="l01745"></a>01745

1770

<a name="l01746"></a>01746 @ingroup gapfunc bitfunc

1771

<a name="l01747"></a>01747 */

1772

<a name="l01748"></a>01748 template<typename T>

1773

<a name="l01749"></a><a class="code" href="a00083.html#gd15f1b92c70752cd3b97fa9e0c585f00">01749</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#gd15f1b92c70752cd3b97fa9e0c585f00" title="Compute bitcount test of bit block OR masked by GAP block.">gap_bitset_or_any</a>(const unsigned* block, const T* buf)

1774

<a name="l01750"></a>01750 {

1775

<a name="l01751"></a>01751 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(block);

1776

<a name="l01752"></a>01752

1777

<a name="l01753"></a>01753 register const T* pcurr = buf;

1778

<a name="l01754"></a>01754 register const T* pend = pcurr + (*pcurr >> 3);

1779

<a name="l01755"></a>01755 ++pcurr;

1780

<a name="l01756"></a>01756

1781

<a name="l01757"></a>01757 unsigned bitval = *buf & 1;

1782

<a name="l01758"></a>01758

1783

<a name="l01759"></a>01759 register <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> count;

1784

<a name="l01760"></a>01760 if (bitval)

1785

<a name="l01761"></a>01761 {

1786

<a name="l01762"></a>01762 count = *pcurr + 1;

1787

<a name="l01763"></a>01763 }

1788

<a name="l01764"></a>01764 else

1789

<a name="l01765"></a>01765 {

1790

<a name="l01766"></a>01766 count = <a class="code" href="a00083.html#g503e0f3e79f819d9b58e4b0e905be116">bit_block_any_range</a>(block, 0, *pcurr);

1791

<a name="l01767"></a>01767 }

1792

<a name="l01768"></a>01768

1793

<a name="l01769"></a>01769 for (bitval^=1, ++pcurr; pcurr <= pend; bitval^=1, ++pcurr)

1794

<a name="l01770"></a>01770 {

1795

<a name="l01771"></a>01771 T prev = *(pcurr-1)+1;

1796

<a name="l01772"></a>01772 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> c;

1797

<a name="l01773"></a>01773

1798

<a name="l01774"></a>01774 if (bitval)

1799

<a name="l01775"></a>01775 {

1800

<a name="l01776"></a>01776 c = (*pcurr - prev + 1);

1801

<a name="l01777"></a>01777 }

1802

<a name="l01778"></a>01778 else

1803

<a name="l01779"></a>01779 {

1804

<a name="l01780"></a>01780 c = <a class="code" href="a00083.html#g503e0f3e79f819d9b58e4b0e905be116">bit_block_any_range</a>(block, prev, *pcurr);

1805

<a name="l01781"></a>01781 }

1806

<a name="l01782"></a>01782 count += c;

1807

<a name="l01783"></a>01783 if (count)

1808

<a name="l01784"></a>01784 return count;

1809

<a name="l01785"></a>01785 }

1810

<a name="l01786"></a>01786 return count;

1811

<a name="l01787"></a>01787 }

1812

<a name="l01788"></a>01788

1813

<a name="l01789"></a>01789

1814

<a name="l01790"></a>01790

1815

<a name="l01791"></a>01791 /*!

1816

<a name="l01792"></a>01792 \brief Bitblock memset operation.

1817

<a name="l01793"></a>01793

1818

<a name="l01794"></a>01794 \param dst - destination block.

1819

<a name="l01795"></a>01795 \param value - value to set.

1820

<a name="l01796"></a>01796

1821

<a name="l01797"></a>01797 @ingroup bitfunc

1822

<a name="l01798"></a>01798 */

1823

<a name="l01799"></a>01799 inline

1824

<a name="l01800"></a><a class="code" href="a00083.html#gada8b13c35acd8df90129b45edcfc5de">01800</a> void <a class="code" href="a00083.html#gada8b13c35acd8df90129b45edcfc5de" title="Bitblock memset operation.">bit_block_set</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst, <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> value)

1825

<a name="l01801"></a>01801 {

1826

<a name="l01802"></a>01802 //#ifdef BMVECTOPT

1827

<a name="l01803"></a>01803 // VECT_SET_BLOCK(dst, dst + bm::set_block_size, value);

1828

<a name="l01804"></a>01804 //#else

1829

<a name="l01805"></a>01805 ::memset(dst, value, <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a> * sizeof(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>));

1830

<a name="l01806"></a>01806 //#endif

1831

<a name="l01807"></a>01807 }

1832

<a name="l01808"></a>01808

1833

<a name="l01809"></a>01809

1834

<a name="l01810"></a>01810 /*!

1835

<a name="l01811"></a>01811 \brief GAP block to bitblock conversion.

1836

<a name="l01812"></a>01812 \param dest - bitblock buffer pointer.

1837

<a name="l01813"></a>01813 \param buf - GAP buffer pointer.

1838

<a name="l01814"></a>01814

1839

<a name="l01815"></a>01815 @ingroup gapfunc

1840

<a name="l01816"></a>01816 */

1841

<a name="l01817"></a>01817 template<typename T>

1842

<a name="l01818"></a><a class="code" href="a00082.html#g4862f4dcdcb7c0575e2e2db9e5f2a849">01818</a> void <a class="code" href="a00082.html#g4862f4dcdcb7c0575e2e2db9e5f2a849" title="GAP block to bitblock conversion.">gap_convert_to_bitset</a>(unsigned* dest, const T* buf)

1843

<a name="l01819"></a>01819 {

1844

<a name="l01820"></a>01820 <a class="code" href="a00083.html#gada8b13c35acd8df90129b45edcfc5de" title="Bitblock memset operation.">bit_block_set</a>(dest, 0);

1845

<a name="l01821"></a>01821 <a class="code" href="a00082.html#g12615cd62f2e5367e1bc688d00a2188f" title="Adds(OR) GAP block to bitblock.">gap_add_to_bitset</a>(dest, buf);

1846

<a name="l01822"></a>01822 }

1847

<a name="l01823"></a>01823

1848

<a name="l01824"></a>01824

1849

<a name="l01825"></a>01825 /*!

1850

<a name="l01826"></a>01826 \brief GAP block to bitblock conversion.

1851

<a name="l01827"></a>01827 \param dest - bitblock buffer pointer.

1852

<a name="l01828"></a>01828 \param buf - GAP buffer pointer.

1853

<a name="l01829"></a>01829 \param dest_size - length of the destination buffer.

1854

<a name="l01830"></a>01830

1855

<a name="l01831"></a>01831 @ingroup gapfunc

1856

<a name="l01832"></a>01832 */

1857

<a name="l01833"></a>01833 template<typename T>

1858

<a name="l01834"></a><a class="code" href="a00082.html#g9bb80c42ee0ecf8f2af8250d7f5d327b">01834</a> void <a class="code" href="a00082.html#g4862f4dcdcb7c0575e2e2db9e5f2a849" title="GAP block to bitblock conversion.">gap_convert_to_bitset</a>(unsigned* dest, const T* buf, unsigned dest_len)

1859

<a name="l01835"></a>01835 {

1860

<a name="l01836"></a>01836 ::memset(dest, 0, dest_len * sizeof(unsigned));

1861

<a name="l01837"></a>01837 <a class="code" href="a00082.html#g12615cd62f2e5367e1bc688d00a2188f" title="Adds(OR) GAP block to bitblock.">gap_add_to_bitset</a>(dest, buf);

1862

<a name="l01838"></a>01838 }

1863

<a name="l01839"></a>01839

1864

<a name="l01840"></a>01840

1865

<a name="l01841"></a>01841

1866

<a name="l01842"></a>01842 /*!

1867

<a name="l01843"></a>01843 \brief Smart GAP block to bitblock conversion.

1868

<a name="l01844"></a>01844

1869

<a name="l01845"></a>01845 Checks if GAP block is ALL-ZERO or ALL-ON. In those cases returns

1870

<a name="l01846"></a>01846 pointer on special static bitblocks.

1871

<a name="l01847"></a>01847

1872

<a name="l01848"></a>01848 \param dest - bitblock buffer pointer.

1873

<a name="l01849"></a>01849 \param buf - GAP buffer pointer.

1874

<a name="l01850"></a>01850 \param set_max - max possible bitset length

1875

<a name="l01851"></a>01851

1876

<a name="l01852"></a>01852 @ingroup gapfunc

1877

<a name="l01853"></a>01853 */

1878

<a name="l01854"></a>01854 template<typename T>

1879

<a name="l01855"></a><a class="code" href="a00082.html#g3f01bb7c1ae7983aa8c4ba82e1e3f54c">01855</a> unsigned* <a class="code" href="a00082.html#g3f01bb7c1ae7983aa8c4ba82e1e3f54c" title="Smart GAP block to bitblock conversion.">gap_convert_to_bitset_smart</a>(unsigned* dest,

1880

<a name="l01856"></a>01856 const T* buf,

1881

<a name="l01857"></a>01857 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">id_t</a> set_max)

1882

<a name="l01858"></a>01858 {

1883

<a name="l01859"></a>01859 if (buf[1] == set_max - 1)

1884

<a name="l01860"></a>01860 {

1885

<a name="l01861"></a>01861 return (buf[0] & 1) ? <a class="code" href="a00063.html#1365569f85f442c4914a3579f55df99b">FULL_BLOCK_ADDR</a> : 0;

1886

<a name="l01862"></a>01862 }

1887

<a name="l01863"></a>01863

1888

<a name="l01864"></a>01864 <a class="code" href="a00082.html#g4862f4dcdcb7c0575e2e2db9e5f2a849" title="GAP block to bitblock conversion.">gap_convert_to_bitset</a>(dest, buf);

1889

<a name="l01865"></a>01865 return dest;

1890

<a name="l01866"></a>01866 }

1891

<a name="l01867"></a>01867

1892

<a name="l01868"></a>01868

1893

<a name="l01869"></a>01869 /*!

1894

<a name="l01870"></a>01870 \brief Calculates sum of all words in GAP block. (For debugging purposes)

1895

<a name="l01871"></a>01871 \note For debugging and testing ONLY.

1896

<a name="l01872"></a>01872 \param buf - GAP buffer pointer.

1897

<a name="l01873"></a>01873 \return Sum of all words.

1898

<a name="l01874"></a>01874

1899

<a name="l01875"></a>01875 @ingroup gapfunc

1900

<a name="l01876"></a>01876 */

1901

<a name="l01877"></a><a class="code" href="a00082.html#g14d29338ffd1387758810b3f9e3a72c6">01877</a> template<typename T> unsigned <a class="code" href="a00082.html#g14d29338ffd1387758810b3f9e3a72c6" title="Calculates sum of all words in GAP block. (For debugging purposes).">gap_control_sum</a>(const T* buf)

1902

<a name="l01878"></a>01878 {

1903

<a name="l01879"></a>01879 unsigned end = *buf >> 3;

1904

<a name="l01880"></a>01880

1905

<a name="l01881"></a>01881 register const T* pcurr = buf;

1906

<a name="l01882"></a>01882 register const T* pend = pcurr + (*pcurr >> 3);

1907

<a name="l01883"></a>01883 ++pcurr;

1908

<a name="l01884"></a>01884

1909

<a name="l01885"></a>01885 if (*buf & 1) // Starts with 1

1910

<a name="l01886"></a>01886 {

1911

<a name="l01887"></a>01887 ++pcurr;

1912

<a name="l01888"></a>01888 }

1913

<a name="l01889"></a>01889 ++pcurr; // now we are in GAP "1" again

1914

<a name="l01890"></a>01890

1915

<a name="l01891"></a>01891 while (pcurr <= pend)

1916

<a name="l01892"></a>01892 {

1917

<a name="l01893"></a>01893 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(*pcurr > *(pcurr-1));

1918

<a name="l01894"></a>01894 pcurr += 2;

1919

<a name="l01895"></a>01895 }

1920

<a name="l01896"></a>01896 return buf[end];

1921

<a name="l01897"></a>01897

1922

<a name="l01898"></a>01898 }

1923

<a name="l01899"></a>01899

1924

<a name="l01900"></a>01900

1925

<a name="l01901"></a>01901 /*!

1926

<a name="l01902"></a>01902 \brief Sets all bits to 0 or 1 (GAP)

1927

<a name="l01903"></a>01903 \param buf - GAP buffer pointer.

1928

<a name="l01904"></a>01904 \param set_max - max possible bitset length

1929

<a name="l01905"></a>01905

1930

<a name="l01906"></a>01906 @ingroup gapfunc

1931

<a name="l01907"></a>01907 */

1932

<a name="l01908"></a><a class="code" href="a00082.html#gef53b2877ff369badd7bb25b26bb9029">01908</a> template<class T> void <a class="code" href="a00082.html#gef53b2877ff369badd7bb25b26bb9029" title="Sets all bits to 0 or 1 (GAP).">gap_set_all</a>(T* buf,

1933

<a name="l01909"></a>01909 unsigned set_max,

1934

<a name="l01910"></a>01910 unsigned value)

1935

<a name="l01911"></a>01911 {

1936

<a name="l01912"></a>01912 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(value == 0 || value == 1);

1937

<a name="l01913"></a>01913 *buf = (*buf & 6u) + (1u << 3) + value;

1938

<a name="l01914"></a>01914 *(++buf) = set_max - 1;

1939

<a name="l01915"></a>01915 }

1940

<a name="l01916"></a>01916

1941

<a name="l01917"></a>01917

1942

<a name="l01918"></a>01918 /*!

1943

<a name="l01919"></a>01919 \brief Init gap block so it has block in it (can be whole block)

1944

<a name="l01920"></a>01920 \param buf - GAP buffer pointer.

1945

<a name="l01921"></a>01921 \param from - one block start

1946

<a name="l01922"></a>01922 \param to - one block end

1947

<a name="l01923"></a>01923 \param value - (block value)1 or 0

1948

<a name="l01924"></a>01924 \param set_max - max possible bitset length

1949

<a name="l01925"></a>01925

1950

<a name="l01926"></a>01926 @ingroup gapfunc

1951

<a name="l01927"></a>01927 */

1952

<a name="l01928"></a>01928 template<class T>

1953

<a name="l01929"></a><a class="code" href="a00082.html#g5d49355eb9dd7947699e20f3a2a75ef5">01929</a> void <a class="code" href="a00082.html#g5d49355eb9dd7947699e20f3a2a75ef5" title="Init gap block so it has block in it (can be whole block).">gap_init_range_block</a>(T* buf,

1954

<a name="l01930"></a>01930 unsigned from,

1955

<a name="l01931"></a>01931 unsigned to,

1956

<a name="l01932"></a>01932 unsigned value,

1957

<a name="l01933"></a>01933 unsigned set_max)

1958

<a name="l01934"></a>01934 {

1959

<a name="l01935"></a>01935 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(value == 0 || value == 1);

1960

<a name="l01936"></a>01936

1961

<a name="l01937"></a>01937 unsigned gap_len;

1962

<a name="l01938"></a>01938 if (from == 0)

1963

<a name="l01939"></a>01939 {

1964

<a name="l01940"></a>01940 if (to == set_max - 1)

1965

<a name="l01941"></a>01941 {

1966

<a name="l01942"></a>01942 <a class="code" href="a00082.html#gef53b2877ff369badd7bb25b26bb9029" title="Sets all bits to 0 or 1 (GAP).">gap_set_all</a>(buf, set_max, value);

1967

<a name="l01943"></a>01943 }

1968

<a name="l01944"></a>01944 else

1969

<a name="l01945"></a>01945 {

1970

<a name="l01946"></a>01946 gap_len = 2;

1971

<a name="l01947"></a>01947 buf[1] = to;

1972

<a name="l01948"></a>01948 buf[2] = set_max - 1;

1973

<a name="l01949"></a>01949 buf[0] = (*buf & 6u) + (gap_len << 3) + value;

1974

<a name="l01950"></a>01950 }

1975

<a name="l01951"></a>01951 return;

1976

<a name="l01952"></a>01952 }

1977

<a name="l01953"></a>01953 // from != 0

1978

<a name="l01954"></a>01954

1979

<a name="l01955"></a>01955 value = !value;

1980

<a name="l01956"></a>01956 if (to == set_max - 1)

1981

<a name="l01957"></a>01957 {

1982

<a name="l01958"></a>01958 gap_len = 2;

1983

<a name="l01959"></a>01959 buf[1] = from - 1;

1984

<a name="l01960"></a>01960 buf[2] = set_max - 1;

1985

<a name="l01961"></a>01961 }

1986

<a name="l01962"></a>01962 else

1987

<a name="l01963"></a>01963 {

1988

<a name="l01964"></a>01964 gap_len = 3;

1989

<a name="l01965"></a>01965 buf[1] = from - 1;

1990

<a name="l01966"></a>01966 buf[2] = to;

1991

<a name="l01967"></a>01967 buf[3] = set_max - 1;

1992

<a name="l01968"></a>01968 }

1993

<a name="l01969"></a>01969 buf[0] = (*buf & 6u) + (gap_len << 3) + value;

1994

<a name="l01970"></a>01970 }

1995

<a name="l01971"></a>01971

1996

<a name="l01972"></a>01972

1997

<a name="l01973"></a>01973 /*!

1998

<a name="l01974"></a>01974 \brief Inverts all bits in the GAP buffer.

1999

<a name="l01975"></a>01975 \param buf - GAP buffer pointer.

2000

<a name="l01976"></a>01976

2001

<a name="l01977"></a>01977 @ingroup gapfunc

2002

<a name="l01978"></a>01978 */

2003

<a name="l01979"></a><a class="code" href="a00082.html#g3f22bfde5dfe06d6d77dc2598b8c0845">01979</a> template<typename T> void <a class="code" href="a00082.html#g3f22bfde5dfe06d6d77dc2598b8c0845" title="Inverts all bits in the GAP buffer.">gap_invert</a>(T* buf)

2004

<a name="l01980"></a>01980 {

2005

<a name="l01981"></a>01981 *buf ^= 1;

2006

<a name="l01982"></a>01982 }

2007

<a name="l01983"></a>01983

2008

<a name="l01984"></a>01984 /*!

2009

<a name="l01985"></a>01985 \brief Temporary inverts all bits in the GAP buffer.

2010

<a name="l01986"></a>01986

2011

<a name="l01987"></a>01987 In this function const-ness of the buffer means nothing.

2012

<a name="l01988"></a>01988 Calling this function again restores the status of the buffer.

2013

<a name="l01989"></a>01989

2014

<a name="l01990"></a>01990 \param buf - GAP buffer pointer. (Buffer IS changed)

2015

<a name="l01991"></a>01991

2016

<a name="l01992"></a>01992 @ingroup gapfunc

2017

<a name="l01993"></a>01993 */

2018

<a name="l01994"></a>01994 /*

2019

<a name="l01995"></a>01995 template<typename T> void gap_temp_invert(const T* buf)

2020

<a name="l01996"></a>01996 {

2021

<a name="l01997"></a>01997 T* buftmp = const_cast<T*>(buf);

2022

<a name="l01998"></a>01998 *buftmp ^= 1;

2023

<a name="l01999"></a>01999 }

2024

<a name="l02000"></a>02000 */

2025

<a name="l02001"></a>02001

2026

<a name="l02002"></a>02002 /*!

2027

<a name="l02003"></a>02003 \brief Checks if GAP block is all-zero.

2028

<a name="l02004"></a>02004 \param buf - GAP buffer pointer.

2029

<a name="l02005"></a>02005 \param set_max - max possible bitset length

2030

<a name="l02006"></a>02006 \returns true if all-zero.

2031

<a name="l02007"></a>02007

2032

<a name="l02008"></a>02008 @ingroup gapfunc

2033

<a name="l02009"></a>02009 */

2034

<a name="l02010"></a>02010 template<typename T>

2035

<a name="l02011"></a><a class="code" href="a00082.html#g690ff7c8b16e1821a77663b7194267e7">02011</a> bool <a class="code" href="a00082.html#g690ff7c8b16e1821a77663b7194267e7" title="Temporary inverts all bits in the GAP buffer.">gap_is_all_zero</a>(const T* buf, unsigned set_max)

2036

<a name="l02012"></a>02012 {

2037

<a name="l02013"></a>02013 return (((*buf & 1)==0) && (*(++buf) == set_max - 1));

2038

<a name="l02014"></a>02014 }

2039

<a name="l02015"></a>02015

2040

<a name="l02016"></a>02016 /*!

2041

<a name="l02017"></a>02017 \brief Checks if GAP block is all-one.

2042

<a name="l02018"></a>02018 \param buf - GAP buffer pointer.

2043

<a name="l02019"></a>02019 \param set_max - max possible bitset length

2044

<a name="l02020"></a>02020 \returns true if all-one.

2045

<a name="l02021"></a>02021

2046

<a name="l02022"></a>02022 @ingroup gapfunc

2047

<a name="l02023"></a>02023 */

2048

<a name="l02024"></a>02024 template<typename T>

2049

<a name="l02025"></a><a class="code" href="a00082.html#g1427d43e91872f981c6311fa76ab5633">02025</a> bool <a class="code" href="a00082.html#g1427d43e91872f981c6311fa76ab5633" title="Checks if GAP block is all-one.">gap_is_all_one</a>(const T* buf, unsigned set_max)

2050

<a name="l02026"></a>02026 {

2051

<a name="l02027"></a>02027 return ((*buf & 1) && (*(++buf) == set_max - 1));

2052

<a name="l02028"></a>02028 }

2053

<a name="l02029"></a>02029

2054

<a name="l02030"></a>02030 /*!

2055

<a name="l02031"></a>02031 \brief Returs GAP block length.

2056

<a name="l02032"></a>02032 \param buf - GAP buffer pointer.

2057

<a name="l02033"></a>02033 \returns GAP block length.

2058

<a name="l02034"></a>02034

2059

<a name="l02035"></a>02035 @ingroup gapfunc

2060

<a name="l02036"></a>02036 */

2061

<a name="l02037"></a><a class="code" href="a00082.html#gd6bfb9da9950b0df8983a9faf9db5042">02037</a> template<typename T> unsigned <a class="code" href="a00082.html#gd6bfb9da9950b0df8983a9faf9db5042" title="Returs GAP block length.">gap_length</a>(const T* buf)

2062

<a name="l02038"></a>02038 {

2063

<a name="l02039"></a>02039 return (*buf >> 3) + 1;

2064

<a name="l02040"></a>02040 }

2065

<a name="l02041"></a>02041

2066

<a name="l02042"></a>02042

2067

<a name="l02043"></a>02043 /*!

2068

<a name="l02044"></a>02044 \brief Returs GAP block capacity.

2069

<a name="l02045"></a>02045 \param buf - GAP buffer pointer.

2070

<a name="l02046"></a>02046 \returns GAP block capacity.

2071

<a name="l02047"></a>02047

2072

<a name="l02048"></a>02048 @ingroup gapfunc

2073

<a name="l02049"></a>02049 */

2074

<a name="l02050"></a>02050 template<typename T>

2075

<a name="l02051"></a><a class="code" href="a00082.html#g0419ed06e2f0b7891e7d721546f5fb45">02051</a> unsigned <a class="code" href="a00082.html#g0419ed06e2f0b7891e7d721546f5fb45" title="Returs GAP block capacity.">gap_capacity</a>(const T* buf, const T* glevel_len)

2076

<a name="l02052"></a>02052 {

2077

<a name="l02053"></a>02053 return glevel_len[(*buf >> 1) & 3];

2078

<a name="l02054"></a>02054 }

2079

<a name="l02055"></a>02055

2080

<a name="l02056"></a>02056

2081

<a name="l02057"></a>02057 /*!

2082

<a name="l02058"></a>02058 \brief Returs GAP block capacity limit.

2083

<a name="l02059"></a>02059 \param buf - GAP buffer pointer.

2084

<a name="l02060"></a>02060 \param glevel_len - GAP lengths table (gap_len_table)

2085

<a name="l02061"></a>02061 \returns GAP block limit.

2086

<a name="l02062"></a>02062

2087

<a name="l02063"></a>02063 @ingroup gapfunc

2088

<a name="l02064"></a>02064 */

2089

<a name="l02065"></a>02065 template<typename T>

2090

<a name="l02066"></a><a class="code" href="a00082.html#g94a5371b5dc6a1560d95d7c2dde88815">02066</a> unsigned <a class="code" href="a00082.html#g94a5371b5dc6a1560d95d7c2dde88815" title="Returs GAP block capacity limit.">gap_limit</a>(const T* buf, const T* glevel_len)

2091

<a name="l02067"></a>02067 {

2092

<a name="l02068"></a>02068 return glevel_len[(*buf >> 1) & 3]-4;

2093

<a name="l02069"></a>02069 }

2094

<a name="l02070"></a>02070

2095

<a name="l02071"></a>02071

2096

<a name="l02072"></a>02072 /*!

2097

<a name="l02073"></a>02073 \brief Returs GAP blocks capacity level.

2098

<a name="l02074"></a>02074 \param buf - GAP buffer pointer.

2099

<a name="l02075"></a>02075 \returns GAP block capacity level.

2100

<a name="l02076"></a>02076

2101

<a name="l02077"></a>02077 @ingroup gapfunc

2102

<a name="l02078"></a>02078 */

2103

<a name="l02079"></a><a class="code" href="a00082.html#g1defe73aa4227a0e7204363ac6bb1ac1">02079</a> template<typename T> unsigned <a class="code" href="a00082.html#g1defe73aa4227a0e7204363ac6bb1ac1" title="Returs GAP blocks capacity level.">gap_level</a>(const T* buf)

2104

<a name="l02080"></a>02080 {

2105

<a name="l02081"></a>02081 return (*buf >> 1) & 3;

2106

<a name="l02082"></a>02082 }

2107

<a name="l02083"></a>02083

2108

<a name="l02084"></a>02084

2109

<a name="l02085"></a>02085 /*!

2110

<a name="l02086"></a>02086 \brief Sets GAP block capacity level.

2111

<a name="l02087"></a>02087 \param buf - GAP buffer pointer.

2112

<a name="l02088"></a>02088 \param level new GAP block capacity level.

2113

<a name="l02089"></a>02089

2114

<a name="l02090"></a>02090 @ingroup gapfunc

2115

<a name="l02091"></a>02091 */

2116

<a name="l02092"></a><a class="code" href="a00082.html#g501aa9bf029e7f9ea9518e7003fe5549">02092</a> template<typename T> void <a class="code" href="a00082.html#g501aa9bf029e7f9ea9518e7003fe5549" title="Sets GAP block capacity level.">set_gap_level</a>(T* buf,

2117

<a name="l02093"></a>02093 unsigned level)

2118

<a name="l02094"></a>02094 {

2119

<a name="l02095"></a>02095 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(level < <a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>);

2120

<a name="l02096"></a>02096 *buf = ((level & 3) << 1) | (*buf & 1) | (*buf & ~7);

2121

<a name="l02097"></a>02097 }

2122

<a name="l02098"></a>02098

2123

<a name="l02099"></a>02099

2124

<a name="l02100"></a>02100 /*!

2125

<a name="l02101"></a>02101 \brief Calculates GAP block capacity level.

2126

<a name="l02102"></a>02102 \param len - GAP buffer length.

2127

<a name="l02103"></a>02103 \param glevel_len - GAP lengths table

2128

<a name="l02104"></a>02104 \return GAP block capacity level.

2129

<a name="l02105"></a>02105 -1 if block does not fit any level.

2130

<a name="l02106"></a>02106 @ingroup gapfunc

2131

<a name="l02107"></a>02107 */

2132

<a name="l02108"></a>02108 template<typename T>

2133

<a name="l02109"></a><a class="code" href="a00082.html#g3bfaebeeb4b2d479c5a9ac9d57607165">02109</a> inline int <a class="code" href="a00082.html#g3bfaebeeb4b2d479c5a9ac9d57607165" title="Calculates GAP block capacity level.">gap_calc_level</a>(int len, const T* glevel_len)

2134

<a name="l02110"></a>02110 {

2135

<a name="l02111"></a>02111 if (len <= (glevel_len[0]-4)) return 0;

2136

<a name="l02112"></a>02112 if (len <= (glevel_len[1]-4)) return 1;

2137

<a name="l02113"></a>02113 if (len <= (glevel_len[2]-4)) return 2;

2138

<a name="l02114"></a>02114 if (len <= (glevel_len[3]-4)) return 3;

2139

<a name="l02115"></a>02115

2140

<a name="l02116"></a>02116 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(<a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a> == 4);

2141

<a name="l02117"></a>02117 return -1;

2142

<a name="l02118"></a>02118 }

2143

<a name="l02119"></a>02119

2144

<a name="l02120"></a>02120 /*! @brief Returns number of free elements in GAP block array.

2145

<a name="l02121"></a>02121 Difference between GAP block capacity on this level and actual GAP length.

2146

<a name="l02122"></a>02122

2147

<a name="l02123"></a>02123 @param buf - GAP buffer pointer

2148

<a name="l02124"></a>02124 @parma glevel_len - GAP lengths table

2149

<a name="l02125"></a>02125

2150

<a name="l02126"></a>02126 @return Number of free GAP elements

2151

<a name="l02127"></a>02127 @ingroup gapfunc

2152

<a name="l02128"></a>02128 */

2153

<a name="l02129"></a>02129 template<typename T>

2154

<a name="l02130"></a><a class="code" href="a00082.html#gfd76869eb44fac688da5e26e0e74f41f">02130</a> inline unsigned <a class="code" href="a00082.html#gfd76869eb44fac688da5e26e0e74f41f" title="Returns number of free elements in GAP block array. Difference between GAP block...">gap_free_elements</a>(const T* buf, const T* glevel_len)

2155

<a name="l02131"></a>02131 {

2156

<a name="l02132"></a>02132 unsigned len = <a class="code" href="a00082.html#gd6bfb9da9950b0df8983a9faf9db5042" title="Returs GAP block length.">gap_length</a>(buf);

2157

<a name="l02133"></a>02133 unsigned capacity = <a class="code" href="a00082.html#g0419ed06e2f0b7891e7d721546f5fb45" title="Returs GAP block capacity.">gap_capacity</a>(buf, glevel_len);

2158

<a name="l02134"></a>02134 return capacity - len;

2159

<a name="l02135"></a>02135 }

2160

<a name="l02136"></a>02136

2161

<a name="l02137"></a>02137

2162

<a name="l02138"></a>02138 /*!

2163

<a name="l02139"></a>02139 \brief Lexicographical comparison of BIT buffers.

2164

<a name="l02140"></a>02140 \param buf1 - First buffer pointer.

2165

<a name="l02141"></a>02141 \param buf2 - Second buffer pointer.

2166

<a name="l02142"></a>02142 \param len - Buffer length in elements (T).

2167

<a name="l02143"></a>02143 \return <0 - less, =0 - equal, >0 - greater.

2168

<a name="l02144"></a>02144

2169

<a name="l02145"></a>02145 @ingroup bitfunc

2170

<a name="l02146"></a>02146 */

2171

<a name="l02147"></a>02147 template<typename T>

2172

<a name="l02148"></a><a class="code" href="a00083.html#g91fe9566575d9d66e1bb9d030b3d29a0">02148</a> int <a class="code" href="a00083.html#g91fe9566575d9d66e1bb9d030b3d29a0" title="Lexicographical comparison of BIT buffers.">bitcmp</a>(const T* buf1, const T* buf2, unsigned len)

2173

<a name="l02149"></a>02149 {

2174

<a name="l02150"></a>02150 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(len);

2175

<a name="l02151"></a>02151

2176

<a name="l02152"></a>02152 const T* pend1 = buf1 + len;

2177

<a name="l02153"></a>02153 do

2178

<a name="l02154"></a>02154 {

2179

<a name="l02155"></a>02155 T w1 = *buf1++;

2180

<a name="l02156"></a>02156 T w2 = *buf2++;

2181

<a name="l02157"></a>02157 T diff = w1 ^ w2;

2182

<a name="l02158"></a>02158

2183

<a name="l02159"></a>02159 if (diff)

2184

<a name="l02160"></a>02160 {

2185

<a name="l02161"></a>02161 return (w1 & diff & -diff) ? 1 : -1;

2186

<a name="l02162"></a>02162 }

2187

<a name="l02163"></a>02163

2188

<a name="l02164"></a>02164 } while (buf1 < pend1);

2189

<a name="l02165"></a>02165

2190

<a name="l02166"></a>02166 return 0;

2191

<a name="l02167"></a>02167 }

2192

<a name="l02168"></a>02168

2193

<a name="l02169"></a>02169

2194

<a name="l02170"></a>02170 /*!

2195

<a name="l02171"></a>02171 \brief Converts bit block to GAP.

2196

<a name="l02172"></a>02172 \param dest - Destinatio GAP buffer.

2197

<a name="l02173"></a>02173 \param src - Source bitblock buffer.

2198

<a name="l02174"></a>02174 \param bits - Number of bits to convert.

2199

<a name="l02175"></a>02175 \param dest_len - length of the dest. buffer.

2200

<a name="l02176"></a>02176 \return New ength of GAP block or 0 if conversion failed

2201

<a name="l02177"></a>02177 (insufficicent space).

2202

<a name="l02178"></a>02178

2203

<a name="l02179"></a>02179 @ingroup gapfunc

2204

<a name="l02180"></a>02180 */

2205

<a name="l02181"></a>02181 template<typename T>

2206

<a name="l02182"></a><a class="code" href="a00082.html#g80d09bb6ab244e68ab0c1fdccc17b95b">02182</a> unsigned <a class="code" href="a00082.html#g80d09bb6ab244e68ab0c1fdccc17b95b" title="Converts bit block to GAP.">bit_convert_to_gap</a>(T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dest,

2207

<a name="l02183"></a>02183 const unsigned* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src,

2208

<a name="l02184"></a>02184 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> bits,

2209

<a name="l02185"></a>02185 unsigned dest_len)

2210

<a name="l02186"></a>02186 {

2211

<a name="l02187"></a>02187 register T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> pcurr = dest;

2212

<a name="l02188"></a>02188 T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> end = dest + dest_len;

2213

<a name="l02189"></a>02189 register int bitval = (*src) & 1;

2214

<a name="l02190"></a>02190 *pcurr |= bitval;

2215

<a name="l02191"></a>02191

2216

<a name="l02192"></a>02192 ++pcurr;

2217

<a name="l02193"></a>02193 *pcurr = 0;

2218

<a name="l02194"></a>02194 register unsigned bit_idx = 0;

2219

<a name="l02195"></a>02195 register int bitval_next;

2220

<a name="l02196"></a>02196

2221

<a name="l02197"></a>02197 unsigned val = *src;

2222

<a name="l02198"></a>02198

2223

<a name="l02199"></a>02199 do

2224

<a name="l02200"></a>02200 {

2225

<a name="l02201"></a>02201 // We can fast pace if *src == 0 or *src = 0xffffffff

2226

<a name="l02202"></a>02202

2227

<a name="l02203"></a>02203 while (val == 0 || val == 0xffffffff)

2228

<a name="l02204"></a>02204 {

2229

<a name="l02205"></a>02205 bitval_next = val ? 1 : 0;

2230

<a name="l02206"></a>02206 if (bitval != bitval_next)

2231

<a name="l02207"></a>02207 {

2232

<a name="l02208"></a>02208 *pcurr++ = bit_idx-1;

2233

<a name="l02209"></a>02209 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>((pcurr-1) == (dest+1) || *(pcurr-1) > *(pcurr-2));

2234

<a name="l02210"></a>02210 if (pcurr >= end)

2235

<a name="l02211"></a>02211 {

2236

<a name="l02212"></a>02212 return 0; // OUT of memory

2237

<a name="l02213"></a>02213 }

2238

<a name="l02214"></a>02214 bitval = bitval_next;

2239

<a name="l02215"></a>02215 }

2240

<a name="l02216"></a>02216 bit_idx += sizeof(*src) * 8;

2241

<a name="l02217"></a>02217 if (bit_idx >= bits)

2242

<a name="l02218"></a>02218 {

2243

<a name="l02219"></a>02219 goto complete;

2244

<a name="l02220"></a>02220 }

2245

<a name="l02221"></a>02221 ++src;

2246

<a name="l02222"></a>02222 val = *src;

2247

<a name="l02223"></a>02223 }

2248

<a name="l02224"></a>02224

2249

<a name="l02225"></a>02225

2250

<a name="l02226"></a>02226 register unsigned mask = 1;

2251

<a name="l02227"></a>02227 while (mask)

2252

<a name="l02228"></a>02228 {

2253

<a name="l02229"></a>02229 // Now plain bitshifting. Optimization wanted.

2254

<a name="l02230"></a>02230

2255

<a name="l02231"></a>02231 bitval_next = val & mask ? 1 : 0;

2256

<a name="l02232"></a>02232 if (bitval != bitval_next)

2257

<a name="l02233"></a>02233 {

2258

<a name="l02234"></a>02234 *pcurr++ = bit_idx-1;

2259

<a name="l02235"></a>02235 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>((pcurr-1) == (dest+1) || *(pcurr-1) > *(pcurr-2));

2260

<a name="l02236"></a>02236 bitval = bitval_next;

2261

<a name="l02237"></a>02237 if (pcurr >= end)

2262

<a name="l02238"></a>02238 {

2263

<a name="l02239"></a>02239 return 0; // OUT of memory

2264

<a name="l02240"></a>02240 }

2265

<a name="l02241"></a>02241 }

2266

<a name="l02242"></a>02242

2267

<a name="l02243"></a>02243 mask <<= 1;

2268

<a name="l02244"></a>02244 ++bit_idx;

2269

<a name="l02245"></a>02245

2270

<a name="l02246"></a>02246 } // while mask

2271

<a name="l02247"></a>02247

2272

<a name="l02248"></a>02248 if (bit_idx >= bits)

2273

<a name="l02249"></a>02249 {

2274

<a name="l02250"></a>02250 goto complete;

2275

<a name="l02251"></a>02251 }

2276

<a name="l02252"></a>02252

2277

<a name="l02253"></a>02253 ++src;

2278

<a name="l02254"></a>02254 val = *src;

2279

<a name="l02255"></a>02255

2280

<a name="l02256"></a>02256 } while(1);

2281

<a name="l02257"></a>02257

2282

<a name="l02258"></a>02258 complete:

2283

<a name="l02259"></a>02259 *pcurr = bit_idx-1;

2284

<a name="l02260"></a>02260 unsigned len = (unsigned)(pcurr - dest);

2285

<a name="l02261"></a>02261 *dest = (*dest & 7) + (len << 3);

2286

<a name="l02262"></a>02262 return len;

2287

<a name="l02263"></a>02263 }

2288

<a name="l02264"></a>02264

2289

<a name="l02265"></a>02265

2290

<a name="l02266"></a>02266 /*!

2291

<a name="l02267"></a>02267 \brief Convert gap block into array of ints corresponding to 1 bits

2292

<a name="l02268"></a>02268 @ingroup gapfunc

2293

<a name="l02269"></a>02269 */

2294

<a name="l02270"></a>02270 template<typename D, typename T>

2295

<a name="l02271"></a><a class="code" href="a00082.html#g3cc68fe9724e63403d15899bc17da3a1">02271</a> D <a class="code" href="a00082.html#g3cc68fe9724e63403d15899bc17da3a1" title="Convert gap block into array of ints corresponding to 1 bits.">gap_convert_to_arr</a>(D* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dest,

2296

<a name="l02272"></a>02272 const T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> buf,

2297

<a name="l02273"></a>02273 unsigned dest_len)

2298

<a name="l02274"></a>02274 {

2299

<a name="l02275"></a>02275 register const T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> pcurr = buf;

2300

<a name="l02276"></a>02276 register const T* pend = pcurr + (*pcurr >> 3);

2301

<a name="l02277"></a>02277

2302

<a name="l02278"></a>02278 D* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dest_curr = dest;

2303

<a name="l02279"></a>02279 ++pcurr;

2304

<a name="l02280"></a>02280

2305

<a name="l02281"></a>02281 if (*buf & 1)

2306

<a name="l02282"></a>02282 {

2307

<a name="l02283"></a>02283 if (unsigned(*pcurr + 1) >= dest_len)

2308

<a name="l02284"></a>02284 return 0; // insufficient space

2309

<a name="l02285"></a>02285 dest_len -= *pcurr;

2310

<a name="l02286"></a>02286 T to = *pcurr;

2311

<a name="l02287"></a>02287 for (T i = 0; ;++i)

2312

<a name="l02288"></a>02288 {

2313

<a name="l02289"></a>02289 *dest_curr++ = i;

2314

<a name="l02290"></a>02290 if (i == to) break;

2315

<a name="l02291"></a>02291 }

2316

<a name="l02292"></a>02292 ++pcurr;

2317

<a name="l02293"></a>02293 }

2318

<a name="l02294"></a>02294 ++pcurr; // set GAP to 1

2319

<a name="l02295"></a>02295

2320

<a name="l02296"></a>02296 while (pcurr <= pend)

2321

<a name="l02297"></a>02297 {

2322

<a name="l02298"></a>02298 unsigned pending = *pcurr - *(pcurr-1);

2323

<a name="l02299"></a>02299 if (pending >= dest_len)

2324

<a name="l02300"></a>02300 return 0;

2325

<a name="l02301"></a>02301 dest_len -= pending;

2326

<a name="l02302"></a>02302 T from = *(pcurr-1)+1;

2327

<a name="l02303"></a>02303 T to = *pcurr;

2328

<a name="l02304"></a>02304 for (T i = from; ;++i)

2329

<a name="l02305"></a>02305 {

2330

<a name="l02306"></a>02306 *dest_curr++ = i;

2331

<a name="l02307"></a>02307 if (i == to) break;

2332

<a name="l02308"></a>02308 }

2333

<a name="l02309"></a>02309 pcurr += 2; // jump to the next positive GAP

2334

<a name="l02310"></a>02310 }

2335

<a name="l02311"></a>02311 return (D) (dest_curr - dest);

2336

<a name="l02312"></a>02312 }

2337

<a name="l02313"></a>02313

2338

<a name="l02314"></a>02314 /*!

2339

<a name="l02315"></a>02315 \brief Convert bit block into an array of ints corresponding to 1 bits

2340

<a name="l02316"></a>02316 @ingroup bitfunc

2341

<a name="l02317"></a>02317 */

2342

<a name="l02318"></a><a class="code" href="a00083.html#g16a7495c47bdcd1b0c7208e29e40bb81">02318</a> template<typename T> T <a class="code" href="a00083.html#g16a7495c47bdcd1b0c7208e29e40bb81" title="Convert bit block into an array of ints corresponding to 1 bits.">bit_convert_to_arr</a>(T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dest,

2343

<a name="l02319"></a>02319 const unsigned* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src,

2344

<a name="l02320"></a>02320 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> bits,

2345

<a name="l02321"></a>02321 unsigned dest_len)

2346

<a name="l02322"></a>02322 {

2347

<a name="l02323"></a>02323 register T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> pcurr = dest;

2348

<a name="l02324"></a>02324 T* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> end = dest + dest_len;

2349

<a name="l02325"></a>02325 register unsigned bit_idx = 0;

2350

<a name="l02326"></a>02326

2351

<a name="l02327"></a>02327 do

2352

<a name="l02328"></a>02328 {

2353

<a name="l02329"></a>02329 register unsigned val = *src;

2354

<a name="l02330"></a>02330 // We can skip if *src == 0

2355

<a name="l02331"></a>02331

2356

<a name="l02332"></a>02332 while (val == 0)

2357

<a name="l02333"></a>02333 {

2358

<a name="l02334"></a>02334 bit_idx += sizeof(*src) * 8;

2359

<a name="l02335"></a>02335 if (bit_idx >= bits)

2360

<a name="l02336"></a>02336 {

2361

<a name="l02337"></a>02337 return (T)(pcurr - dest);

2362

<a name="l02338"></a>02338 }

2363

<a name="l02339"></a>02339 val = *(++src);

2364

<a name="l02340"></a>02340 }

2365

<a name="l02341"></a>02341

2366

<a name="l02342"></a>02342 if (pcurr + sizeof(val)*8 > end) // insufficient space

2367

<a name="l02343"></a>02343 {

2368

<a name="l02344"></a>02344 return 0;

2369

<a name="l02345"></a>02345 }

2370

<a name="l02346"></a>02346

2371

<a name="l02347"></a>02347 for (int i = 0; i < 32; i+=4)

2372

<a name="l02348"></a>02348 {

2373

<a name="l02349"></a>02349 if (val & 1)

2374

<a name="l02350"></a>02350 *pcurr++ = bit_idx;

2375

<a name="l02351"></a>02351 val >>= 1; ++bit_idx;

2376

<a name="l02352"></a>02352 if (val & 1)

2377

<a name="l02353"></a>02353 *pcurr++ = bit_idx;

2378

<a name="l02354"></a>02354 val >>= 1; ++bit_idx;

2379

<a name="l02355"></a>02355 if (val & 1)

2380

<a name="l02356"></a>02356 *pcurr++ = bit_idx;

2381

<a name="l02357"></a>02357 val >>= 1; ++bit_idx;

2382

<a name="l02358"></a>02358 if (val & 1)

2383

<a name="l02359"></a>02359 *pcurr++ = bit_idx;

2384

<a name="l02360"></a>02360 val >>= 1; ++bit_idx;

2385

<a name="l02361"></a>02361 }

2386

<a name="l02362"></a>02362 if (bits <= bit_idx)

2387

<a name="l02363"></a>02363 break;

2388

<a name="l02364"></a>02364

2389

<a name="l02365"></a>02365 val = *(++src);

2390

<a name="l02366"></a>02366

2391

<a name="l02367"></a>02367 } while (1);

2392

<a name="l02368"></a>02368

2393

<a name="l02369"></a>02369 return (T)(pcurr - dest);

2394

<a name="l02370"></a>02370 }

2395

<a name="l02371"></a>02371

2396

<a name="l02372"></a>02372

2397

<a name="l02373"></a>02373

2398

<a name="l02374"></a>02374 /*!

2399

<a name="l02375"></a>02375 @brief Bitcount for bit string

2400

<a name="l02376"></a>02376

2401

<a name="l02377"></a>02377 Function calculates number of 1 bits in the given array of words.

2402

<a name="l02378"></a>02378 Make sure the addresses are aligned.

2403

<a name="l02379"></a>02379

2404

<a name="l02380"></a>02380 @ingroup bitfunc

2405

<a name="l02381"></a>02381 */

2406

<a name="l02382"></a>02382 inline

2407

<a name="l02383"></a><a class="code" href="a00083.html#gb30df14a61f036d690c091878feaff1c">02383</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#gb30df14a61f036d690c091878feaff1c" title="Bitcount for bit string.">bit_block_calc_count</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* block,

2408

<a name="l02384"></a>02384 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* block_end)

2409

<a name="l02385"></a>02385 {

2410

<a name="l02386"></a>02386 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(block < block_end);

2411

<a name="l02387"></a>02387 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> count = 0;

2412

<a name="l02388"></a>02388

2413

<a name="l02389"></a>02389 #ifdef BM64OPT

2414

<a name="l02390"></a>02390

2415

<a name="l02391"></a>02391 // 64-bit optimized algorithm.

2416

<a name="l02392"></a>02392

2417

<a name="l02393"></a>02393 const <a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a>* b1 = (<a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a>*) block;

2418

<a name="l02394"></a>02394 const <a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a>* b2 = (<a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a>*) block_end;

2419

<a name="l02395"></a>02395

2420

<a name="l02396"></a>02396 <a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a> acc = *b1++; // accumulator (sparse vectors optimization)

2421

<a name="l02397"></a>02397

2422

<a name="l02398"></a>02398 do

2423

<a name="l02399"></a>02399 {

2424

<a name="l02400"></a>02400 <a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a> in = *b1++;

2425

<a name="l02401"></a>02401 <a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a> acc_prev = acc;

2426

<a name="l02402"></a>02402 acc |= in;

2427

<a name="l02403"></a>02403

2428

<a name="l02404"></a>02404 if (acc_prev &= in) // counting bits in accumulator

2429

<a name="l02405"></a>02405 {

2430

<a name="l02406"></a>02406 acc = (acc & 0x5555555555555555LU) + (acc >> 1 & 0x5555555555555555LU);

2431

<a name="l02407"></a>02407 acc = (acc & 0x3333333333333333LU) + (acc >> 2 & 0x3333333333333333LU);

2432

<a name="l02408"></a>02408 acc = acc + (acc >> 4) & 0x0F0F0F0F0F0F0F0FLU;

2433

<a name="l02409"></a>02409 acc = acc + (acc >> 8);

2434

<a name="l02410"></a>02410 acc = acc + (acc >> 16);

2435

<a name="l02411"></a>02411 acc = acc + (acc >> 32) & 0x0000007F;

2436

<a name="l02412"></a>02412 count += (unsigned)acc;

2437

<a name="l02413"></a>02413

2438

<a name="l02414"></a>02414 acc = acc_prev;

2439

<a name="l02415"></a>02415 }

2440

<a name="l02416"></a>02416 } while (b1 < b2);

2441

<a name="l02417"></a>02417 count += <a class="code" href="a00083.html#g6db64a80e9d66e4338c6cfdd38464d77">word_bitcount64</a>(acc); // count-in remaining accumulator

2442

<a name="l02418"></a>02418

2443

<a name="l02419"></a>02419 #else

2444

<a name="l02420"></a>02420 // For 32 bit code the fastest method is

2445

<a name="l02421"></a>02421 // to use bitcount table for each byte in the block.

2446

<a name="l02422"></a>02422 // As optimization for sparse bitsets used bits accumulator

2447

<a name="l02423"></a>02423 // to collect ON bits using bitwise OR.

2448

<a name="l02424"></a>02424 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> acc = *block++;

2449

<a name="l02425"></a>02425 do

2450

<a name="l02426"></a>02426 {

2451

<a name="l02427"></a>02427 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> in = *block++;

2452

<a name="l02428"></a>02428 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> acc_prev = acc;

2453

<a name="l02429"></a>02429 acc |= in;

2454

<a name="l02430"></a>02430 if (acc_prev &= in) // accumulator miss: counting bits

2455

<a name="l02431"></a>02431 {

2456

<a name="l02432"></a>02432 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, acc);

2457

<a name="l02433"></a>02433 acc = acc_prev;

2458

<a name="l02434"></a>02434 }

2459

<a name="l02435"></a>02435 } while (block < block_end);

2460

<a name="l02436"></a>02436

2461

<a name="l02437"></a>02437 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, acc); // count-in remaining accumulator

2462

<a name="l02438"></a>02438

2463

<a name="l02439"></a>02439 #endif

2464

<a name="l02440"></a>02440

2465

<a name="l02441"></a>02441 return count;

2466

<a name="l02442"></a>02442 }

2467

<a name="l02443"></a>02443

2468

<a name="l02444"></a>02444 /*!

2469

<a name="l02445"></a>02445 Function calculates number of times when bit value changed

2470

<a name="l02446"></a>02446 (1-0 or 0-1).

2471

<a name="l02447"></a>02447

2472

<a name="l02448"></a>02448 For 001 result is 2

2473

<a name="l02449"></a>02449 010 - 3

2474

<a name="l02450"></a>02450 011 - 2

2475

<a name="l02451"></a>02451 111 - 1

2476

<a name="l02452"></a>02452

2477

<a name="l02453"></a>02453 @ingroup bitfunc

2478

<a name="l02454"></a>02454 */

2479

<a name="l02455"></a>02455

2480

<a name="l02456"></a>02456 inline

2481

<a name="l02457"></a><a class="code" href="a00083.html#gafc87c4764bb30d95ba4088064a404e3">02457</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#gafc87c4764bb30d95ba4088064a404e3">bit_count_change</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> w)

2482

<a name="l02458"></a>02458 {

2483

<a name="l02459"></a>02459 unsigned count = 1;

2484

<a name="l02460"></a>02460 w ^= (w >> 1);

2485

<a name="l02461"></a>02461

2486

<a name="l02462"></a>02462 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, w);

2487

<a name="l02463"></a>02463 count -= (w >> ((sizeof(w) * 8) - 1));

2488

<a name="l02464"></a>02464 return count;

2489

<a name="l02465"></a>02465 }

2490

<a name="l02466"></a>02466

2491

<a name="l02467"></a>02467

2492

<a name="l02468"></a>02468 /*!

2493

<a name="l02469"></a>02469 Function calculates number of times when bit value changed

2494

<a name="l02470"></a>02470 (1-0 or 0-1) in the bit block.

2495

<a name="l02471"></a>02471

2496

<a name="l02472"></a>02472 @ingroup bitfunc

2497

<a name="l02473"></a>02473 */

2498

<a name="l02474"></a>02474 inline

2499

<a name="l02475"></a><a class="code" href="a00083.html#g3cdb8a2add8f7b95e5f77fdc172f19fe">02475</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g3cdb8a2add8f7b95e5f77fdc172f19fe">bit_block_calc_count_change</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* block,

2500

<a name="l02476"></a>02476 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* block_end)

2501

<a name="l02477"></a>02477 {

2502

<a name="l02478"></a>02478 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(block < block_end);

2503

<a name="l02479"></a>02479 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> count = 1;

2504

<a name="l02480"></a>02480

2505

<a name="l02481"></a>02481 #ifdef BM64OPT

2506

<a name="l02482"></a>02482

2507

<a name="l02483"></a>02483 // 64-bit optimized algorithm.

2508

<a name="l02484"></a>02484

2509

<a name="l02485"></a>02485 const <a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a>* b1 = (<a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a>*) block;

2510

<a name="l02486"></a>02486 const <a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a>* b2 = (<a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a>*) block_end;

2511

<a name="l02487"></a>02487

2512

<a name="l02488"></a>02488 <a class="code" href="a00078.html#1f6a6dd108cd9e9f4fb284043ef518fe">bm::id64_t</a> w, w0, w_prev, w_l;

2513

<a name="l02489"></a>02489 w = w0 = *b1;

2514

<a name="l02490"></a>02490 const int w_shift = sizeof(w) * 8 - 1;

2515

<a name="l02491"></a>02491 w ^= (w >> 1);

2516

<a name="l02492"></a>02492 count += <a class="code" href="a00083.html#g6db64a80e9d66e4338c6cfdd38464d77">word_bitcount64</a>(w);

2517

<a name="l02493"></a>02493 count -= (w_prev = (w0 >> w_shift)); // negative value correction

2518

<a name="l02494"></a>02494

2519

<a name="l02495"></a>02495 for (++b1 ;b1 < b2; ++b1)

2520

<a name="l02496"></a>02496 {

2521

<a name="l02497"></a>02497 w = w0 = *b1;

2522

<a name="l02498"></a>02498 ++count;

2523

<a name="l02499"></a>02499

2524

<a name="l02500"></a>02500 if (!w)

2525

<a name="l02501"></a>02501 {

2526

<a name="l02502"></a>02502 count -= !w_prev;

2527

<a name="l02503"></a>02503 w_prev = 0;

2528

<a name="l02504"></a>02504 }

2529

<a name="l02505"></a>02505 else

2530

<a name="l02506"></a>02506 {

2531

<a name="l02507"></a>02507 w ^= (w >> 1);

2532

<a name="l02508"></a>02508 count += <a class="code" href="a00083.html#g6db64a80e9d66e4338c6cfdd38464d77">word_bitcount64</a>(w);

2533

<a name="l02509"></a>02509

2534

<a name="l02510"></a>02510 w_l = w0 & 1;

2535

<a name="l02511"></a>02511 count -= (w0 >> w_shift); // negative value correction

2536

<a name="l02512"></a>02512 count -= !(w_prev ^ w_l); // word border correction

2537

<a name="l02513"></a>02513

2538

<a name="l02514"></a>02514 w_prev = (w0 >> w_shift);

2539

<a name="l02515"></a>02515 }

2540

<a name="l02516"></a>02516 } // for

2541

<a name="l02517"></a>02517

2542

<a name="l02518"></a>02518 #else

2543

<a name="l02519"></a>02519

2544

<a name="l02520"></a>02520 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> w, w0, w_prev, w_l;

2545

<a name="l02521"></a>02521

2546

<a name="l02522"></a>02522 w = w0 = *block;

2547

<a name="l02523"></a>02523 const int w_shift = sizeof(w) * 8 - 1;

2548

<a name="l02524"></a>02524 w ^= (w >> 1);

2549

<a name="l02525"></a>02525 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, w);

2550

<a name="l02526"></a>02526 count -= (w_prev = (w0 >> w_shift)); // negative value correction

2551

<a name="l02527"></a>02527

2552

<a name="l02528"></a>02528 for (++block ;block < block_end; ++block)

2553

<a name="l02529"></a>02529 {

2554

<a name="l02530"></a>02530 w = w0 = *block;

2555

<a name="l02531"></a>02531 ++count;

2556

<a name="l02532"></a>02532

2557

<a name="l02533"></a>02533 if (!w)

2558

<a name="l02534"></a>02534 {

2559

<a name="l02535"></a>02535 count -= !w_prev;

2560

<a name="l02536"></a>02536 w_prev = 0;

2561

<a name="l02537"></a>02537 }

2562

<a name="l02538"></a>02538 else

2563

<a name="l02539"></a>02539 {

2564

<a name="l02540"></a>02540 w ^= (w >> 1);

2565

<a name="l02541"></a>02541 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, w);

2566

<a name="l02542"></a>02542

2567

<a name="l02543"></a>02543 w_l = w0 & 1;

2568

<a name="l02544"></a>02544 count -= (w0 >> w_shift); // negative value correction

2569

<a name="l02545"></a>02545 count -= !(w_prev ^ w_l); // word border correction

2570

<a name="l02546"></a>02546

2571

<a name="l02547"></a>02547 w_prev = (w0 >> w_shift);

2572

<a name="l02548"></a>02548 }

2573

<a name="l02549"></a>02549 } // for

2574

<a name="l02550"></a>02550 #endif

2575

<a name="l02551"></a>02551 return count;

2576

<a name="l02552"></a>02552 }

2577

<a name="l02553"></a>02553

2578

<a name="l02554"></a>02554

2579

<a name="l02555"></a>02555 /*!

2580

<a name="l02556"></a>02556 Function calculates number of 1 bits in the given array of words in

2581

<a name="l02557"></a>02557 the range between left anf right bits (borders included)

2582

<a name="l02558"></a>02558 Make sure the addresses are aligned.

2583

<a name="l02559"></a>02559

2584

<a name="l02560"></a>02560 @ingroup bitfunc

2585

<a name="l02561"></a>02561 */

2586

<a name="l02562"></a>02562 inline

2587

<a name="l02563"></a><a class="code" href="a00083.html#g2485f707b2629c5ce7681cf9fe385b91">02563</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g2485f707b2629c5ce7681cf9fe385b91">bit_block_calc_count_range</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* block,

2588

<a name="l02564"></a>02564 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> left,

2589

<a name="l02565"></a>02565 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> right)

2590

<a name="l02566"></a>02566 {

2591

<a name="l02567"></a>02567 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(left <= right);

2592

<a name="l02568"></a>02568

2593

<a name="l02569"></a>02569 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> count = 0;

2594

<a name="l02570"></a>02570

2595

<a name="l02571"></a>02571 unsigned nbit = left; // unsigned(left & bm::set_block_mask);

2596

<a name="l02572"></a>02572 unsigned nword = unsigned(nbit >> <a class="code" href="a00078.html#83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>);

2597

<a name="l02573"></a>02573 nbit &= <a class="code" href="a00078.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>;

2598

<a name="l02574"></a>02574

2599

<a name="l02575"></a>02575 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* word = block + nword;

2600

<a name="l02576"></a>02576

2601

<a name="l02577"></a>02577 if (left == right) // special case (only 1 bit to check)

2602

<a name="l02578"></a>02578 {

2603

<a name="l02579"></a>02579 return (*word >> nbit) & 1;

2604

<a name="l02580"></a>02580 }

2605

<a name="l02581"></a>02581 unsigned acc;

2606

<a name="l02582"></a>02582 unsigned bitcount = right - left + 1;

2607

<a name="l02583"></a>02583

2608

<a name="l02584"></a>02584 if (nbit) // starting position is not aligned

2609

<a name="l02585"></a>02585 {

2610

<a name="l02586"></a>02586 unsigned right_margin = nbit + (right - left);

2611

<a name="l02587"></a>02587

2612

<a name="l02588"></a>02588 if (right_margin < 32)

2613

<a name="l02589"></a>02589 {

2614

<a name="l02590"></a>02590 unsigned mask =

2615

<a name="l02591"></a>02591 <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_right</a>[nbit] &

2616

<a name="l02592"></a>02592 <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_left</a>[right_margin];

2617

<a name="l02593"></a>02593 acc = *word & mask;

2618

<a name="l02594"></a>02594

2619

<a name="l02595"></a>02595 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, acc);

2620

<a name="l02596"></a>02596 return count;

2621

<a name="l02597"></a>02597 }

2622

<a name="l02598"></a>02598 else

2623

<a name="l02599"></a>02599 {

2624

<a name="l02600"></a>02600 acc = *word & <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_right</a>[nbit];

2625

<a name="l02601"></a>02601 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, acc);

2626

<a name="l02602"></a>02602 bitcount -= 32 - nbit;

2627

<a name="l02603"></a>02603 }

2628

<a name="l02604"></a>02604 ++word;

2629

<a name="l02605"></a>02605 }

2630

<a name="l02606"></a>02606

2631

<a name="l02607"></a>02607 // now when we are word aligned, we can count bits the usual way

2632

<a name="l02608"></a>02608 for ( ;bitcount >= 32; bitcount -= 32)

2633

<a name="l02609"></a>02609 {

2634

<a name="l02610"></a>02610 acc = *word++;

2635

<a name="l02611"></a>02611 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, acc);

2636

<a name="l02612"></a>02612 }

2637

<a name="l02613"></a>02613

2638

<a name="l02614"></a>02614 if (bitcount) // we have a tail to count

2639

<a name="l02615"></a>02615 {

2640

<a name="l02616"></a>02616 acc = (*word) & <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_left</a>[bitcount-1];

2641

<a name="l02617"></a>02617 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, acc);

2642

<a name="l02618"></a>02618 }

2643

<a name="l02619"></a>02619

2644

<a name="l02620"></a>02620 return count;

2645

<a name="l02621"></a>02621 }

2646

<a name="l02622"></a>02622

2647

<a name="l02623"></a>02623

2648

<a name="l02624"></a>02624 /*!

2649

<a name="l02625"></a>02625 Function calculates if there is any number of 1 bits

2650

<a name="l02626"></a>02626 in the given array of words in the range between left anf right bits

2651

<a name="l02627"></a>02627 (borders included). Make sure the addresses are aligned.

2652

<a name="l02628"></a>02628

2653

<a name="l02629"></a>02629 @ingroup bitfunc

2654

<a name="l02630"></a>02630 */

2655

<a name="l02631"></a>02631 inline

2656

<a name="l02632"></a><a class="code" href="a00083.html#g503e0f3e79f819d9b58e4b0e905be116">02632</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g503e0f3e79f819d9b58e4b0e905be116">bit_block_any_range</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* block,

2657

<a name="l02633"></a>02633 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> left,

2658

<a name="l02634"></a>02634 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> right)

2659

<a name="l02635"></a>02635 {

2660

<a name="l02636"></a>02636 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(left <= right);

2661

<a name="l02637"></a>02637

2662

<a name="l02638"></a>02638 unsigned nbit = left; // unsigned(left & bm::set_block_mask);

2663

<a name="l02639"></a>02639 unsigned nword = unsigned(nbit >> <a class="code" href="a00078.html#83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>);

2664

<a name="l02640"></a>02640 nbit &= <a class="code" href="a00078.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>;

2665

<a name="l02641"></a>02641

2666

<a name="l02642"></a>02642 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* word = block + nword;

2667

<a name="l02643"></a>02643

2668

<a name="l02644"></a>02644 if (left == right) // special case (only 1 bit to check)

2669

<a name="l02645"></a>02645 {

2670

<a name="l02646"></a>02646 return (*word >> nbit) & 1;

2671

<a name="l02647"></a>02647 }

2672

<a name="l02648"></a>02648 unsigned acc;

2673

<a name="l02649"></a>02649 unsigned bitcount = right - left + 1;

2674

<a name="l02650"></a>02650

2675

<a name="l02651"></a>02651 if (nbit) // starting position is not aligned

2676

<a name="l02652"></a>02652 {

2677

<a name="l02653"></a>02653 unsigned right_margin = nbit + (right - left);

2678

<a name="l02654"></a>02654 if (right_margin < 32)

2679

<a name="l02655"></a>02655 {

2680

<a name="l02656"></a>02656 unsigned mask =

2681

<a name="l02657"></a>02657 <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_right</a>[nbit] &

2682

<a name="l02658"></a>02658 <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_left</a>[right_margin];

2683

<a name="l02659"></a>02659 acc = *word & mask;

2684

<a name="l02660"></a>02660 return acc;

2685

<a name="l02661"></a>02661 }

2686

<a name="l02662"></a>02662 else

2687

<a name="l02663"></a>02663 {

2688

<a name="l02664"></a>02664 acc = *word & <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_right</a>[nbit];

2689

<a name="l02665"></a>02665 if (acc)

2690

<a name="l02666"></a>02666 return acc;

2691

<a name="l02667"></a>02667 bitcount -= 32 - nbit;

2692

<a name="l02668"></a>02668 }

2693

<a name="l02669"></a>02669 ++word;

2694

<a name="l02670"></a>02670 }

2695

<a name="l02671"></a>02671

2696

<a name="l02672"></a>02672 // now when we are word aligned, we can check bits the usual way

2697

<a name="l02673"></a>02673 for ( ;bitcount >= 32; bitcount -= 32)

2698

<a name="l02674"></a>02674 {

2699

<a name="l02675"></a>02675 acc = *word++;

2700

<a name="l02676"></a>02676 if (acc)

2701

<a name="l02677"></a>02677 return acc;

2702

<a name="l02678"></a>02678 }

2703

<a name="l02679"></a>02679

2704

<a name="l02680"></a>02680 if (bitcount) // we have a tail to count

2705

<a name="l02681"></a>02681 {

2706

<a name="l02682"></a>02682 acc = (*word) & <a class="code" href="a00032.html" title="Structure keeps all-left/right ON bits masks.">block_set_table<true>::_left</a>[bitcount-1];

2707

<a name="l02683"></a>02683 if (acc)

2708

<a name="l02684"></a>02684 return acc;

2709

<a name="l02685"></a>02685 }

2710

<a name="l02686"></a>02686

2711

<a name="l02687"></a>02687 return 0;

2712

<a name="l02688"></a>02688 }

2713

<a name="l02689"></a>02689

2714

<a name="l02690"></a>02690

2715

<a name="l02691"></a>02691

2716

<a name="l02692"></a>02692 // ----------------------------------------------------------------------

2717

<a name="l02693"></a>02693

2718

<a name="l02694"></a>02694 /*! Function inverts block of bits

2719

<a name="l02695"></a>02695 @ingroup bitfunc

2720

<a name="l02696"></a>02696 */

2721

<a name="l02697"></a><a class="code" href="a00083.html#g95854f9969985254a0f58b928da0eec6">02697</a> template<typename T> void <a class="code" href="a00083.html#g95854f9969985254a0f58b928da0eec6">bit_invert</a>(T* start, T* end)

2722

<a name="l02698"></a>02698 {

2723

<a name="l02699"></a>02699 #ifdef BMVECTOPT

2724

<a name="l02700"></a>02700 <a class="code" href="a00065.html#a31c7d6d7d4cd67e1cc86c08221446ce">VECT_INVERT_ARR</a>(start, end);

2725

<a name="l02701"></a>02701 #else

2726

<a name="l02702"></a>02702 do

2727

<a name="l02703"></a>02703 {

2728

<a name="l02704"></a>02704 start[0] = ~start[0];

2729

<a name="l02705"></a>02705 start[1] = ~start[1];

2730

<a name="l02706"></a>02706 start[2] = ~start[2];

2731

<a name="l02707"></a>02707 start[3] = ~start[3];

2732

<a name="l02708"></a>02708 start+=4;

2733

<a name="l02709"></a>02709 } while (start < end);

2734

<a name="l02710"></a>02710 #endif

2735

<a name="l02711"></a>02711 }

2736

<a name="l02712"></a>02712

2737

<a name="l02713"></a>02713 // ----------------------------------------------------------------------

2738

<a name="l02714"></a>02714

2739

<a name="l02715"></a>02715 /*! @brief Returns "true" if all bits in the block are 1

2740

<a name="l02716"></a>02716 @ingroup bitfunc

2741

<a name="l02717"></a>02717 */

2742

<a name="l02718"></a><a class="code" href="a00083.html#g97b1075250d4bf10f596ff2fbc334ceb">02718</a> inline bool <a class="code" href="a00083.html#g97b1075250d4bf10f596ff2fbc334ceb" title="Returns &quot;true&quot; if all bits in the block are 1.">is_bits_one</a>(const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* start,

2743

<a name="l02719"></a>02719 const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* end)

2744

<a name="l02720"></a>02720 {

2745

<a name="l02721"></a>02721 do

2746

<a name="l02722"></a>02722 {

2747

<a name="l02723"></a>02723 <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a> tmp =

2748

<a name="l02724"></a>02724 start[0] & start[1] & start[2] & start[3];

2749

<a name="l02725"></a>02725 if (tmp != <a class="code" href="a00078.html#095e72da3086d98dac9724b11b478235">bm::all_bits_mask</a>)

2750

<a name="l02726"></a>02726 return false;

2751

<a name="l02727"></a>02727 start += 4;

2752

<a name="l02728"></a>02728 } while (start < end);

2753

<a name="l02729"></a>02729

2754

<a name="l02730"></a>02730 return true;

2755

<a name="l02731"></a>02731 }

2756

<a name="l02732"></a>02732

2757

<a name="l02733"></a>02733 // ----------------------------------------------------------------------

2758

<a name="l02734"></a>02734

2759

<a name="l02735"></a>02735

2760

<a name="l02736"></a>02736 /*! @brief Returns "true" if all bits in the block are 0

2761

<a name="l02737"></a>02737 @ingroup bitfunc

2762

<a name="l02738"></a>02738 */

2763

<a name="l02739"></a><a class="code" href="a00083.html#gc6cfb9f92e4df6bb4c76f6efb2382860">02739</a> inline bool <a class="code" href="a00083.html#gc6cfb9f92e4df6bb4c76f6efb2382860" title="Returns &quot;true&quot; if all bits in the block are 0.">bit_is_all_zero</a>(const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* start,

2764

<a name="l02740"></a>02740 const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* end)

2765

<a name="l02741"></a>02741 {

2766

<a name="l02742"></a>02742 do

2767

<a name="l02743"></a>02743 {

2768

<a name="l02744"></a>02744 <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a> tmp =

2769

<a name="l02745"></a>02745 start[0] | start[1] | start[2] | start[3];

2770

<a name="l02746"></a>02746 if (tmp)

2771

<a name="l02747"></a>02747 return false;

2772

<a name="l02748"></a>02748 start += 4;

2773

<a name="l02749"></a>02749 } while (start < end);

2774

<a name="l02750"></a>02750

2775

<a name="l02751"></a>02751 return true;

2776

<a name="l02752"></a>02752 }

2777

<a name="l02753"></a>02753

2778

<a name="l02754"></a>02754 // ----------------------------------------------------------------------

2779

<a name="l02755"></a>02755

2780

<a name="l02756"></a>02756 // GAP blocks manipulation functions:

2781

<a name="l02757"></a>02757

2782

<a name="l02758"></a>02758 /*! \brief GAP and functor */

2783

<a name="l02759"></a><a class="code" href="a00078.html#e081940471455763a912a94783833316">02759</a> inline unsigned <a class="code" href="a00078.html#e081940471455763a912a94783833316" title="GAP and functor.">and_op</a>(unsigned v1, unsigned v2)

2784

<a name="l02760"></a>02760 {

2785

<a name="l02761"></a>02761 return v1 & v2;

2786

<a name="l02762"></a>02762 }

2787

<a name="l02763"></a>02763

2788

<a name="l02764"></a>02764

2789

<a name="l02765"></a>02765 /*! \brief GAP xor functor */

2790

<a name="l02766"></a><a class="code" href="a00078.html#2e0675b3474db845b3d5910ce81e6868">02766</a> inline unsigned <a class="code" href="a00078.html#2e0675b3474db845b3d5910ce81e6868" title="GAP xor functor.">xor_op</a>(unsigned v1, unsigned v2)

2791

<a name="l02767"></a>02767 {

2792

<a name="l02768"></a>02768 return v1 ^ v2;

2793

<a name="l02769"></a>02769 }

2794

<a name="l02770"></a>02770

2795

<a name="l02771"></a>02771

2796

<a name="l02772"></a>02772 /*!

2797

<a name="l02773"></a>02773 \brief GAP AND operation.

2798

<a name="l02774"></a>02774

2799

<a name="l02775"></a>02775 Function performs AND logical oparation on gap vectors.

2800

<a name="l02776"></a>02776 If possible function put the result into vect1 and returns this

2801

<a name="l02777"></a>02777 pointer. Otherwise result is put into tmp_buf, which should be

2802

<a name="l02778"></a>02778 twice of the vector size.

2803

<a name="l02779"></a>02779

2804

<a name="l02780"></a>02780 \param vect1 - operand 1

2805

<a name="l02781"></a>02781 \param vect2 - operand 2

2806

<a name="l02782"></a>02782 \param tmp_buf - pointer on temporary buffer

2807

<a name="l02783"></a>02783 \return Result pointer (tmp_buf OR vect1)

2808

<a name="l02784"></a>02784

2809

<a name="l02785"></a>02785 @ingroup gapfunc

2810

<a name="l02786"></a>02786 */

2811

<a name="l02787"></a><a class="code" href="a00082.html#g85662839207d06d07ae026c72b1f01c2">02787</a> inline <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00082.html#g85662839207d06d07ae026c72b1f01c2" title="GAP AND operation.">gap_operation_and</a>(const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect1,

2812

<a name="l02788"></a>02788 const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect2,

2813

<a name="l02789"></a>02789 <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> tmp_buf)

2814

<a name="l02790"></a>02790 {

2815

<a name="l02791"></a>02791 <a class="code" href="a00082.html#g871d779996e976755140eb7dc1553e23" title="Abstract operation for GAP buffers. Receives functor F as a template argument.">gap_buff_op</a>(tmp_buf, vect1, 0, vect2, 0, <a class="code" href="a00078.html#e081940471455763a912a94783833316" title="GAP and functor.">and_op</a>);

2816

<a name="l02792"></a>02792

2817

<a name="l02793"></a>02793 return tmp_buf;

2818

<a name="l02794"></a>02794 }

2819

<a name="l02795"></a>02795

2820

<a name="l02796"></a>02796 /*!

2821

<a name="l02797"></a>02797 \brief GAP AND operation test.

2822

<a name="l02798"></a>02798

2823

<a name="l02799"></a>02799 Function performs AND logical oparation on gap vectors.

2824

<a name="l02800"></a>02800 If possible function put the result into vect1 and returns this

2825

<a name="l02801"></a>02801 pointer. Otherwise result is put into tmp_buf, which should be

2826

<a name="l02802"></a>02802 twice of the vector size.

2827

<a name="l02803"></a>02803

2828

<a name="l02804"></a>02804 \param vect1 - operand 1

2829

<a name="l02805"></a>02805 \param vect2 - operand 2

2830

<a name="l02806"></a>02806 \return non zero value if operation returns any 1 bit

2831

<a name="l02807"></a>02807

2832

<a name="l02808"></a>02808 @ingroup gapfunc

2833

<a name="l02809"></a>02809 */

2834

<a name="l02810"></a><a class="code" href="a00082.html#gfb24a1e2588c5670df6facc537594d9d">02810</a> inline unsigned <a class="code" href="a00082.html#gfb24a1e2588c5670df6facc537594d9d" title="GAP AND operation test.">gap_operation_any_and</a>(const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect1,

2835

<a name="l02811"></a>02811 const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect2)

2836

<a name="l02812"></a>02812 {

2837

<a name="l02813"></a>02813 return <a class="code" href="a00082.html#g5e3123c3c9d3587f470abdbe6c8c3ad3" title="Abstract distance test operation for GAP buffers. Receives functor F as a template...">gap_buff_any_op</a>(vect1, 0, vect2, 0, <a class="code" href="a00078.html#e081940471455763a912a94783833316" title="GAP and functor.">and_op</a>);

2838

<a name="l02814"></a>02814 }

2839

<a name="l02815"></a>02815

2840

<a name="l02816"></a>02816

2841

<a name="l02817"></a>02817

2842

<a name="l02818"></a>02818 /*!

2843

<a name="l02819"></a>02819 \brief GAP XOR operation.

2844

<a name="l02820"></a>02820

2845

<a name="l02821"></a>02821 Function performs XOR logical oparation on gap vectors.

2846

<a name="l02822"></a>02822 If possible function put the result into vect1 and returns this

2847

<a name="l02823"></a>02823 pointer. Otherwise result is put into tmp_buf, which should be

2848

<a name="l02824"></a>02824 twice of the vector size.

2849

<a name="l02825"></a>02825

2850

<a name="l02826"></a>02826 \param vect1 - operand 1

2851

<a name="l02827"></a>02827 \param vect2 - operand 2

2852

<a name="l02828"></a>02828 \param tmp_buf - pointer on temporary buffer

2853

<a name="l02829"></a>02829 \return Result pointer (tmp_buf)

2854

<a name="l02830"></a>02830

2855

<a name="l02831"></a>02831 @ingroup gapfunc

2856

<a name="l02832"></a>02832 */

2857

<a name="l02833"></a><a class="code" href="a00082.html#g77553da699f68743fb12ebc6f6b0e477">02833</a> inline <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00082.html#g77553da699f68743fb12ebc6f6b0e477" title="GAP XOR operation.">gap_operation_xor</a>(const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect1,

2858

<a name="l02834"></a>02834 const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect2,

2859

<a name="l02835"></a>02835 <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> tmp_buf)

2860

<a name="l02836"></a>02836 {

2861

<a name="l02837"></a>02837 <a class="code" href="a00082.html#g871d779996e976755140eb7dc1553e23" title="Abstract operation for GAP buffers. Receives functor F as a template argument.">gap_buff_op</a>(tmp_buf, vect1, 0, vect2, 0, <a class="code" href="a00078.html#2e0675b3474db845b3d5910ce81e6868" title="GAP xor functor.">xor_op</a>);

2862

<a name="l02838"></a>02838 return tmp_buf;

2863

<a name="l02839"></a>02839 }

2864

<a name="l02840"></a>02840

2865

<a name="l02841"></a>02841

2866

<a name="l02842"></a>02842 /*!

2867

<a name="l02843"></a>02843 \brief GAP XOR operation test.

2868

<a name="l02844"></a>02844

2869

<a name="l02845"></a>02845 Function performs AND logical oparation on gap vectors.

2870

<a name="l02846"></a>02846 If possible function put the result into vect1 and returns this

2871

<a name="l02847"></a>02847 pointer. Otherwise result is put into tmp_buf, which should be

2872

<a name="l02848"></a>02848 twice of the vector size.

2873

<a name="l02849"></a>02849

2874

<a name="l02850"></a>02850 \param vect1 - operand 1

2875

<a name="l02851"></a>02851 \param vect2 - operand 2

2876

<a name="l02852"></a>02852 \return non zero value if operation returns any 1 bit

2877

<a name="l02853"></a>02853

2878

<a name="l02854"></a>02854 @ingroup gapfunc

2879

<a name="l02855"></a>02855 */

2880

<a name="l02856"></a><a class="code" href="a00082.html#gb46833bf0d7813f868a1608f70db12de">02856</a> inline unsigned <a class="code" href="a00082.html#gb46833bf0d7813f868a1608f70db12de" title="GAP XOR operation test.">gap_operation_any_xor</a>(const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect1,

2881

<a name="l02857"></a>02857 const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect2)

2882

<a name="l02858"></a>02858 {

2883

<a name="l02859"></a>02859 return <a class="code" href="a00082.html#g5e3123c3c9d3587f470abdbe6c8c3ad3" title="Abstract distance test operation for GAP buffers. Receives functor F as a template...">gap_buff_any_op</a>(vect1, 0, vect2, 0, <a class="code" href="a00078.html#2e0675b3474db845b3d5910ce81e6868" title="GAP xor functor.">xor_op</a>);

2884

<a name="l02860"></a>02860 }

2885

<a name="l02861"></a>02861

2886

<a name="l02862"></a>02862

2887

<a name="l02863"></a>02863

2888

<a name="l02864"></a>02864 /*!

2889

<a name="l02865"></a>02865 \brief GAP OR operation.

2890

<a name="l02866"></a>02866

2891

<a name="l02867"></a>02867 Function performs OR logical oparation on gap vectors.

2892

<a name="l02868"></a>02868 If possible function put the result into vect1 and returns this

2893

<a name="l02869"></a>02869 pointer. Otherwise result is put into tmp_buf, which should be

2894

<a name="l02870"></a>02870 twice of the vector size.

2895

<a name="l02871"></a>02871

2896

<a name="l02872"></a>02872 \param vect1 - operand 1

2897

<a name="l02873"></a>02873 \param vect2 - operand 2

2898

<a name="l02874"></a>02874 \param tmp_buf - pointer on temporary buffer

2899

<a name="l02875"></a>02875 \return Result pointer (tmp_buf)

2900

<a name="l02876"></a>02876

2901

<a name="l02877"></a>02877 @ingroup gapfunc

2902

<a name="l02878"></a>02878 */

2903

<a name="l02879"></a><a class="code" href="a00082.html#g9f62f1af74e44064f7407ec897b1b0b4">02879</a> inline <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00082.html#g9f62f1af74e44064f7407ec897b1b0b4" title="GAP OR operation.">gap_operation_or</a>(const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect1,

2904

<a name="l02880"></a>02880 const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect2,

2905

<a name="l02881"></a>02881 <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> tmp_buf)

2906

<a name="l02882"></a>02882 {

2907

<a name="l02883"></a>02883 <a class="code" href="a00082.html#g871d779996e976755140eb7dc1553e23" title="Abstract operation for GAP buffers. Receives functor F as a template argument.">gap_buff_op</a>(tmp_buf, vect1, 1, vect2, 1, <a class="code" href="a00078.html#e081940471455763a912a94783833316" title="GAP and functor.">and_op</a>);

2908

<a name="l02884"></a>02884 <a class="code" href="a00082.html#g3f22bfde5dfe06d6d77dc2598b8c0845" title="Inverts all bits in the GAP buffer.">gap_invert</a>(tmp_buf);

2909

<a name="l02885"></a>02885 return tmp_buf;

2910

<a name="l02886"></a>02886 }

2911

<a name="l02887"></a>02887

2912

<a name="l02888"></a>02888

2913

<a name="l02889"></a>02889

2914

<a name="l02890"></a>02890

2915

<a name="l02891"></a>02891 /*!

2916

<a name="l02892"></a>02892 \brief GAP SUB (AND NOT) operation.

2917

<a name="l02893"></a>02893

2918

<a name="l02894"></a>02894 Function performs SUB logical oparation on gap vectors.

2919

<a name="l02895"></a>02895 If possible function put the result into vect1 and returns this

2920

<a name="l02896"></a>02896 pointer. Otherwise result is put into tmp_buf, which should be

2921

<a name="l02897"></a>02897 twice of the vector size.

2922

<a name="l02898"></a>02898

2923

<a name="l02899"></a>02899 \param vect1 - operand 1

2924

<a name="l02900"></a>02900 \param vect2 - operand 2

2925

<a name="l02901"></a>02901 \param tmp_buf - pointer on temporary buffer

2926

<a name="l02902"></a>02902 \return Result pointer (tmp_buf)

2927

<a name="l02903"></a>02903

2928

<a name="l02904"></a>02904 @ingroup gapfunc

2929

<a name="l02905"></a>02905 */

2930

<a name="l02906"></a><a class="code" href="a00082.html#g0dcdf6a933f8f8bf901e258266a67c5f">02906</a> inline <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00082.html#g0dcdf6a933f8f8bf901e258266a67c5f" title="GAP SUB (AND NOT) operation.">gap_operation_sub</a>(const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect1,

2931

<a name="l02907"></a>02907 const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect2,

2932

<a name="l02908"></a>02908 <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> tmp_buf)

2933

<a name="l02909"></a>02909 {

2934

<a name="l02910"></a>02910 <a class="code" href="a00082.html#g871d779996e976755140eb7dc1553e23" title="Abstract operation for GAP buffers. Receives functor F as a template argument.">gap_buff_op</a>(tmp_buf, vect1, 0, vect2, 1, <a class="code" href="a00078.html#e081940471455763a912a94783833316" title="GAP and functor.">and_op</a>);

2935

<a name="l02911"></a>02911 return tmp_buf;

2936

<a name="l02912"></a>02912 }

2937

<a name="l02913"></a>02913

2938

<a name="l02914"></a>02914

2939

<a name="l02915"></a>02915 /*!

2940

<a name="l02916"></a>02916 \brief GAP SUB operation test.

2941

<a name="l02917"></a>02917

2942

<a name="l02918"></a>02918 Function performs AND logical oparation on gap vectors.

2943

<a name="l02919"></a>02919 If possible function put the result into vect1 and returns this

2944

<a name="l02920"></a>02920 pointer. Otherwise result is put into tmp_buf, which should be

2945

<a name="l02921"></a>02921 twice of the vector size.

2946

<a name="l02922"></a>02922

2947

<a name="l02923"></a>02923 \param vect1 - operand 1

2948

<a name="l02924"></a>02924 \param vect2 - operand 2

2949

<a name="l02925"></a>02925 \return non zero value if operation returns any 1 bit

2950

<a name="l02926"></a>02926

2951

<a name="l02927"></a>02927 @ingroup gapfunc

2952

<a name="l02928"></a>02928 */

2953

<a name="l02929"></a><a class="code" href="a00082.html#ge0b1d4aca0ddfa58d83e4b089a4f35d9">02929</a> inline unsigned <a class="code" href="a00082.html#ge0b1d4aca0ddfa58d83e4b089a4f35d9" title="GAP SUB operation test.">gap_operation_any_sub</a>(const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect1,

2954

<a name="l02930"></a>02930 const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> vect2)

2955

<a name="l02931"></a>02931 {

2956

<a name="l02932"></a>02932 return <a class="code" href="a00082.html#g5e3123c3c9d3587f470abdbe6c8c3ad3" title="Abstract distance test operation for GAP buffers. Receives functor F as a template...">gap_buff_any_op</a>(vect1, 0, vect2, 1, <a class="code" href="a00078.html#e081940471455763a912a94783833316" title="GAP and functor.">and_op</a>);

2957

<a name="l02933"></a>02933 }

2958

<a name="l02934"></a>02934

2959

<a name="l02935"></a>02935

2960

<a name="l02936"></a>02936 // ----------------------------------------------------------------------

2961

<a name="l02937"></a>02937

2962

<a name="l02938"></a>02938 // BIT blocks manipulation functions:

2963

<a name="l02939"></a>02939

2964

<a name="l02940"></a>02940

2965

<a name="l02941"></a>02941 /*!

2966

<a name="l02942"></a>02942 \brief Bitblock copy operation.

2967

<a name="l02943"></a>02943

2968

<a name="l02944"></a>02944 \param dst - destination block.

2969

<a name="l02945"></a>02945 \param src - source block.

2970

<a name="l02946"></a>02946

2971

<a name="l02947"></a>02947 @ingroup bitfunc

2972

<a name="l02948"></a>02948 */

2973

<a name="l02949"></a>02949 inline

2974

<a name="l02950"></a><a class="code" href="a00083.html#g9090de87d53e7f25eff96c8259b3485c">02950</a> void <a class="code" href="a00083.html#g9090de87d53e7f25eff96c8259b3485c" title="Bitblock copy operation.">bit_block_copy</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst, const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src)

2975

<a name="l02951"></a>02951 {

2976

<a name="l02952"></a>02952 #ifdef BMVECTOPT

2977

<a name="l02953"></a>02953 <a class="code" href="a00065.html#72b713f259e0542169a1228bebadcede">VECT_COPY_BLOCK</a>(dst, src, src + <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

2978

<a name="l02954"></a>02954 #else

2979

<a name="l02955"></a>02955 ::memcpy(dst, src, <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a> * sizeof(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>));

2980

<a name="l02956"></a>02956 #endif

2981

<a name="l02957"></a>02957 }

2982

<a name="l02958"></a>02958

2983

<a name="l02959"></a>02959

2984

<a name="l02960"></a>02960 /*!

2985

<a name="l02961"></a>02961 \brief Plain bitblock AND operation.

2986

<a name="l02962"></a>02962 Function does not analyse availability of source and destination blocks.

2987

<a name="l02963"></a>02963

2988

<a name="l02964"></a>02964 \param dst - destination block.

2989

<a name="l02965"></a>02965 \param src - source block.

2990

<a name="l02966"></a>02966

2991

<a name="l02967"></a>02967 @ingroup bitfunc

2992

<a name="l02968"></a>02968 */

2993

<a name="l02969"></a>02969 inline

2994

<a name="l02970"></a><a class="code" href="a00083.html#g882f79df0a0175ad4ddf483c5f1eeb0e">02970</a> void <a class="code" href="a00083.html#g882f79df0a0175ad4ddf483c5f1eeb0e" title="Plain bitblock AND operation. Function does not analyse availability of source and...">bit_block_and</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst, const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src)

2995

<a name="l02971"></a>02971 {

2996

<a name="l02972"></a>02972 #ifdef BMVECTOPT

2997

<a name="l02973"></a>02973 <a class="code" href="a00065.html#a6a3504bb5449abf6f5ec084b2ddfac6">VECT_AND_ARR</a>(dst, src, src + <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

2998

<a name="l02974"></a>02974 #else

2999

<a name="l02975"></a>02975 const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> wrd_ptr = (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*)src;

3000

<a name="l02976"></a>02976 const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> wrd_end = (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*)(src + <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

3001

<a name="l02977"></a>02977 <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst_ptr = (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*)dst;

3002

<a name="l02978"></a>02978

3003

<a name="l02979"></a>02979 do

3004

<a name="l02980"></a>02980 {

3005

<a name="l02981"></a>02981 dst_ptr[0] &= wrd_ptr[0];

3006

<a name="l02982"></a>02982 dst_ptr[1] &= wrd_ptr[1];

3007

<a name="l02983"></a>02983 dst_ptr[2] &= wrd_ptr[2];

3008

<a name="l02984"></a>02984 dst_ptr[3] &= wrd_ptr[3];

3009

<a name="l02985"></a>02985

3010

<a name="l02986"></a>02986 dst_ptr+=4;

3011

<a name="l02987"></a>02987 wrd_ptr+=4;

3012

<a name="l02988"></a>02988 } while (wrd_ptr < wrd_end);

3013

<a name="l02989"></a>02989 #endif

3014

<a name="l02990"></a>02990 }

3015

<a name="l02991"></a>02991

3016

<a name="l02992"></a>02992

3017

<a name="l02993"></a>02993 /*!

3018

<a name="l02994"></a>02994 \brief Function ANDs two bitblocks and computes the bitcount.

3019

<a name="l02995"></a>02995 Function does not analyse availability of source blocks.

3020

<a name="l02996"></a>02996

3021

<a name="l02997"></a>02997 \param src1 - first bit block

3022

<a name="l02998"></a>02998 \param src1_end - first bit block end

3023

<a name="l02999"></a>02999 \param src2 - second bit block

3024

<a name="l03000"></a>03000

3025

<a name="l03001"></a>03001 @ingroup bitfunc

3026

<a name="l03002"></a>03002 */

3027

<a name="l03003"></a>03003 inline

3028

<a name="l03004"></a><a class="code" href="a00083.html#g0070984bb1d332610150a9106ab8eb0a">03004</a> unsigned <a class="code" href="a00083.html#g0070984bb1d332610150a9106ab8eb0a" title="Function ANDs two bitblocks and computes the bitcount. Function does not analyse...">bit_block_and_count</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* src1,

3029

<a name="l03005"></a>03005 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* src1_end,

3030

<a name="l03006"></a>03006 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* src2)

3031

<a name="l03007"></a>03007 {

3032

<a name="l03008"></a>03008 unsigned count;

3033

<a name="l03009"></a>03009 #ifdef BMVECTOPT

3034

<a name="l03010"></a>03010 count = <a class="code" href="a00065.html#3459200618dab65142340f1abd760eb9">VECT_BITCOUNT_AND</a>(src1, src1_end, src2);

3035

<a name="l03011"></a>03011 #else

3036

<a name="l03012"></a>03012 count = 0;

3037

<a name="l03013"></a>03013 do

3038

<a name="l03014"></a>03014 {

3039

<a name="l03015"></a>03015 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[0] & src2[0]);

3040

<a name="l03016"></a>03016 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[1] & src2[1]);

3041

<a name="l03017"></a>03017 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[2] & src2[2]);

3042

<a name="l03018"></a>03018 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[3] & src2[3]);

3043

<a name="l03019"></a>03019

3044

<a name="l03020"></a>03020 src1+=4;

3045

<a name="l03021"></a>03021 src2+=4;

3046

<a name="l03022"></a>03022 } while (src1 < src1_end);

3047

<a name="l03023"></a>03023 #endif

3048

<a name="l03024"></a>03024 return count;

3049

<a name="l03025"></a>03025 }

3050

<a name="l03026"></a>03026

3051

<a name="l03027"></a>03027

3052

<a name="l03028"></a>03028 /*!

3053

<a name="l03029"></a>03029 \brief Function ANDs two bitblocks and tests for any bit.

3054

<a name="l03030"></a>03030 Function does not analyse availability of source blocks.

3055

<a name="l03031"></a>03031

3056

<a name="l03032"></a>03032 \param src1 - first bit block

3057

<a name="l03033"></a>03033 \param src1_end - first bit block end

3058

<a name="l03034"></a>03034 \param src2 - second bit block

3059

<a name="l03035"></a>03035

3060

<a name="l03036"></a>03036 @ingroup bitfunc

3061

<a name="l03037"></a>03037 */

3062

<a name="l03038"></a>03038 inline

3063

<a name="l03039"></a><a class="code" href="a00083.html#g9fe2d12ddac5293fe53038c687c732f3">03039</a> unsigned <a class="code" href="a00083.html#g9fe2d12ddac5293fe53038c687c732f3" title="Function ANDs two bitblocks and tests for any bit. Function does not analyse availability...">bit_block_and_any</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* src1,

3064

<a name="l03040"></a>03040 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* src1_end,

3065

<a name="l03041"></a>03041 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* src2)

3066

<a name="l03042"></a>03042 {

3067

<a name="l03043"></a>03043 unsigned count = 0;

3068

<a name="l03044"></a>03044 do

3069

<a name="l03045"></a>03045 {

3070

<a name="l03046"></a>03046 count = (src1[0] & src2[0]) |

3071

<a name="l03047"></a>03047 (src1[1] & src2[1]) |

3072

<a name="l03048"></a>03048 (src1[2] & src2[2]) |

3073

<a name="l03049"></a>03049 (src1[3] & src2[3]);

3074

<a name="l03050"></a>03050

3075

<a name="l03051"></a>03051 src1+=4; src2+=4;

3076

<a name="l03052"></a>03052 } while ((src1 < src1_end) && (count == 0));

3077

<a name="l03053"></a>03053 return count;

3078

<a name="l03054"></a>03054 }

3079

<a name="l03055"></a>03055

3080

<a name="l03056"></a>03056

3081

<a name="l03057"></a>03057

3082

<a name="l03058"></a>03058

3083

<a name="l03059"></a>03059 /*!

3084

<a name="l03060"></a>03060 \brief Function XORs two bitblocks and computes the bitcount.

3085

<a name="l03061"></a>03061 Function does not analyse availability of source blocks.

3086

<a name="l03062"></a>03062

3087

<a name="l03063"></a>03063 \param src1 - first bit block.

3088

<a name="l03064"></a>03064 \param src1_end - first bit block end

3089

<a name="l03065"></a>03065 \param src2 - second bit block.

3090

<a name="l03066"></a>03066

3091

<a name="l03067"></a>03067 @ingroup bitfunc

3092

<a name="l03068"></a>03068 */

3093

<a name="l03069"></a>03069 inline

3094

<a name="l03070"></a><a class="code" href="a00083.html#gf8af8cfe8b49407be1af7398da28c939">03070</a> unsigned <a class="code" href="a00083.html#gf8af8cfe8b49407be1af7398da28c939" title="Function XORs two bitblocks and computes the bitcount. Function does not analyse...">bit_block_xor_count</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3095

<a name="l03071"></a>03071 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3096

<a name="l03072"></a>03072 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3097

<a name="l03073"></a>03073 {

3098

<a name="l03074"></a>03074 unsigned count;

3099

<a name="l03075"></a>03075 #ifdef BMVECTOPT

3100

<a name="l03076"></a>03076 count = <a class="code" href="a00065.html#9954c72d227a3ca78df22a56efad6baf">VECT_BITCOUNT_XOR</a>(src1, src1_end, src2);

3101

<a name="l03077"></a>03077 #else

3102

<a name="l03078"></a>03078 count = 0;

3103

<a name="l03079"></a>03079 do

3104

<a name="l03080"></a>03080 {

3105

<a name="l03081"></a>03081 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[0] ^ src2[0]);

3106

<a name="l03082"></a>03082 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[1] ^ src2[1]);

3107

<a name="l03083"></a>03083 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[2] ^ src2[2]);

3108

<a name="l03084"></a>03084 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[3] ^ src2[3]);

3109

<a name="l03085"></a>03085

3110

<a name="l03086"></a>03086 src1+=4;

3111

<a name="l03087"></a>03087 src2+=4;

3112

<a name="l03088"></a>03088 } while (src1 < src1_end);

3113

<a name="l03089"></a>03089 #endif

3114

<a name="l03090"></a>03090 return count;

3115

<a name="l03091"></a>03091 }

3116

<a name="l03092"></a>03092

3117

<a name="l03093"></a>03093

3118

<a name="l03094"></a>03094 /*!

3119

<a name="l03095"></a>03095 \brief Function XORs two bitblocks and and tests for any bit.

3120

<a name="l03096"></a>03096 Function does not analyse availability of source blocks.

3121

<a name="l03097"></a>03097

3122

<a name="l03098"></a>03098 \param src1 - first bit block.

3123

<a name="l03099"></a>03099 \param src1_end - first bit block end

3124

<a name="l03100"></a>03100 \param src2 - second bit block.

3125

<a name="l03101"></a>03101

3126

<a name="l03102"></a>03102 @ingroup bitfunc

3127

<a name="l03103"></a>03103 */

3128

<a name="l03104"></a>03104 inline

3129

<a name="l03105"></a><a class="code" href="a00083.html#gfbc3ffafc859a503fdd2fc96e7fb60ce">03105</a> unsigned <a class="code" href="a00083.html#gfbc3ffafc859a503fdd2fc96e7fb60ce" title="Function XORs two bitblocks and and tests for any bit. Function does not analyse...">bit_block_xor_any</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3130

<a name="l03106"></a>03106 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3131

<a name="l03107"></a>03107 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3132

<a name="l03108"></a>03108 {

3133

<a name="l03109"></a>03109 unsigned count = 0;

3134

<a name="l03110"></a>03110 do

3135

<a name="l03111"></a>03111 {

3136

<a name="l03112"></a>03112 count = (src1[0] ^ src2[0]) |

3137

<a name="l03113"></a>03113 (src1[1] ^ src2[1]) |

3138

<a name="l03114"></a>03114 (src1[2] ^ src2[2]) |

3139

<a name="l03115"></a>03115 (src1[3] ^ src2[3]);

3140

<a name="l03116"></a>03116

3141

<a name="l03117"></a>03117 src1+=4; src2+=4;

3142

<a name="l03118"></a>03118 } while ((src1 < src1_end) && (count == 0));

3143

<a name="l03119"></a>03119 return count;

3144

<a name="l03120"></a>03120 }

3145

<a name="l03121"></a>03121

3146

<a name="l03122"></a>03122

3147

<a name="l03123"></a>03123

3148

<a name="l03124"></a>03124

3149

<a name="l03125"></a>03125 /*!

3150

<a name="l03126"></a>03126 \brief Function SUBs two bitblocks and computes the bitcount.

3151

<a name="l03127"></a>03127 Function does not analyse availability of source blocks.

3152

<a name="l03128"></a>03128

3153

<a name="l03129"></a>03129 \param src1 - first bit block.

3154

<a name="l03130"></a>03130 \param src1_end - first bit block end

3155

<a name="l03131"></a>03131 \param src2 - second bit block.

3156

<a name="l03132"></a>03132

3157

<a name="l03133"></a>03133 @ingroup bitfunc

3158

<a name="l03134"></a>03134 */

3159

<a name="l03135"></a>03135 inline

3160

<a name="l03136"></a><a class="code" href="a00083.html#gd34175255e9860a572fcf2e664a6de8e">03136</a> unsigned <a class="code" href="a00083.html#gd34175255e9860a572fcf2e664a6de8e" title="Function SUBs two bitblocks and computes the bitcount. Function does not analyse...">bit_block_sub_count</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3161

<a name="l03137"></a>03137 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3162

<a name="l03138"></a>03138 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3163

<a name="l03139"></a>03139 {

3164

<a name="l03140"></a>03140 unsigned count;

3165

<a name="l03141"></a>03141 #ifdef BMVECTOPT

3166

<a name="l03142"></a>03142 count = <a class="code" href="a00065.html#98aaf230431767be4838323266d0b493">VECT_BITCOUNT_SUB</a>(src1, src1_end, src2);

3167

<a name="l03143"></a>03143 #else

3168

<a name="l03144"></a>03144 count = 0;

3169

<a name="l03145"></a>03145 do

3170

<a name="l03146"></a>03146 {

3171

<a name="l03147"></a>03147 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[0] & ~src2[0]);

3172

<a name="l03148"></a>03148 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[1] & ~src2[1]);

3173

<a name="l03149"></a>03149 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[2] & ~src2[2]);

3174

<a name="l03150"></a>03150 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[3] & ~src2[3]);

3175

<a name="l03151"></a>03151

3176

<a name="l03152"></a>03152 src1+=4;

3177

<a name="l03153"></a>03153 src2+=4;

3178

<a name="l03154"></a>03154 } while (src1 < src1_end);

3179

<a name="l03155"></a>03155 #endif

3180

<a name="l03156"></a>03156 return count;

3181

<a name="l03157"></a>03157 }

3182

<a name="l03158"></a>03158

3183

<a name="l03159"></a>03159 /*!

3184

<a name="l03160"></a>03160 \brief Function SUBs two bitblocks and and tests for any bit.

3185

<a name="l03161"></a>03161 Function does not analyse availability of source blocks.

3186

<a name="l03162"></a>03162

3187

<a name="l03163"></a>03163 \param src1 - first bit block.

3188

<a name="l03164"></a>03164 \param src1_end - first bit block end

3189

<a name="l03165"></a>03165 \param src2 - second bit block.

3190

<a name="l03166"></a>03166

3191

<a name="l03167"></a>03167 @ingroup bitfunc

3192

<a name="l03168"></a>03168 */

3193

<a name="l03169"></a>03169 inline

3194

<a name="l03170"></a><a class="code" href="a00083.html#g3f51735d2ca08e5a9fae2c9c49138c5c">03170</a> unsigned <a class="code" href="a00083.html#g3f51735d2ca08e5a9fae2c9c49138c5c" title="Function SUBs two bitblocks and and tests for any bit. Function does not analyse...">bit_block_sub_any</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3195

<a name="l03171"></a>03171 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3196

<a name="l03172"></a>03172 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3197

<a name="l03173"></a>03173 {

3198

<a name="l03174"></a>03174 unsigned count = 0;

3199

<a name="l03175"></a>03175 do

3200

<a name="l03176"></a>03176 {

3201

<a name="l03177"></a>03177 count = (src1[0] & ~src2[0]) |

3202

<a name="l03178"></a>03178 (src1[1] & ~src2[1]) |

3203

<a name="l03179"></a>03179 (src1[2] & ~src2[2]) |

3204

<a name="l03180"></a>03180 (src1[3] & ~src2[3]);

3205

<a name="l03181"></a>03181

3206

<a name="l03182"></a>03182 src1+=4; src2+=4;

3207

<a name="l03183"></a>03183 } while ((src1 < src1_end) && (count == 0));

3208

<a name="l03184"></a>03184 return count;

3209

<a name="l03185"></a>03185 }

3210

<a name="l03186"></a>03186

3211

<a name="l03187"></a>03187

3212

<a name="l03188"></a>03188

3213

<a name="l03189"></a>03189 /*!

3214

<a name="l03190"></a>03190 \brief Function ORs two bitblocks and computes the bitcount.

3215

<a name="l03191"></a>03191 Function does not analyse availability of source blocks.

3216

<a name="l03192"></a>03192

3217

<a name="l03193"></a>03193 \param src1 - first bit block

3218

<a name="l03194"></a>03194 \param src1_end - first block end

3219

<a name="l03195"></a>03195 \param src2 - second bit block.

3220

<a name="l03196"></a>03196

3221

<a name="l03197"></a>03197 @ingroup bitfunc

3222

<a name="l03198"></a>03198 */

3223

<a name="l03199"></a>03199 inline

3224

<a name="l03200"></a><a class="code" href="a00083.html#gcf4f8ab164277278448a541863c07517">03200</a> unsigned <a class="code" href="a00083.html#gcf4f8ab164277278448a541863c07517" title="Function ORs two bitblocks and computes the bitcount. Function does not analyse availability...">bit_block_or_count</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* src1,

3225

<a name="l03201"></a>03201 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* src1_end,

3226

<a name="l03202"></a>03202 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* src2)

3227

<a name="l03203"></a>03203 {

3228

<a name="l03204"></a>03204 unsigned count;

3229

<a name="l03205"></a>03205 #ifdef BMVECTOPT

3230

<a name="l03206"></a>03206 count = <a class="code" href="a00065.html#07583d48db4ede7eadbc3156e9dd7d3b">VECT_BITCOUNT_OR</a>(src1, src1_end, src2);

3231

<a name="l03207"></a>03207 #else

3232

<a name="l03208"></a>03208 count = 0;

3233

<a name="l03209"></a>03209 do

3234

<a name="l03210"></a>03210 {

3235

<a name="l03211"></a>03211 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[0] | src2[0]);

3236

<a name="l03212"></a>03212 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[1] | src2[1]);

3237

<a name="l03213"></a>03213 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[2] | src2[2]);

3238

<a name="l03214"></a>03214 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(count, src1[3] | src2[3]);

3239

<a name="l03215"></a>03215

3240

<a name="l03216"></a>03216 src1+=4;

3241

<a name="l03217"></a>03217 src2+=4;

3242

<a name="l03218"></a>03218 } while (src1 < src1_end);

3243

<a name="l03219"></a>03219 #endif

3244

<a name="l03220"></a>03220 return count;

3245

<a name="l03221"></a>03221 }

3246

<a name="l03222"></a>03222

3247

<a name="l03223"></a>03223 /*!

3248

<a name="l03224"></a>03224 \brief Function ORs two bitblocks and and tests for any bit.

3249

<a name="l03225"></a>03225 Function does not analyse availability of source blocks.

3250

<a name="l03226"></a>03226

3251

<a name="l03227"></a>03227 \param src1 - first bit block.

3252

<a name="l03228"></a>03228 \param src1_end - first bit block end

3253

<a name="l03229"></a>03229 \param src2 - second bit block.

3254

<a name="l03230"></a>03230

3255

<a name="l03231"></a>03231 @ingroup bitfunc

3256

<a name="l03232"></a>03232 */

3257

<a name="l03233"></a>03233 inline

3258

<a name="l03234"></a><a class="code" href="a00083.html#gb2047495f7844d3014ff697503669d24">03234</a> unsigned <a class="code" href="a00083.html#gb2047495f7844d3014ff697503669d24" title="Function ORs two bitblocks and and tests for any bit. Function does not analyse availability...">bit_block_or_any</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3259

<a name="l03235"></a>03235 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3260

<a name="l03236"></a>03236 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3261

<a name="l03237"></a>03237 {

3262

<a name="l03238"></a>03238 unsigned count = 0;

3263

<a name="l03239"></a>03239 do

3264

<a name="l03240"></a>03240 {

3265

<a name="l03241"></a>03241 count = (src1[0] | src2[0]) |

3266

<a name="l03242"></a>03242 (src1[1] | src2[1]) |

3267

<a name="l03243"></a>03243 (src1[2] | src2[2]) |

3268

<a name="l03244"></a>03244 (src1[3] | src2[3]);

3269

<a name="l03245"></a>03245

3270

<a name="l03246"></a>03246 src1+=4; src2+=4;

3271

<a name="l03247"></a>03247 } while ((src1 < src1_end) && (count == 0));

3272

<a name="l03248"></a>03248 return count;

3273

<a name="l03249"></a>03249 }

3274

<a name="l03250"></a>03250

3275

<a name="l03251"></a>03251

3276

<a name="l03252"></a>03252

3277

<a name="l03253"></a>03253

3278

<a name="l03254"></a>03254 /*!

3279

<a name="l03255"></a>03255 \brief bitblock AND operation.

3280

<a name="l03256"></a>03256

3281

<a name="l03257"></a>03257 \param dst - destination block.

3282

<a name="l03258"></a>03258 \param src - source block.

3283

<a name="l03259"></a>03259

3284

<a name="l03260"></a>03260 \returns pointer on destination block.

3285

<a name="l03261"></a>03261 If returned value equal to src means that block mutation requested.

3286

<a name="l03262"></a>03262 NULL is valid return value.

3287

<a name="l03263"></a>03263

3288

<a name="l03264"></a>03264 @ingroup bitfunc

3289

<a name="l03265"></a>03265 */

3290

<a name="l03266"></a><a class="code" href="a00083.html#g869fce5348076d4c7b92adcc2f1a49ab">03266</a> inline <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00083.html#g869fce5348076d4c7b92adcc2f1a49ab" title="bitblock AND operation.">bit_operation_and</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst,

3291

<a name="l03267"></a>03267 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src)

3292

<a name="l03268"></a>03268 {

3293

<a name="l03269"></a>03269 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst || src);

3294

<a name="l03270"></a>03270

3295

<a name="l03271"></a>03271 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* ret = dst;

3296

<a name="l03272"></a>03272

3297

<a name="l03273"></a>03273 if (<a class="code" href="a00063.html#13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>(dst)) // The destination block already exists

3298

<a name="l03274"></a>03274 {

3299

<a name="l03275"></a>03275

3300

<a name="l03276"></a>03276 if (!<a class="code" href="a00063.html#13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>(src))

3301

<a name="l03277"></a>03277 {

3302

<a name="l03278"></a>03278 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src))

3303

<a name="l03279"></a>03279 {

3304

<a name="l03280"></a>03280 //If the source block is zero

3305

<a name="l03281"></a>03281 //just clean the destination block

3306

<a name="l03282"></a>03282 return 0;

3307

<a name="l03283"></a>03283 }

3308

<a name="l03284"></a>03284 }

3309

<a name="l03285"></a>03285 else

3310

<a name="l03286"></a>03286 {

3311

<a name="l03287"></a>03287 // Regular operation AND on the whole block.

3312

<a name="l03288"></a>03288 <a class="code" href="a00083.html#g882f79df0a0175ad4ddf483c5f1eeb0e" title="Plain bitblock AND operation. Function does not analyse availability of source and...">bit_block_and</a>(dst, src);

3313

<a name="l03289"></a>03289 }

3314

<a name="l03290"></a>03290 }

3315

<a name="l03291"></a>03291 else // The destination block does not exist yet

3316

<a name="l03292"></a>03292 {

3317

<a name="l03293"></a>03293 if(!<a class="code" href="a00063.html#13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>(src))

3318

<a name="l03294"></a>03294 {

3319

<a name="l03295"></a>03295 if(<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src))

3320

<a name="l03296"></a>03296 {

3321

<a name="l03297"></a>03297 // The source block is empty.

3322

<a name="l03298"></a>03298 // One argument empty - all result is empty.

3323

<a name="l03299"></a>03299 return 0;

3324

<a name="l03300"></a>03300 }

3325

<a name="l03301"></a>03301 // Here we have nothing to do.

3326

<a name="l03302"></a>03302 // Src block is all ON, dst block remains as it is

3327

<a name="l03303"></a>03303 }

3328

<a name="l03304"></a>03304 else // destination block does not exists, src - valid block

3329

<a name="l03305"></a>03305 {

3330

<a name="l03306"></a>03306 if (<a class="code" href="a00063.html#074acb37afea68caaffe3832d326eb44">IS_FULL_BLOCK</a>(dst))

3331

<a name="l03307"></a>03307 {

3332

<a name="l03308"></a>03308 return const_cast<<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*>(src);

3333

<a name="l03309"></a>03309 }

3334

<a name="l03310"></a>03310 // Nothng to do.

3335

<a name="l03311"></a>03311 // Dst block is all ZERO no combination required.

3336

<a name="l03312"></a>03312 }

3337

<a name="l03313"></a>03313 }

3338

<a name="l03314"></a>03314

3339

<a name="l03315"></a>03315 return ret;

3340

<a name="l03316"></a>03316 }

3341

<a name="l03317"></a>03317

3342

<a name="l03318"></a>03318

3343

<a name="l03319"></a>03319 /*!

3344

<a name="l03320"></a>03320 \brief Performs bitblock AND operation and calculates bitcount of the result.

3345

<a name="l03321"></a>03321

3346

<a name="l03322"></a>03322 \param src1 - first bit block.

3347

<a name="l03323"></a>03323 \param src1_end - first bit block end

3348

<a name="l03324"></a>03324 \param src2 - second bit block.

3349

<a name="l03325"></a>03325

3350

<a name="l03326"></a>03326 \returns bitcount value

3351

<a name="l03327"></a>03327

3352

<a name="l03328"></a>03328 @ingroup bitfunc

3353

<a name="l03329"></a>03329 */

3354

<a name="l03330"></a>03330 inline

3355

<a name="l03331"></a><a class="code" href="a00083.html#g9765914087df2fc22ec18db8128f2a12">03331</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g9765914087df2fc22ec18db8128f2a12" title="Performs bitblock AND operation and calculates bitcount of the result.">bit_operation_and_count</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3356

<a name="l03332"></a>03332 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3357

<a name="l03333"></a>03333 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3358

<a name="l03334"></a>03334 {

3359

<a name="l03335"></a>03335 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1) || <a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2))

3360

<a name="l03336"></a>03336 {

3361

<a name="l03337"></a>03337 return 0;

3362

<a name="l03338"></a>03338 }

3363

<a name="l03339"></a>03339 return <a class="code" href="a00083.html#g0070984bb1d332610150a9106ab8eb0a" title="Function ANDs two bitblocks and computes the bitcount. Function does not analyse...">bit_block_and_count</a>(src1, src1_end, src2);

3364

<a name="l03340"></a>03340 }

3365

<a name="l03341"></a>03341

3366

<a name="l03342"></a>03342 /*!

3367

<a name="l03343"></a>03343 \brief Performs bitblock AND operation test.

3368

<a name="l03344"></a>03344

3369

<a name="l03345"></a>03345 \param src1 - first bit block.

3370

<a name="l03346"></a>03346 \param src1_end - first bit block end

3371

<a name="l03347"></a>03347 \param src2 - second bit block.

3372

<a name="l03348"></a>03348

3373

<a name="l03349"></a>03349 \returns non zero if there is any value

3374

<a name="l03350"></a>03350

3375

<a name="l03351"></a>03351 @ingroup bitfunc

3376

<a name="l03352"></a>03352 */

3377

<a name="l03353"></a>03353 inline

3378

<a name="l03354"></a><a class="code" href="a00083.html#g0e7995f7d6c791f6ff27a8dd21d324e5">03354</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g0e7995f7d6c791f6ff27a8dd21d324e5" title="Performs bitblock AND operation test.">bit_operation_and_any</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3379

<a name="l03355"></a>03355 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3380

<a name="l03356"></a>03356 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3381

<a name="l03357"></a>03357 {

3382

<a name="l03358"></a>03358 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1) || <a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2))

3383

<a name="l03359"></a>03359 {

3384

<a name="l03360"></a>03360 return 0;

3385

<a name="l03361"></a>03361 }

3386

<a name="l03362"></a>03362 return <a class="code" href="a00083.html#g9fe2d12ddac5293fe53038c687c732f3" title="Function ANDs two bitblocks and tests for any bit. Function does not analyse availability...">bit_block_and_any</a>(src1, src1_end, src2);

3387

<a name="l03363"></a>03363 }

3388

<a name="l03364"></a>03364

3389

<a name="l03365"></a>03365

3390

<a name="l03366"></a>03366

3391

<a name="l03367"></a>03367 /*!

3392

<a name="l03368"></a>03368 \brief Performs bitblock SUB operation and calculates bitcount of the result.

3393

<a name="l03369"></a>03369

3394

<a name="l03370"></a>03370 \param src1 - first bit block.

3395

<a name="l03371"></a>03371 \param src1_end - first bit block end

3396

<a name="l03372"></a>03372 \param src2 - second bit block

3397

<a name="l03373"></a>03373

3398

<a name="l03374"></a>03374 \returns bitcount value

3399

<a name="l03375"></a>03375

3400

<a name="l03376"></a>03376 @ingroup bitfunc

3401

<a name="l03377"></a>03377 */

3402

<a name="l03378"></a>03378 inline

3403

<a name="l03379"></a><a class="code" href="a00083.html#gabb39bf01bf973cb7bf3648873921ab7">03379</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#gabb39bf01bf973cb7bf3648873921ab7" title="Performs bitblock SUB operation and calculates bitcount of the result.">bit_operation_sub_count</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3404

<a name="l03380"></a>03380 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3405

<a name="l03381"></a>03381 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3406

<a name="l03382"></a>03382 {

3407

<a name="l03383"></a>03383 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1))

3408

<a name="l03384"></a>03384 {

3409

<a name="l03385"></a>03385 return 0;

3410

<a name="l03386"></a>03386 }

3411

<a name="l03387"></a>03387

3412

<a name="l03388"></a>03388 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2)) // nothing to diff

3413

<a name="l03389"></a>03389 {

3414

<a name="l03390"></a>03390 return <a class="code" href="a00083.html#gb30df14a61f036d690c091878feaff1c" title="Bitcount for bit string.">bit_block_calc_count</a>(src1, src1_end);

3415

<a name="l03391"></a>03391 }

3416

<a name="l03392"></a>03392 return <a class="code" href="a00083.html#gd34175255e9860a572fcf2e664a6de8e" title="Function SUBs two bitblocks and computes the bitcount. Function does not analyse...">bit_block_sub_count</a>(src1, src1_end, src2);

3417

<a name="l03393"></a>03393 }

3418

<a name="l03394"></a>03394

3419

<a name="l03395"></a>03395

3420

<a name="l03396"></a>03396 /*!

3421

<a name="l03397"></a>03397 \brief Performs inverted bitblock SUB operation and calculates

3422

<a name="l03398"></a>03398 bitcount of the result.

3423

<a name="l03399"></a>03399

3424

<a name="l03400"></a>03400 \param src1 - first bit block.

3425

<a name="l03401"></a>03401 \param src1_end - first bit block end

3426

<a name="l03402"></a>03402 \param src2 - second bit block

3427

<a name="l03403"></a>03403

3428

<a name="l03404"></a>03404 \returns bitcount value

3429

<a name="l03405"></a>03405

3430

<a name="l03406"></a>03406 @ingroup bitfunc

3431

<a name="l03407"></a>03407 */

3432

<a name="l03408"></a>03408 inline

3433

<a name="l03409"></a><a class="code" href="a00083.html#g53867faf377db72324b858a37063c0b8">03409</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g53867faf377db72324b858a37063c0b8" title="Performs inverted bitblock SUB operation and calculates bitcount of the result.">bit_operation_sub_count_inv</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3434

<a name="l03410"></a>03410 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3435

<a name="l03411"></a>03411 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3436

<a name="l03412"></a>03412 {

3437

<a name="l03413"></a>03413 unsigned arr_size = src1_end - src1;

3438

<a name="l03414"></a>03414 return <a class="code" href="a00083.html#gabb39bf01bf973cb7bf3648873921ab7" title="Performs bitblock SUB operation and calculates bitcount of the result.">bit_operation_sub_count</a>(src2, src2+arr_size, src1);

3439

<a name="l03415"></a>03415 }

3440

<a name="l03416"></a>03416

3441

<a name="l03417"></a>03417

3442

<a name="l03418"></a>03418 /*!

3443

<a name="l03419"></a>03419 \brief Performs bitblock test of SUB operation.

3444

<a name="l03420"></a>03420

3445

<a name="l03421"></a>03421 \param src1 - first bit block.

3446

<a name="l03422"></a>03422 \param src1_end - first bit block end

3447

<a name="l03423"></a>03423 \param src2 - second bit block

3448

<a name="l03424"></a>03424

3449

<a name="l03425"></a>03425 \returns non zero value if there are any bits

3450

<a name="l03426"></a>03426

3451

<a name="l03427"></a>03427 @ingroup bitfunc

3452

<a name="l03428"></a>03428 */

3453

<a name="l03429"></a>03429 inline

3454

<a name="l03430"></a><a class="code" href="a00083.html#g847d5a84673b284be984f0db583e2723">03430</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g847d5a84673b284be984f0db583e2723" title="Performs bitblock test of SUB operation.">bit_operation_sub_any</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3455

<a name="l03431"></a>03431 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3456

<a name="l03432"></a>03432 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3457

<a name="l03433"></a>03433 {

3458

<a name="l03434"></a>03434 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1))

3459

<a name="l03435"></a>03435 {

3460

<a name="l03436"></a>03436 return 0;

3461

<a name="l03437"></a>03437 }

3462

<a name="l03438"></a>03438

3463

<a name="l03439"></a>03439 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2)) // nothing to diff

3464

<a name="l03440"></a>03440 {

3465

<a name="l03441"></a>03441 return !<a class="code" href="a00083.html#gc6cfb9f92e4df6bb4c76f6efb2382860" title="Returns &quot;true&quot; if all bits in the block are 0.">bit_is_all_zero</a>(src1, src1_end);

3466

<a name="l03442"></a>03442 }

3467

<a name="l03443"></a>03443 return <a class="code" href="a00083.html#g3f51735d2ca08e5a9fae2c9c49138c5c" title="Function SUBs two bitblocks and and tests for any bit. Function does not analyse...">bit_block_sub_any</a>(src1, src1_end, src2);

3468

<a name="l03444"></a>03444 }

3469

<a name="l03445"></a>03445

3470

<a name="l03446"></a>03446

3471

<a name="l03447"></a>03447

3472

<a name="l03448"></a>03448 /*!

3473

<a name="l03449"></a>03449 \brief Performs bitblock OR operation and calculates bitcount of the result.

3474

<a name="l03450"></a>03450

3475

<a name="l03451"></a>03451 \param src1 - first bit block.

3476

<a name="l03452"></a>03452 \param src1_end - first bit block end

3477

<a name="l03453"></a>03453 \param src2 - second bit block.

3478

<a name="l03454"></a>03454

3479

<a name="l03455"></a>03455 \returns bitcount value

3480

<a name="l03456"></a>03456

3481

<a name="l03457"></a>03457 @ingroup bitfunc

3482

<a name="l03458"></a>03458 */

3483

<a name="l03459"></a>03459 inline

3484

<a name="l03460"></a><a class="code" href="a00083.html#g5a267aff3b56cc6dadf5a3a338e00a1d">03460</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g5a267aff3b56cc6dadf5a3a338e00a1d" title="Performs bitblock OR operation and calculates bitcount of the result.">bit_operation_or_count</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3485

<a name="l03461"></a>03461 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3486

<a name="l03462"></a>03462 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3487

<a name="l03463"></a>03463 {

3488

<a name="l03464"></a>03464 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1))

3489

<a name="l03465"></a>03465 {

3490

<a name="l03466"></a>03466 if (!<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2))

3491

<a name="l03467"></a>03467 return <a class="code" href="a00083.html#gb30df14a61f036d690c091878feaff1c" title="Bitcount for bit string.">bit_block_calc_count</a>(src2, src2 + (src1_end - src1));

3492

<a name="l03468"></a>03468 else

3493

<a name="l03469"></a>03469 return 0; // both blocks are empty

3494

<a name="l03470"></a>03470 }

3495

<a name="l03471"></a>03471 else

3496

<a name="l03472"></a>03472 {

3497

<a name="l03473"></a>03473 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2))

3498

<a name="l03474"></a>03474 return <a class="code" href="a00083.html#gb30df14a61f036d690c091878feaff1c" title="Bitcount for bit string.">bit_block_calc_count</a>(src1, src1_end);

3499

<a name="l03475"></a>03475 }

3500

<a name="l03476"></a>03476

3501

<a name="l03477"></a>03477 return <a class="code" href="a00083.html#gcf4f8ab164277278448a541863c07517" title="Function ORs two bitblocks and computes the bitcount. Function does not analyse availability...">bit_block_or_count</a>(src1, src1_end, src2);

3502

<a name="l03478"></a>03478 }

3503

<a name="l03479"></a>03479

3504

<a name="l03480"></a>03480 /*!

3505

<a name="l03481"></a>03481 \brief Performs bitblock OR operation test.

3506

<a name="l03482"></a>03482

3507

<a name="l03483"></a>03483 \param src1 - first bit block.

3508

<a name="l03484"></a>03484 \param src1_end - first bit block end

3509

<a name="l03485"></a>03485 \param src2 - second bit block.

3510

<a name="l03486"></a>03486

3511

<a name="l03487"></a>03487 \returns non zero value if there are any bits

3512

<a name="l03488"></a>03488

3513

<a name="l03489"></a>03489 @ingroup bitfunc

3514

<a name="l03490"></a>03490 */

3515

<a name="l03491"></a>03491 inline

3516

<a name="l03492"></a><a class="code" href="a00083.html#g6d26742bdc373074474a6932eab4f388">03492</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#g6d26742bdc373074474a6932eab4f388" title="Performs bitblock OR operation test.">bit_operation_or_any</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3517

<a name="l03493"></a>03493 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3518

<a name="l03494"></a>03494 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3519

<a name="l03495"></a>03495 {

3520

<a name="l03496"></a>03496 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1))

3521

<a name="l03497"></a>03497 {

3522

<a name="l03498"></a>03498 if (!<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2))

3523

<a name="l03499"></a>03499 return !<a class="code" href="a00083.html#gc6cfb9f92e4df6bb4c76f6efb2382860" title="Returns &quot;true&quot; if all bits in the block are 0.">bit_is_all_zero</a>(src2, src2 + (src1_end - src1));

3524

<a name="l03500"></a>03500 else

3525

<a name="l03501"></a>03501 return 0; // both blocks are empty

3526

<a name="l03502"></a>03502 }

3527

<a name="l03503"></a>03503 else

3528

<a name="l03504"></a>03504 {

3529

<a name="l03505"></a>03505 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2))

3530

<a name="l03506"></a>03506 return !<a class="code" href="a00083.html#gc6cfb9f92e4df6bb4c76f6efb2382860" title="Returns &quot;true&quot; if all bits in the block are 0.">bit_is_all_zero</a>(src1, src1_end);

3531

<a name="l03507"></a>03507 }

3532

<a name="l03508"></a>03508

3533

<a name="l03509"></a>03509 return <a class="code" href="a00083.html#gb2047495f7844d3014ff697503669d24" title="Function ORs two bitblocks and and tests for any bit. Function does not analyse availability...">bit_block_or_any</a>(src1, src1_end, src2);

3534

<a name="l03510"></a>03510 }

3535

<a name="l03511"></a>03511

3536

<a name="l03512"></a>03512

3537

<a name="l03513"></a>03513

3538

<a name="l03514"></a>03514 /*!

3539

<a name="l03515"></a>03515 \brief Plain bitblock OR operation.

3540

<a name="l03516"></a>03516 Function does not analyse availability of source and destination blocks.

3541

<a name="l03517"></a>03517

3542

<a name="l03518"></a>03518 \param dst - destination block.

3543

<a name="l03519"></a>03519 \param src - source block.

3544

<a name="l03520"></a>03520

3545

<a name="l03521"></a>03521 @ingroup bitfunc

3546

<a name="l03522"></a>03522 */

3547

<a name="l03523"></a><a class="code" href="a00083.html#g3515d8eb5da7f9d41d63dc90ad9523a4">03523</a> inline void <a class="code" href="a00083.html#g3515d8eb5da7f9d41d63dc90ad9523a4" title="Plain bitblock OR operation. Function does not analyse availability of source and...">bit_block_or</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst,

3548

<a name="l03524"></a>03524 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src)

3549

<a name="l03525"></a>03525 {

3550

<a name="l03526"></a>03526 #ifdef BMVECTOPT

3551

<a name="l03527"></a>03527 <a class="code" href="a00065.html#e3cdeec275429ea0d60668da63e96df8">VECT_OR_ARR</a>(dst, src, src + <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

3552

<a name="l03528"></a>03528 #else

3553

<a name="l03529"></a>03529 const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> wrd_ptr = (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*)src;

3554

<a name="l03530"></a>03530 const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> wrd_end = (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*)(src + <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">set_block_size</a>);

3555

<a name="l03531"></a>03531 <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst_ptr = (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*)dst;

3556

<a name="l03532"></a>03532

3557

<a name="l03533"></a>03533 do

3558

<a name="l03534"></a>03534 {

3559

<a name="l03535"></a>03535 dst_ptr[0] |= wrd_ptr[0];

3560

<a name="l03536"></a>03536 dst_ptr[1] |= wrd_ptr[1];

3561

<a name="l03537"></a>03537 dst_ptr[2] |= wrd_ptr[2];

3562

<a name="l03538"></a>03538 dst_ptr[3] |= wrd_ptr[3];

3563

<a name="l03539"></a>03539

3564

<a name="l03540"></a>03540 dst_ptr+=4;

3565

<a name="l03541"></a>03541 wrd_ptr+=4;

3566

<a name="l03542"></a>03542

3567

<a name="l03543"></a>03543 } while (wrd_ptr < wrd_end);

3568

<a name="l03544"></a>03544 #endif

3569

<a name="l03545"></a>03545 }

3570

<a name="l03546"></a>03546

3571

<a name="l03547"></a>03547

3572

<a name="l03548"></a>03548 /*!

3573

<a name="l03549"></a>03549 \brief Block OR operation. Makes analysis if block is 0 or FULL.

3574

<a name="l03550"></a>03550

3575

<a name="l03551"></a>03551 \param dst - destination block.

3576

<a name="l03552"></a>03552 \param src - source block.

3577

<a name="l03553"></a>03553

3578

<a name="l03554"></a>03554 \returns pointer on destination block.

3579

<a name="l03555"></a>03555 If returned value equal to src means that block mutation requested.

3580

<a name="l03556"></a>03556 NULL is valid return value.

3581

<a name="l03557"></a>03557

3582

<a name="l03558"></a>03558 @ingroup bitfunc

3583

<a name="l03559"></a>03559 */

3584

<a name="l03560"></a>03560 inline

3585

<a name="l03561"></a><a class="code" href="a00083.html#g0e945a9eaae699ad40f63b3f0632e6f9">03561</a> <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00083.html#g0e945a9eaae699ad40f63b3f0632e6f9" title="Block OR operation. Makes analysis if block is 0 or FULL.">bit_operation_or</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst,

3586

<a name="l03562"></a>03562 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src)

3587

<a name="l03563"></a>03563 {

3588

<a name="l03564"></a>03564 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst || src);

3589

<a name="l03565"></a>03565

3590

<a name="l03566"></a>03566 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* ret = dst;

3591

<a name="l03567"></a>03567

3592

<a name="l03568"></a>03568 if (<a class="code" href="a00063.html#13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>(dst)) // The destination block already exists

3593

<a name="l03569"></a>03569 {

3594

<a name="l03570"></a>03570 if (!<a class="code" href="a00063.html#13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>(src))

3595

<a name="l03571"></a>03571 {

3596

<a name="l03572"></a>03572 if (<a class="code" href="a00063.html#074acb37afea68caaffe3832d326eb44">IS_FULL_BLOCK</a>(src))

3597

<a name="l03573"></a>03573 {

3598

<a name="l03574"></a>03574 // if the source block is all set

3599

<a name="l03575"></a>03575 // just set the destination block

3600

<a name="l03576"></a>03576 ::memset(dst, 0xFF, <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a> * sizeof(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>));

3601

<a name="l03577"></a>03577 }

3602

<a name="l03578"></a>03578 }

3603

<a name="l03579"></a>03579 else

3604

<a name="l03580"></a>03580 {

3605

<a name="l03581"></a>03581 // Regular operation OR on the whole block

3606

<a name="l03582"></a>03582 <a class="code" href="a00083.html#g3515d8eb5da7f9d41d63dc90ad9523a4" title="Plain bitblock OR operation. Function does not analyse availability of source and...">bit_block_or</a>(dst, src);

3607

<a name="l03583"></a>03583 }

3608

<a name="l03584"></a>03584 }

3609

<a name="l03585"></a>03585 else // The destination block does not exist yet

3610

<a name="l03586"></a>03586 {

3611

<a name="l03587"></a>03587 if (!<a class="code" href="a00063.html#13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>(src))

3612

<a name="l03588"></a>03588 {

3613

<a name="l03589"></a>03589 if (<a class="code" href="a00063.html#074acb37afea68caaffe3832d326eb44">IS_FULL_BLOCK</a>(src))

3614

<a name="l03590"></a>03590 {

3615

<a name="l03591"></a>03591 // The source block is all set, because dst does not exist

3616

<a name="l03592"></a>03592 // we can simply replace it.

3617

<a name="l03593"></a>03593 return const_cast<<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*>(<a class="code" href="a00063.html#1365569f85f442c4914a3579f55df99b">FULL_BLOCK_ADDR</a>);

3618

<a name="l03594"></a>03594 }

3619

<a name="l03595"></a>03595 }

3620

<a name="l03596"></a>03596 else

3621

<a name="l03597"></a>03597 {

3622

<a name="l03598"></a>03598 if (dst == 0)

3623

<a name="l03599"></a>03599 {

3624

<a name="l03600"></a>03600 // The only case when we have to allocate the new block:

3625

<a name="l03601"></a>03601 // Src is all zero and Dst does not exist

3626

<a name="l03602"></a>03602 return const_cast<<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*>(src);

3627

<a name="l03603"></a>03603 }

3628

<a name="l03604"></a>03604 }

3629

<a name="l03605"></a>03605 }

3630

<a name="l03606"></a>03606 return ret;

3631

<a name="l03607"></a>03607 }

3632

<a name="l03608"></a>03608

3633

<a name="l03609"></a>03609 /*!

3634

<a name="l03610"></a>03610 \brief Plain bitblock SUB (AND NOT) operation.

3635

<a name="l03611"></a>03611 Function does not analyse availability of source and destination blocks.

3636

<a name="l03612"></a>03612

3637

<a name="l03613"></a>03613 \param dst - destination block.

3638

<a name="l03614"></a>03614 \param src - source block.

3639

<a name="l03615"></a>03615

3640

<a name="l03616"></a>03616 @ingroup bitfunc

3641

<a name="l03617"></a>03617 */

3642

<a name="l03618"></a>03618 inline

3643

<a name="l03619"></a><a class="code" href="a00083.html#gfed81435f74c0542857842d4461686e4">03619</a> void <a class="code" href="a00083.html#gfed81435f74c0542857842d4461686e4" title="Plain bitblock SUB (AND NOT) operation. Function does not analyse availability of...">bit_block_sub</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst,

3644

<a name="l03620"></a>03620 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src)

3645

<a name="l03621"></a>03621 {

3646

<a name="l03622"></a>03622 #ifdef BMVECTOPT

3647

<a name="l03623"></a>03623 <a class="code" href="a00065.html#f079345cbcb256bb6216c0446fd775f2">VECT_SUB_ARR</a>(dst, src, src + <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

3648

<a name="l03624"></a>03624 #else

3649

<a name="l03625"></a>03625 const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> wrd_ptr = (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*) src;

3650

<a name="l03626"></a>03626 const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> wrd_end =

3651

<a name="l03627"></a>03627 (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*) (src + <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

3652

<a name="l03628"></a>03628 <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* dst_ptr = (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*)dst;

3653

<a name="l03629"></a>03629

3654

<a name="l03630"></a>03630 // Regular operation AND-NOT on the whole block.

3655

<a name="l03631"></a>03631 do

3656

<a name="l03632"></a>03632 {

3657

<a name="l03633"></a>03633 dst_ptr[0] &= ~wrd_ptr[0];

3658

<a name="l03634"></a>03634 dst_ptr[1] &= ~wrd_ptr[1];

3659

<a name="l03635"></a>03635 dst_ptr[2] &= ~wrd_ptr[2];

3660

<a name="l03636"></a>03636 dst_ptr[3] &= ~wrd_ptr[3];

3661

<a name="l03637"></a>03637

3662

<a name="l03638"></a>03638 dst_ptr+=4;

3663

<a name="l03639"></a>03639 wrd_ptr+=4;

3664

<a name="l03640"></a>03640 } while (wrd_ptr < wrd_end);

3665

<a name="l03641"></a>03641 #endif

3666

<a name="l03642"></a>03642

3667

<a name="l03643"></a>03643 }

3668

<a name="l03644"></a>03644

3669

<a name="l03645"></a>03645

3670

<a name="l03646"></a>03646 /*!

3671

<a name="l03647"></a>03647 \brief bitblock SUB operation.

3672

<a name="l03648"></a>03648

3673

<a name="l03649"></a>03649 \param dst - destination block.

3674

<a name="l03650"></a>03650 \param src - source block.

3675

<a name="l03651"></a>03651

3676

<a name="l03652"></a>03652 \returns pointer on destination block.

3677

<a name="l03653"></a>03653 If returned value equal to src means that block mutation requested.

3678

<a name="l03654"></a>03654 NULL is valid return value.

3679

<a name="l03655"></a>03655

3680

<a name="l03656"></a>03656 @ingroup bitfunc

3681

<a name="l03657"></a>03657 */

3682

<a name="l03658"></a>03658 inline

3683

<a name="l03659"></a><a class="code" href="a00083.html#gd7afa9bce28a376360ca4826960d669f">03659</a> <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00083.html#gd7afa9bce28a376360ca4826960d669f" title="bitblock SUB operation.">bit_operation_sub</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst,

3684

<a name="l03660"></a>03660 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src)

3685

<a name="l03661"></a>03661 {

3686

<a name="l03662"></a>03662 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst || src);

3687

<a name="l03663"></a>03663

3688

<a name="l03664"></a>03664 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* ret = dst;

3689

<a name="l03665"></a>03665 if (<a class="code" href="a00063.html#13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>(dst)) // The destination block already exists

3690

<a name="l03666"></a>03666 {

3691

<a name="l03667"></a>03667 if (!<a class="code" href="a00063.html#13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>(src))

3692

<a name="l03668"></a>03668 {

3693

<a name="l03669"></a>03669 if (<a class="code" href="a00063.html#074acb37afea68caaffe3832d326eb44">IS_FULL_BLOCK</a>(src))

3694

<a name="l03670"></a>03670 {

3695

<a name="l03671"></a>03671 // If the source block is all set

3696

<a name="l03672"></a>03672 // just clean the destination block

3697

<a name="l03673"></a>03673 return 0;

3698

<a name="l03674"></a>03674 }

3699

<a name="l03675"></a>03675 }

3700

<a name="l03676"></a>03676 else

3701

<a name="l03677"></a>03677 {

3702

<a name="l03678"></a>03678 <a class="code" href="a00083.html#gfed81435f74c0542857842d4461686e4" title="Plain bitblock SUB (AND NOT) operation. Function does not analyse availability of...">bit_block_sub</a>(dst, src);

3703

<a name="l03679"></a>03679 }

3704

<a name="l03680"></a>03680 }

3705

<a name="l03681"></a>03681 else // The destination block does not exist yet

3706

<a name="l03682"></a>03682 {

3707

<a name="l03683"></a>03683 if (!<a class="code" href="a00063.html#13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>(src))

3708

<a name="l03684"></a>03684 {

3709

<a name="l03685"></a>03685 if (<a class="code" href="a00063.html#074acb37afea68caaffe3832d326eb44">IS_FULL_BLOCK</a>(src))

3710

<a name="l03686"></a>03686 {

3711

<a name="l03687"></a>03687 // The source block is full

3712

<a name="l03688"></a>03688 return 0;

3713

<a name="l03689"></a>03689 }

3714

<a name="l03690"></a>03690 }

3715

<a name="l03691"></a>03691 else

3716

<a name="l03692"></a>03692 {

3717

<a name="l03693"></a>03693 if (<a class="code" href="a00063.html#074acb37afea68caaffe3832d326eb44">IS_FULL_BLOCK</a>(dst))

3718

<a name="l03694"></a>03694 {

3719

<a name="l03695"></a>03695 // The only case when we have to allocate the new block:

3720

<a name="l03696"></a>03696 // dst is all set and src exists

3721

<a name="l03697"></a>03697 return const_cast<<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*>(src);

3722

<a name="l03698"></a>03698 }

3723

<a name="l03699"></a>03699 }

3724

<a name="l03700"></a>03700 }

3725

<a name="l03701"></a>03701 return ret;

3726

<a name="l03702"></a>03702 }

3727

<a name="l03703"></a>03703

3728

<a name="l03704"></a>03704

3729

<a name="l03705"></a>03705 /*!

3730

<a name="l03706"></a>03706 \brief Plain bitblock XOR operation.

3731

<a name="l03707"></a>03707 Function does not analyse availability of source and destination blocks.

3732

<a name="l03708"></a>03708

3733

<a name="l03709"></a>03709 \param dst - destination block.

3734

<a name="l03710"></a>03710 \param src - source block.

3735

<a name="l03711"></a>03711

3736

<a name="l03712"></a>03712 @ingroup bitfunc

3737

<a name="l03713"></a>03713 */

3738

<a name="l03714"></a>03714 inline

3739

<a name="l03715"></a><a class="code" href="a00083.html#ge6a46c5e671ea1c9312219ceb41025ef">03715</a> void <a class="code" href="a00083.html#ge6a46c5e671ea1c9312219ceb41025ef" title="Plain bitblock XOR operation. Function does not analyse availability of source and...">bit_block_xor</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst,

3740

<a name="l03716"></a>03716 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src)

3741

<a name="l03717"></a>03717 {

3742

<a name="l03718"></a>03718 #ifdef BMVECTOPT

3743

<a name="l03719"></a>03719 <a class="code" href="a00065.html#1f520ac49859f992de5c00f43b851179">VECT_XOR_ARR</a>(dst, src, src + <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

3744

<a name="l03720"></a>03720 #else

3745

<a name="l03721"></a>03721 const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> wrd_ptr = (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*) src;

3746

<a name="l03722"></a>03722 const <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> wrd_end =

3747

<a name="l03723"></a>03723 (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*) (src + <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);

3748

<a name="l03724"></a>03724 <a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">bm::wordop_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst_ptr = (<a class="code" href="a00078.html#ee4bc8730c4b53977ccc8ac18be42784">wordop_t</a>*)dst;

3749

<a name="l03725"></a>03725

3750

<a name="l03726"></a>03726 // Regular XOR operation on the whole block.

3751

<a name="l03727"></a>03727 do

3752

<a name="l03728"></a>03728 {

3753

<a name="l03729"></a>03729 dst_ptr[0] ^= wrd_ptr[0];

3754

<a name="l03730"></a>03730 dst_ptr[1] ^= wrd_ptr[1];

3755

<a name="l03731"></a>03731 dst_ptr[2] ^= wrd_ptr[2];

3756

<a name="l03732"></a>03732 dst_ptr[3] ^= wrd_ptr[3];

3757

<a name="l03733"></a>03733

3758

<a name="l03734"></a>03734 dst_ptr+=4;

3759

<a name="l03735"></a>03735 wrd_ptr+=4;

3760

<a name="l03736"></a>03736 } while (wrd_ptr < wrd_end);

3761

<a name="l03737"></a>03737 #endif

3762

<a name="l03738"></a>03738

3763

<a name="l03739"></a>03739 }

3764

<a name="l03740"></a>03740

3765

<a name="l03741"></a>03741

3766

<a name="l03742"></a>03742 /*!

3767

<a name="l03743"></a>03743 \brief bitblock XOR operation.

3768

<a name="l03744"></a>03744

3769

<a name="l03745"></a>03745 \param dst - destination block.

3770

<a name="l03746"></a>03746 \param src - source block.

3771

<a name="l03747"></a>03747

3772

<a name="l03748"></a>03748 \returns pointer on destination block.

3773

<a name="l03749"></a>03749 If returned value equal to src means that block mutation requested.

3774

<a name="l03750"></a>03750 NULL is valid return value.

3775

<a name="l03751"></a>03751

3776

<a name="l03752"></a>03752 @ingroup bitfunc

3777

<a name="l03753"></a>03753 */

3778

<a name="l03754"></a>03754 inline

3779

<a name="l03755"></a><a class="code" href="a00083.html#g179de722e87ccf8189d975ca6beed025">03755</a> <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00083.html#g179de722e87ccf8189d975ca6beed025" title="bitblock XOR operation.">bit_operation_xor</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> dst,

3780

<a name="l03756"></a>03756 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src)

3781

<a name="l03757"></a>03757 {

3782

<a name="l03758"></a>03758 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(dst || src);

3783

<a name="l03759"></a>03759 if (src == dst) return 0; // XOR rule

3784

<a name="l03760"></a>03760

3785

<a name="l03761"></a>03761 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* ret = dst;

3786

<a name="l03762"></a>03762

3787

<a name="l03763"></a>03763 if (<a class="code" href="a00063.html#13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>(dst)) // The destination block already exists

3788

<a name="l03764"></a>03764 {

3789

<a name="l03765"></a>03765 if (!src) return dst;

3790

<a name="l03766"></a>03766

3791

<a name="l03767"></a>03767 <a class="code" href="a00083.html#ge6a46c5e671ea1c9312219ceb41025ef" title="Plain bitblock XOR operation. Function does not analyse availability of source and...">bit_block_xor</a>(dst, src);

3792

<a name="l03768"></a>03768 }

3793

<a name="l03769"></a>03769 else // The destination block does not exist yet

3794

<a name="l03770"></a>03770 {

3795

<a name="l03771"></a>03771 if (!src) return dst; // 1 xor 0 = 1

3796

<a name="l03772"></a>03772

3797

<a name="l03773"></a>03773 // Here we have two cases:

3798

<a name="l03774"></a>03774 // if dest block is full or zero if zero we need to copy the source

3799

<a name="l03775"></a>03775 // otherwise XOR loop against 0xFF...

3800

<a name="l03776"></a>03776 //BM_ASSERT(dst == 0);

3801

<a name="l03777"></a>03777 return const_cast<<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*>(src); // src is the final result

3802

<a name="l03778"></a>03778 }

3803

<a name="l03779"></a>03779 return ret;

3804

<a name="l03780"></a>03780 }

3805

<a name="l03781"></a>03781

3806

<a name="l03782"></a>03782 /*!

3807

<a name="l03783"></a>03783 \brief Performs bitblock XOR operation and calculates bitcount of the result.

3808

<a name="l03784"></a>03784

3809

<a name="l03785"></a>03785 \param src1 - first bit block.

3810

<a name="l03786"></a>03786 \param src2 - second bit block.

3811

<a name="l03787"></a>03787

3812

<a name="l03788"></a>03788 \returns bitcount value

3813

<a name="l03789"></a>03789

3814

<a name="l03790"></a>03790 @ingroup bitfunc

3815

<a name="l03791"></a>03791 */

3816

<a name="l03792"></a>03792 inline

3817

<a name="l03793"></a><a class="code" href="a00083.html#gce08ab77feefb638daee164ee83118bc">03793</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#gce08ab77feefb638daee164ee83118bc" title="Performs bitblock XOR operation and calculates bitcount of the result.">bit_operation_xor_count</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3818

<a name="l03794"></a>03794 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3819

<a name="l03795"></a>03795 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3820

<a name="l03796"></a>03796 {

3821

<a name="l03797"></a>03797 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1) || <a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2))

3822

<a name="l03798"></a>03798 {

3823

<a name="l03799"></a>03799 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1) && <a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2))

3824

<a name="l03800"></a>03800 return 0;

3825

<a name="l03801"></a>03801 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* block = <a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1) ? src2 : src1;

3826

<a name="l03802"></a>03802 return <a class="code" href="a00083.html#gb30df14a61f036d690c091878feaff1c" title="Bitcount for bit string.">bit_block_calc_count</a>(block, block + (src1_end - src1));

3827

<a name="l03803"></a>03803 }

3828

<a name="l03804"></a>03804 return <a class="code" href="a00083.html#gf8af8cfe8b49407be1af7398da28c939" title="Function XORs two bitblocks and computes the bitcount. Function does not analyse...">bit_block_xor_count</a>(src1, src1_end, src2);

3829

<a name="l03805"></a>03805 }

3830

<a name="l03806"></a>03806

3831

<a name="l03807"></a>03807 /*!

3832

<a name="l03808"></a>03808 \brief Performs bitblock XOR operation test.

3833

<a name="l03809"></a>03809

3834

<a name="l03810"></a>03810 \param src1 - first bit block.

3835

<a name="l03811"></a>03811 \param src2 - second bit block.

3836

<a name="l03812"></a>03812

3837

<a name="l03813"></a>03813 \returns non zero value if there are bits

3838

<a name="l03814"></a>03814

3839

<a name="l03815"></a>03815 @ingroup bitfunc

3840

<a name="l03816"></a>03816 */

3841

<a name="l03817"></a>03817 inline

3842

<a name="l03818"></a><a class="code" href="a00083.html#ga86561b6d11c3f01dd772563c692f732">03818</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00083.html#ga86561b6d11c3f01dd772563c692f732" title="Performs bitblock XOR operation test.">bit_operation_xor_any</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1,

3843

<a name="l03819"></a>03819 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src1_end,

3844

<a name="l03820"></a>03820 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00063.html#3d4b22f50e6783522689451783907dc7">BMRESTRICT</a> src2)

3845

<a name="l03821"></a>03821 {

3846

<a name="l03822"></a>03822 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1) || <a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2))

3847

<a name="l03823"></a>03823 {

3848

<a name="l03824"></a>03824 if (<a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1) && <a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src2))

3849

<a name="l03825"></a>03825 return 0;

3850

<a name="l03826"></a>03826 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* block = <a class="code" href="a00063.html#ccfe8650b3e8ee65da94f7712b3c44b8">IS_EMPTY_BLOCK</a>(src1) ? src2 : src1;

3851

<a name="l03827"></a>03827 return !<a class="code" href="a00083.html#gc6cfb9f92e4df6bb4c76f6efb2382860" title="Returns &quot;true&quot; if all bits in the block are 0.">bit_is_all_zero</a>(block, block + (src1_end - src1));

3852

<a name="l03828"></a>03828 }

3853

<a name="l03829"></a>03829 return <a class="code" href="a00083.html#gfbc3ffafc859a503fdd2fc96e7fb60ce" title="Function XORs two bitblocks and and tests for any bit. Function does not analyse...">bit_block_xor_any</a>(src1, src1_end, src2);

3854

<a name="l03830"></a>03830 }

3855

<a name="l03831"></a>03831

3856

<a name="l03832"></a>03832

3857

<a name="l03833"></a>03833 /**

3858

<a name="l03834"></a>03834 \brief Inspects bit block for zero words at the head and at the end

3859

<a name="l03835"></a>03835

3860

<a name="l03836"></a>03836 If there are no head-tail zeroes output parameters

3861

<a name="l03837"></a>03837 head_idx and tail_idx are going to be [0, bm::set_block_size-1].

3862

<a name="l03838"></a>03838 If block is all-zero head_idx is -1

3863

<a name="l03839"></a>03839

3864

<a name="l03840"></a>03840 \param data - bit block pointer

3865

<a name="l03841"></a>03841 \param head_idx - index of first non-zero word in block

3866

<a name="l03842"></a>03842 \param tail_idx - index of the last non-zero word in block

3867

<a name="l03843"></a>03843

3868

<a name="l03844"></a>03844 @ingroup bitfunc

3869

<a name="l03845"></a>03845 */

3870

<a name="l03846"></a>03846 inline

3871

<a name="l03847"></a><a class="code" href="a00083.html#g969f81db8bd162ee3c829fa833fb1f8a">03847</a> void <a class="code" href="a00083.html#g969f81db8bd162ee3c829fa833fb1f8a" title="Inspects bit block for zero words at the head and at the end.">bit_find_head_tail</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* data,

3872

<a name="l03848"></a>03848 unsigned* head_idx,

3873

<a name="l03849"></a>03849 unsigned* tail_idx)

3874

<a name="l03850"></a>03850 {

3875

<a name="l03851"></a>03851 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(head_idx && tail_idx);

3876

<a name="l03852"></a>03852 *head_idx = (unsigned)-1;

3877

<a name="l03853"></a>03853 for (unsigned i = 0; i < <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>; ++i)

3878

<a name="l03854"></a>03854 {

3879

<a name="l03855"></a>03855 if (data[i])

3880

<a name="l03856"></a>03856 {

3881

<a name="l03857"></a>03857 *head_idx = i;

3882

<a name="l03858"></a>03858 break;

3883

<a name="l03859"></a>03859 }

3884

<a name="l03860"></a>03860 } // for i

3885

<a name="l03861"></a>03861 if (*head_idx == (unsigned)-1)

3886

<a name="l03862"></a>03862 {

3887

<a name="l03863"></a>03863 return; // all zero block

3888

<a name="l03864"></a>03864 }

3889

<a name="l03865"></a>03865

3890

<a name="l03866"></a>03866 for (unsigned j = bm::set_block_size-1; j >= *head_idx; --j)

3891

<a name="l03867"></a>03867 {

3892

<a name="l03868"></a>03868 if (data[j])

3893

<a name="l03869"></a>03869 {

3894

<a name="l03870"></a>03870 *tail_idx = j;

3895

<a name="l03871"></a>03871 break;

3896

<a name="l03872"></a>03872 }

3897

<a name="l03873"></a>03873 } // for j

3898

<a name="l03874"></a>03874

3899

<a name="l03875"></a>03875 }

3900

<a name="l03876"></a>03876

3901

<a name="l03877"></a>03877

3902

<a name="l03878"></a>03878

3903

<a name="l03879"></a>03879 /**

3904

<a name="l03880"></a>03880 \brief Searches for the next 1 bit in the BIT block

3905

<a name="l03881"></a>03881 \param data - BIT buffer

3906

<a name="l03882"></a>03882 \param nbit - bit index to start checking from

3907

<a name="l03883"></a>03883 \param prev - returns previously checked value

3908

<a name="l03884"></a>03884

3909

<a name="l03885"></a>03885 @ingroup bitfunc

3910

<a name="l03886"></a>03886 */

3911

<a name="l03887"></a>03887 inline

3912

<a name="l03888"></a><a class="code" href="a00083.html#gd6a7c549a625df7aa7d68d43a57238c7">03888</a> int <a class="code" href="a00083.html#gd6a7c549a625df7aa7d68d43a57238c7" title="Searches for the next 1 bit in the BIT block.">bit_find_in_block</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* data,

3913

<a name="l03889"></a>03889 unsigned nbit,

3914

<a name="l03890"></a>03890 <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a>* prev)

3915

<a name="l03891"></a>03891 {

3916

<a name="l03892"></a>03892 register <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> p = *prev;

3917

<a name="l03893"></a>03893 int found = 0;

3918

<a name="l03894"></a>03894

3919

<a name="l03895"></a>03895 for(;;)

3920

<a name="l03896"></a>03896 {

3921

<a name="l03897"></a>03897 unsigned nword = nbit >> <a class="code" href="a00078.html#83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>;

3922

<a name="l03898"></a>03898 if (nword >= <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>) break;

3923

<a name="l03899"></a>03899

3924

<a name="l03900"></a>03900 register <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> val = data[nword] >> (p & <a class="code" href="a00078.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>);

3925

<a name="l03901"></a>03901

3926

<a name="l03902"></a>03902 if (val)

3927

<a name="l03903"></a>03903 {

3928

<a name="l03904"></a>03904 while((val & 1) == 0)

3929

<a name="l03905"></a>03905 {

3930

<a name="l03906"></a>03906 val >>= 1;

3931

<a name="l03907"></a>03907 ++nbit;

3932

<a name="l03908"></a>03908 ++p;

3933

<a name="l03909"></a>03909 }

3934

<a name="l03910"></a>03910 ++found;

3935

<a name="l03911"></a>03911 break;

3936

<a name="l03912"></a>03912 }

3937

<a name="l03913"></a>03913 else

3938

<a name="l03914"></a>03914 {

3939

<a name="l03915"></a>03915 p += (<a class="code" href="a00078.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a> + 1) - (nbit & <a class="code" href="a00078.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>);

3940

<a name="l03916"></a>03916 nbit += (bm::set_word_mask + 1) - (nbit & bm::set_word_mask);

3941

<a name="l03917"></a>03917 }

3942

<a name="l03918"></a>03918 }

3943

<a name="l03919"></a>03919 *prev = p;

3944

<a name="l03920"></a>03920 return found;

3945

<a name="l03921"></a>03921 }

3946

<a name="l03922"></a>03922

3947

<a name="l03923"></a>03923 /*!

3948

<a name="l03924"></a>03924 \brief Templated algorithm to unpacks octet based word into list of ON bit indexes

3949

<a name="l03925"></a>03925 \param w - value

3950

<a name="l03926"></a>03926 \param func - bit functor

3951

<a name="l03927"></a>03927

3952

<a name="l03928"></a>03928 @ingroup bitfunc

3953

<a name="l03929"></a>03929 */

3954

<a name="l03930"></a>03930 template<typename T, typename F>

3955

<a name="l03931"></a><a class="code" href="a00083.html#gb9f80b3c898323ce77beb915e4c861f3">03931</a> void <a class="code" href="a00083.html#gb9f80b3c898323ce77beb915e4c861f3" title="Templated algorithm to unpacks octet based word into list of ON bit indexes.">bit_for_each_4</a>(T w, F& func)

3956

<a name="l03932"></a>03932 {

3957

<a name="l03933"></a>03933 for (unsigned sub_octet = 0; w != 0; w >>= 4, sub_octet += 4)

3958

<a name="l03934"></a>03934 {

3959

<a name="l03935"></a>03935 switch (w & 15)

3960

<a name="l03936"></a>03936 {

3961

<a name="l03937"></a>03937 case 0: // 0000

3962

<a name="l03938"></a>03938 break;

3963

<a name="l03939"></a>03939 case 1: // 0001

3964

<a name="l03940"></a>03940 func(sub_octet);

3965

<a name="l03941"></a>03941 break;

3966

<a name="l03942"></a>03942 case 2: // 0010

3967

<a name="l03943"></a>03943 func(sub_octet + 1);

3968

<a name="l03944"></a>03944 break;

3969

<a name="l03945"></a>03945 case 3: // 0011

3970

<a name="l03946"></a>03946 func(sub_octet, sub_octet + 1);

3971

<a name="l03947"></a>03947 break;

3972

<a name="l03948"></a>03948 case 4: // 0100

3973

<a name="l03949"></a>03949 func(sub_octet + 2);

3974

<a name="l03950"></a>03950 break;

3975

<a name="l03951"></a>03951 case 5: // 0101

3976

<a name="l03952"></a>03952 func(sub_octet, sub_octet + 2);

3977

<a name="l03953"></a>03953 break;

3978

<a name="l03954"></a>03954 case 6: // 0110

3979

<a name="l03955"></a>03955 func(sub_octet + 1, sub_octet + 2);

3980

<a name="l03956"></a>03956 break;

3981

<a name="l03957"></a>03957 case 7: // 0111

3982

<a name="l03958"></a>03958 func(sub_octet, sub_octet + 1, sub_octet + 2);

3983

<a name="l03959"></a>03959 break;

3984

<a name="l03960"></a>03960 case 8: // 1000

3985

<a name="l03961"></a>03961 func(sub_octet + 3);

3986

<a name="l03962"></a>03962 break;

3987

<a name="l03963"></a>03963 case 9: // 1001

3988

<a name="l03964"></a>03964 func(sub_octet, sub_octet + 3);

3989

<a name="l03965"></a>03965 break;

3990

<a name="l03966"></a>03966 case 10: // 1010

3991

<a name="l03967"></a>03967 func(sub_octet + 1, sub_octet + 3);

3992

<a name="l03968"></a>03968 break;

3993

<a name="l03969"></a>03969 case 11: // 1011

3994

<a name="l03970"></a>03970 func(sub_octet, sub_octet + 1, sub_octet + 3);

3995

<a name="l03971"></a>03971 break;

3996

<a name="l03972"></a>03972 case 12: // 1100

3997

<a name="l03973"></a>03973 func(sub_octet + 2, sub_octet + 3);

3998

<a name="l03974"></a>03974 break;

3999

<a name="l03975"></a>03975 case 13: // 1101

4000

<a name="l03976"></a>03976 func(sub_octet, sub_octet + 2, sub_octet + 3);

4001

<a name="l03977"></a>03977 break;

4002

<a name="l03978"></a>03978 case 14: // 1110

4003

<a name="l03979"></a>03979 func(sub_octet + 1, sub_octet + 2, sub_octet + 3);

4004

<a name="l03980"></a>03980 break;

4005

<a name="l03981"></a>03981 case 15: // 1111

4006

<a name="l03982"></a>03982 func(sub_octet, sub_octet + 1, sub_octet + 2, sub_octet + 3);

4007

<a name="l03983"></a>03983 break;

4008

<a name="l03984"></a>03984 default:

4009

<a name="l03985"></a>03985 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);

4010

<a name="l03986"></a>03986 break;

4011

<a name="l03987"></a>03987 }

4012

<a name="l03988"></a>03988

4013

<a name="l03989"></a>03989 } // for

4014

<a name="l03990"></a>03990 }

4015

<a name="l03991"></a>03991

4016

<a name="l03992"></a>03992

4017

<a name="l03993"></a>03993 /*!

4018

<a name="l03994"></a>03994 \brief Templated algorithm to unpacks word into list of ON bit indexes

4019

<a name="l03995"></a>03995 \param w - value

4020

<a name="l03996"></a>03996 \param func - bit functor

4021

<a name="l03997"></a>03997

4022

<a name="l03998"></a>03998 @ingroup bitfunc

4023

<a name="l03999"></a>03999 */

4024

<a name="l04000"></a>04000 template<typename T, typename F>

4025

<a name="l04001"></a><a class="code" href="a00083.html#g24be2ad5d8c2a8f18fdad142452aaae8">04001</a> void <a class="code" href="a00083.html#g24be2ad5d8c2a8f18fdad142452aaae8" title="Templated algorithm to unpacks word into list of ON bit indexes.">bit_for_each</a>(T w, F& func)

4026

<a name="l04002"></a>04002 {

4027

<a name="l04003"></a>04003 // Note: 4-bit table method works slower than plain check approach

4028

<a name="l04004"></a>04004 for (unsigned octet = 0; w != 0; w >>= 8, octet += 8)

4029

<a name="l04005"></a>04005 {

4030

<a name="l04006"></a>04006 if (w & 1) func(octet + 0);

4031

<a name="l04007"></a>04007 if (w & 2) func(octet + 1);

4032

<a name="l04008"></a>04008 if (w & 4) func(octet + 2);

4033

<a name="l04009"></a>04009 if (w & 8) func(octet + 3);

4034

<a name="l04010"></a>04010 if (w & 16) func(octet + 4);

4035

<a name="l04011"></a>04011 if (w & 32) func(octet + 5);

4036

<a name="l04012"></a>04012 if (w & 64) func(octet + 6);

4037

<a name="l04013"></a>04013 if (w & 128) func(octet + 7);

4038

<a name="l04014"></a>04014

4039

<a name="l04015"></a>04015 } // for

4040

<a name="l04016"></a>04016 }

4041

<a name="l04017"></a>04017

4042

<a name="l04018"></a>04018 /*! @brief Adaptor to copy 1 bits to array

4043

<a name="l04019"></a>04019 @internal

4044

<a name="l04020"></a>04020 */

4045

<a name="l04021"></a><a class="code" href="a00038.html">04021</a> template<typename B> class <a class="code" href="a00038.html" title="Adaptor to copy 1 bits to array.">copy_to_array_functor</a>

4046

<a name="l04022"></a>04022 {

4047

<a name="l04023"></a>04023 public:

4048

<a name="l04024"></a><a class="code" href="a00038.html#1b1e4657ab4a7f79f1b9b69ece9c70d6">04024</a> <a class="code" href="a00038.html#1b1e4657ab4a7f79f1b9b69ece9c70d6">copy_to_array_functor</a>(B* bits): bp_(bits)

4049

<a name="l04025"></a>04025 {}

4050

<a name="l04026"></a>04026

4051

<a name="l04027"></a><a class="code" href="a00038.html#688a369de329c57e8b28159a9c320a44">04027</a> B* <a class="code" href="a00038.html#688a369de329c57e8b28159a9c320a44">ptr</a>() { return bp_; }

4052

<a name="l04028"></a>04028

4053

<a name="l04029"></a><a class="code" href="a00038.html#c6a8279c63d5479c7c20e2fad25eef71">04029</a> void <a class="code" href="a00038.html#c6a8279c63d5479c7c20e2fad25eef71">operator()</a>(unsigned bit_idx) { *bp_++ = (B)bit_idx; }

4054

<a name="l04030"></a>04030

4055

<a name="l04031"></a><a class="code" href="a00038.html#976500c6c53b3052aa4f55caaba84ca0">04031</a> void <a class="code" href="a00038.html#c6a8279c63d5479c7c20e2fad25eef71">operator()</a>(unsigned bit_idx0,

4056

<a name="l04032"></a>04032 unsigned bit_idx1)

4057

<a name="l04033"></a>04033 {

4058

<a name="l04034"></a>04034 bp_[0] = (B)bit_idx0;

4059

<a name="l04035"></a>04035 bp_[1] = (B)bit_idx1;

4060

<a name="l04036"></a>04036 bp_+=2;

4061

<a name="l04037"></a>04037 }

4062

<a name="l04038"></a><a class="code" href="a00038.html#2fc00d634984ae2dc78060c2a23715be">04038</a> void <a class="code" href="a00038.html#c6a8279c63d5479c7c20e2fad25eef71">operator()</a>(unsigned bit_idx0,

4063

<a name="l04039"></a>04039 unsigned bit_idx1,

4064

<a name="l04040"></a>04040 unsigned bit_idx2)

4065

<a name="l04041"></a>04041 {

4066

<a name="l04042"></a>04042 bp_[0] = (B)bit_idx0;

4067

<a name="l04043"></a>04043 bp_[1] = (B)bit_idx1;

4068

<a name="l04044"></a>04044 bp_[2] = (B)bit_idx2;

4069

<a name="l04045"></a>04045 bp_+=3;

4070

<a name="l04046"></a>04046 }

4071

<a name="l04047"></a><a class="code" href="a00038.html#9151cc8b0e9ad78c862e278d8fabe77e">04047</a> void <a class="code" href="a00038.html#c6a8279c63d5479c7c20e2fad25eef71">operator()</a>(unsigned bit_idx0,

4072

<a name="l04048"></a>04048 unsigned bit_idx1,

4073

<a name="l04049"></a>04049 unsigned bit_idx2,

4074

<a name="l04050"></a>04050 unsigned bit_idx3)

4075

<a name="l04051"></a>04051 {

4076

<a name="l04052"></a>04052 bp_[0] = (B)bit_idx0;

4077

<a name="l04053"></a>04053 bp_[1] = (B)bit_idx1;

4078

<a name="l04054"></a>04054 bp_[2] = (B)bit_idx2;

4079

<a name="l04055"></a>04055 bp_[3] = (B)bit_idx3;

4080

<a name="l04056"></a>04056 bp_+=4;

4081

<a name="l04057"></a>04057 }

4082

<a name="l04058"></a>04058

4083

<a name="l04059"></a>04059 private:

4084

<a name="l04060"></a>04060 <a class="code" href="a00038.html#1b1e4657ab4a7f79f1b9b69ece9c70d6">copy_to_array_functor</a>(const <a class="code" href="a00038.html" title="Adaptor to copy 1 bits to array.">copy_to_array_functor</a>&);

4085

<a name="l04061"></a>04061 <a class="code" href="a00038.html" title="Adaptor to copy 1 bits to array.">copy_to_array_functor</a>& operator=(const <a class="code" href="a00038.html" title="Adaptor to copy 1 bits to array.">copy_to_array_functor</a>&);

4086

<a name="l04062"></a>04062 private:

4087

<a name="l04063"></a>04063 B* bp_;

4088

<a name="l04064"></a>04064 };

4089

<a name="l04065"></a>04065

4090

<a name="l04066"></a>04066 /*!

4091

<a name="l04067"></a>04067 \brief Unpacks word into list of ON bit indexes (quad-bit based)

4092

<a name="l04068"></a>04068 \param w - value

4093

<a name="l04069"></a>04069 \param bits - pointer on the result array

4094

<a name="l04070"></a>04070 \return number of bits in the list

4095

<a name="l04071"></a>04071

4096

<a name="l04072"></a>04072 @ingroup bitfunc

4097

<a name="l04073"></a>04073 */

4098

<a name="l04074"></a><a class="code" href="a00083.html#g3c81f6bff8866ec3ed0a94903eee96b7">04074</a> template<typename T,typename B> unsigned <a class="code" href="a00083.html#g3c81f6bff8866ec3ed0a94903eee96b7" title="Unpacks word into list of ON bit indexes (quad-bit based).">bit_list_4</a>(T w, B* bits)

4099

<a name="l04075"></a>04075 {

4100

<a name="l04076"></a>04076 <a class="code" href="a00038.html" title="Adaptor to copy 1 bits to array.">copy_to_array_functor</a> func(bits);

4101

<a name="l04077"></a>04077 <a class="code" href="a00083.html#gb9f80b3c898323ce77beb915e4c861f3" title="Templated algorithm to unpacks octet based word into list of ON bit indexes.">bit_for_each_4</a>(w, func);

4102

<a name="l04078"></a>04078 return (unsigned)(func.<a class="code" href="a00038.html#688a369de329c57e8b28159a9c320a44">ptr</a>() - bits);

4103

<a name="l04079"></a>04079 }

4104

<a name="l04080"></a>04080

4105

<a name="l04081"></a>04081 /*!

4106

<a name="l04082"></a>04082 \brief Unpacks word into list of ON bit indexes

4107

<a name="l04083"></a>04083 \param w - value

4108

<a name="l04084"></a>04084 \param bits - pointer on the result array

4109

<a name="l04085"></a>04085 \return number of bits in the list

4110

<a name="l04086"></a>04086

4111

<a name="l04087"></a>04087 @ingroup bitfunc

4112

<a name="l04088"></a>04088 */

4113

<a name="l04089"></a><a class="code" href="a00083.html#gae3ae537760044543f842363e4614e82">04089</a> template<typename T,typename B> unsigned <a class="code" href="a00083.html#gae3ae537760044543f842363e4614e82" title="Unpacks word into list of ON bit indexes.">bit_list</a>(T w, B* bits)

4114

<a name="l04090"></a>04090 {

4115

<a name="l04091"></a>04091 <a class="code" href="a00038.html" title="Adaptor to copy 1 bits to array.">copy_to_array_functor</a> func(bits);

4116

<a name="l04092"></a>04092 <a class="code" href="a00083.html#g24be2ad5d8c2a8f18fdad142452aaae8" title="Templated algorithm to unpacks word into list of ON bit indexes.">bit_for_each</a>(w, func);

4117

<a name="l04093"></a>04093 return (unsigned)(func.<a class="code" href="a00038.html#688a369de329c57e8b28159a9c320a44">ptr</a>() - bits);

4118

<a name="l04094"></a>04094 /*

4119

<a name="l04095"></a>04095 // Note: 4-bit table method works slower than plain check approach

4120

<a name="l04096"></a>04096 unsigned octet = 0;

4121

<a name="l04097"></a>04097 B* bp = bits;

4122

<a name="l04098"></a>04098 do

4123

<a name="l04099"></a>04099 {

4124

<a name="l04100"></a>04100 if (w & 1) *bp++ = octet + 0;

4125

<a name="l04101"></a>04101 if (w & 2) *bp++ = octet + 1;

4126

<a name="l04102"></a>04102 if (w & 4) *bp++ = octet + 2;

4127

<a name="l04103"></a>04103 if (w & 8) *bp++ = octet + 3;

4128

<a name="l04104"></a>04104 if (w & 16) *bp++ = octet + 4;

4129

<a name="l04105"></a>04105 if (w & 32) *bp++ = octet + 5;

4130

<a name="l04106"></a>04106 if (w & 64) *bp++ = octet + 6;

4131

<a name="l04107"></a>04107 if (w & 128) *bp++ = octet + 7;

4132

<a name="l04108"></a>04108

4133

<a name="l04109"></a>04109 w >>= 8;

4134

<a name="l04110"></a>04110 octet += 8;

4135

<a name="l04111"></a>04111 } while (w);

4136

<a name="l04112"></a>04112 return (unsigned)(bp - bits);

4137

<a name="l04113"></a>04113 */

4138

<a name="l04114"></a>04114 }

4139

<a name="l04115"></a>04115

4140

<a name="l04116"></a>04116

4141

<a name="l04117"></a>04117 /*! @brief Calculates memory overhead for number of gap blocks sharing

4142

<a name="l04118"></a>04118 the same memory allocation table (level lengths table).

4143

<a name="l04119"></a>04119 @ingroup gapfunc

4144

<a name="l04120"></a>04120 */

4145

<a name="l04121"></a>04121 template<typename T>

4146

<a name="l04122"></a><a class="code" href="a00082.html#gcc578010f3700940829c600c812d23b1">04122</a> unsigned <a class="code" href="a00082.html#gcc578010f3700940829c600c812d23b1" title="Calculates memory overhead for number of gap blocks sharing the same memory allocation...">gap_overhead</a>(const T* length,

4147

<a name="l04123"></a>04123 const T* length_end,

4148

<a name="l04124"></a>04124 const T* glevel_len)

4149

<a name="l04125"></a>04125 {

4150

<a name="l04126"></a>04126 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(length && length_end && glevel_len);

4151

<a name="l04127"></a>04127

4152

<a name="l04128"></a>04128 unsigned overhead = 0;

4153

<a name="l04129"></a>04129 for (;length < length_end; ++length)

4154

<a name="l04130"></a>04130 {

4155

<a name="l04131"></a>04131 unsigned len = *length;

4156

<a name="l04132"></a>04132 int level = <a class="code" href="a00082.html#g3bfaebeeb4b2d479c5a9ac9d57607165" title="Calculates GAP block capacity level.">gap_calc_level</a>(len, glevel_len);

4157

<a name="l04133"></a>04133 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(level >= 0 && level < (int)<a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>);

4158

<a name="l04134"></a>04134 unsigned capacity = glevel_len[level];

4159

<a name="l04135"></a>04135 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(capacity >= len);

4160

<a name="l04136"></a>04136 overhead += capacity - len;

4161

<a name="l04137"></a>04137 }

4162

<a name="l04138"></a>04138 return overhead;

4163

<a name="l04139"></a>04139 }

4164

<a name="l04140"></a>04140

4165

<a name="l04141"></a>04141

4166

<a name="l04142"></a>04142 /*! @brief Finds optimal gap blocks lengths.

4167

<a name="l04143"></a>04143 @param length - first element of GAP lengths array

4168

<a name="l04144"></a>04144 @param length_end - end of the GAP lengths array

4169

<a name="l04145"></a>04145 @param glevel_len - destination GAP lengths array

4170

<a name="l04146"></a>04146 @ingroup gapfunc

4171

<a name="l04147"></a>04147 */

4172

<a name="l04148"></a>04148

4173

<a name="l04149"></a>04149 template<typename T>

4174

<a name="l04150"></a><a class="code" href="a00082.html#g2daff3a0ceda6fef87d3b0e892da5813">04150</a> bool <a class="code" href="a00082.html#g2daff3a0ceda6fef87d3b0e892da5813" title="Finds optimal gap blocks lengths.">improve_gap_levels</a>(const T* length,

4175

<a name="l04151"></a>04151 const T* length_end,

4176

<a name="l04152"></a>04152 T* glevel_len)

4177

<a name="l04153"></a>04153 {

4178

<a name="l04154"></a>04154 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(length && length_end && glevel_len);

4179

<a name="l04155"></a>04155

4180

<a name="l04156"></a>04156 size_t lsize = length_end - length;

4181

<a name="l04157"></a>04157

4182

<a name="l04158"></a>04158 <a class="code" href="a00063.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(lsize);

4183

<a name="l04159"></a>04159

4184

<a name="l04160"></a>04160 <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a> max_len = 0;

4185

<a name="l04161"></a>04161 unsigned i;

4186

<a name="l04162"></a>04162 for (i = 0; i < lsize; ++i)

4187

<a name="l04163"></a>04163 {

4188

<a name="l04164"></a>04164 if (length[i] > max_len)

4189

<a name="l04165"></a>04165 max_len = length[i];

4190

<a name="l04166"></a>04166 }

4191

<a name="l04167"></a>04167 if (max_len < 5 || lsize <= <a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>)

4192

<a name="l04168"></a>04168 {

4193

<a name="l04169"></a>04169 glevel_len[0] = max_len + 4;

4194

<a name="l04170"></a>04170 for (i = 1; i < <a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>; ++i)

4195

<a name="l04171"></a>04171 {

4196

<a name="l04172"></a>04172 glevel_len[i] = <a class="code" href="a00078.html#a5e01dfb650d168f9be0525e042af647">bm::gap_max_buff_len</a>;

4197

<a name="l04173"></a>04173 }

4198

<a name="l04174"></a>04174 return true;

4199

<a name="l04175"></a>04175 }

4200

<a name="l04176"></a>04176

4201

<a name="l04177"></a>04177 glevel_len[<a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>-1] = max_len + 5;

4202

<a name="l04178"></a>04178

4203

<a name="l04179"></a>04179 unsigned min_overhead = <a class="code" href="a00082.html#gcc578010f3700940829c600c812d23b1" title="Calculates memory overhead for number of gap blocks sharing the same memory allocation...">gap_overhead</a>(length, length_end, glevel_len);

4204

<a name="l04180"></a>04180 bool is_improved = false;

4205

<a name="l04181"></a>04181 <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a> prev_value = glevel_len[<a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>-1];

4206

<a name="l04182"></a>04182 //

4207

<a name="l04183"></a>04183 // main problem solving loop

4208

<a name="l04184"></a>04184 //

4209

<a name="l04185"></a>04185 for (i = <a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>-2; ; --i)

4210

<a name="l04186"></a>04186 {

4211

<a name="l04187"></a>04187 unsigned opt_len = 0;

4212

<a name="l04188"></a>04188 unsigned j;

4213

<a name="l04189"></a>04189 bool imp_flag = false;

4214

<a name="l04190"></a>04190 <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a> gap_saved_value = glevel_len[i];

4215

<a name="l04191"></a>04191 for (j = 0; j < lsize; ++j)

4216

<a name="l04192"></a>04192 {

4217

<a name="l04193"></a>04193 // if (length[j]+4 > prev_value)

4218

<a name="l04194"></a>04194 // continue;

4219

<a name="l04195"></a>04195

4220

<a name="l04196"></a>04196 glevel_len[i] = length[j]+4;

4221

<a name="l04197"></a>04197 unsigned ov = <a class="code" href="a00082.html#gcc578010f3700940829c600c812d23b1" title="Calculates memory overhead for number of gap blocks sharing the same memory allocation...">gap_overhead</a>(length, length_end, glevel_len);

4222

<a name="l04198"></a>04198 if (ov <= min_overhead)

4223

<a name="l04199"></a>04199 {

4224

<a name="l04200"></a>04200 min_overhead = ov;

4225

<a name="l04201"></a>04201 opt_len = length[j]+4;

4226

<a name="l04202"></a>04202 imp_flag = true;

4227

<a name="l04203"></a>04203 }

4228

<a name="l04204"></a>04204 }

4229

<a name="l04205"></a>04205 if (imp_flag) {

4230

<a name="l04206"></a>04206 glevel_len[i] = opt_len; // length[opt_idx]+4;

4231

<a name="l04207"></a>04207 is_improved = true;

4232

<a name="l04208"></a>04208 }

4233

<a name="l04209"></a>04209 else

4234

<a name="l04210"></a>04210 {

4235

<a name="l04211"></a>04211 glevel_len[i] = gap_saved_value;

4236

<a name="l04212"></a>04212 }

4237

<a name="l04213"></a>04213 if (i == 0)

4238

<a name="l04214"></a>04214 break;

4239

<a name="l04215"></a>04215 prev_value = glevel_len[i];

4240

<a name="l04216"></a>04216 }

4241

<a name="l04217"></a>04217 //

4242

<a name="l04218"></a>04218 // Remove duplicates

4243

<a name="l04219"></a>04219 //

4244

<a name="l04220"></a>04220

4245

<a name="l04221"></a>04221 T val = *glevel_len;

4246

<a name="l04222"></a>04222 T* gp = glevel_len;

4247

<a name="l04223"></a>04223 T* res = glevel_len;

4248

<a name="l04224"></a>04224 for (i = 0; i < <a class="code" href="a00078.html#773e9f5341919d58000bd54d50038733">bm::gap_levels</a>; ++i)

4249

<a name="l04225"></a>04225 {

4250

<a name="l04226"></a>04226 if (val != *gp)

4251

<a name="l04227"></a>04227 {

4252

<a name="l04228"></a>04228 val = *gp;

4253

<a name="l04229"></a>04229 *++res = val;

4254

<a name="l04230"></a>04230 }

4255

<a name="l04231"></a>04231 ++gp;

4256

<a name="l04232"></a>04232 }

4257

<a name="l04233"></a>04233

4258

<a name="l04234"></a>04234 // Filling the "unused" part with max. possible value

4259

<a name="l04235"></a>04235 while (++res < (glevel_len + bm::gap_levels))

4260

<a name="l04236"></a>04236 {

4261

<a name="l04237"></a>04237 *res = <a class="code" href="a00078.html#a5e01dfb650d168f9be0525e042af647">bm::gap_max_buff_len</a>;

4262

<a name="l04238"></a>04238 }

4263

<a name="l04239"></a>04239

4264

<a name="l04240"></a>04240 return is_improved;

4265

<a name="l04241"></a>04241

4266

<a name="l04242"></a>04242 }

4267

<a name="l04243"></a>04243

4268

<a name="l04244"></a>04244

4269

<a name="l04245"></a>04245

4270

<a name="l04246"></a>04246 /**

4271

<a name="l04247"></a>04247 Bit-block get adapter, takes bitblock and represents it as a

4272

<a name="l04248"></a>04248 get_32() accessor function

4273

<a name="l04249"></a>04249 /internal

4274

<a name="l04250"></a>04250 */

4275

<a name="l04251"></a><a class="code" href="a00028.html">04251</a> class <a class="code" href="a00028.html" title="Bit-block get adapter, takes bitblock and represents it as a get_32() accessor function...">bitblock_get_adapter</a>

4276

<a name="l04252"></a>04252 {

4277

<a name="l04253"></a>04253 public:

4278

<a name="l04254"></a><a class="code" href="a00028.html#266256a390509d2f87926bd2bac7748d">04254</a> <a class="code" href="a00028.html#266256a390509d2f87926bd2bac7748d">bitblock_get_adapter</a>(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* bit_block) : b_(bit_block) {}

4279

<a name="l04255"></a>04255

4280

<a name="l04256"></a>04256 <a class="code" href="a00063.html#938734d014fb68dd8b2251fe8ec2b025">BMFORCEINLINE</a>

4281

<a name="l04257"></a><a class="code" href="a00028.html#5fd937c34bcb5e5a2f6aa25333480db2">04257</a> <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> <a class="code" href="a00028.html#5fd937c34bcb5e5a2f6aa25333480db2">get_32</a>() { return *b_++; }

4282

<a name="l04258"></a>04258 private:

4283

<a name="l04259"></a>04259 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* b_;

4284

<a name="l04260"></a>04260 };

4285

<a name="l04261"></a>04261

4286

<a name="l04262"></a>04262

4287

<a name="l04263"></a>04263 /**

4288

<a name="l04264"></a>04264 Bit-block store adapter, takes bitblock and saves results into it

4289

<a name="l04265"></a>04265 /internal

4290

<a name="l04266"></a>04266 */

4291

<a name="l04267"></a><a class="code" href="a00029.html">04267</a> class <a class="code" href="a00029.html" title="Bit-block store adapter, takes bitblock and saves results into it /internal.">bitblock_store_adapter</a>

4292

<a name="l04268"></a>04268 {

4293

<a name="l04269"></a>04269 public:

4294

<a name="l04270"></a><a class="code" href="a00029.html#309083bbfd6b6206329d3407624f6e8c">04270</a> <a class="code" href="a00029.html#309083bbfd6b6206329d3407624f6e8c">bitblock_store_adapter</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* bit_block) : b_(bit_block) {}

4295

<a name="l04271"></a>04271 <a class="code" href="a00063.html#938734d014fb68dd8b2251fe8ec2b025">BMFORCEINLINE</a>

4296

<a name="l04272"></a><a class="code" href="a00029.html#04ab146560605d7d4a158d736ada3d74">04272</a> void <a class="code" href="a00029.html#04ab146560605d7d4a158d736ada3d74">push_back</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> w) { *b_++ = w; }

4297

<a name="l04273"></a>04273 private:

4298

<a name="l04274"></a>04274 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* b_;

4299

<a name="l04275"></a>04275 };

4300

<a name="l04276"></a>04276

4301

<a name="l04277"></a>04277 /**

4302

<a name="l04278"></a>04278 Bit-block sum adapter, takes values and sums it

4303

<a name="l04279"></a>04279 /internal

4304

<a name="l04280"></a>04280 */

4305

<a name="l04281"></a><a class="code" href="a00030.html">04281</a> class <a class="code" href="a00030.html" title="Bit-block sum adapter, takes values and sums it /internal.">bitblock_sum_adapter</a>

4306

<a name="l04282"></a>04282 {

4307

<a name="l04283"></a>04283 public:

4308

<a name="l04284"></a><a class="code" href="a00030.html#3a94e2bd54a12b27d94a62f9ae4628ee">04284</a> <a class="code" href="a00030.html#3a94e2bd54a12b27d94a62f9ae4628ee">bitblock_sum_adapter</a>() : sum_(0) {}

4309

<a name="l04285"></a>04285 <a class="code" href="a00063.html#938734d014fb68dd8b2251fe8ec2b025">BMFORCEINLINE</a>

4310

<a name="l04286"></a><a class="code" href="a00030.html#c7612d277b35a664989c8299f8da744c">04286</a> void <a class="code" href="a00030.html#c7612d277b35a664989c8299f8da744c">push_back</a>(<a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> w) { this->sum_+= w; }

4311

<a name="l04287"></a>04287 /// Get accumulated sum

4312

<a name="l04288"></a><a class="code" href="a00030.html#cc6c1b9a9929baee75d4729644037885">04288</a> <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> <a class="code" href="a00030.html#cc6c1b9a9929baee75d4729644037885" title="Get accumulated sum.">sum</a>() const { return this->sum_; }

4313

<a name="l04289"></a>04289 private:

4314

<a name="l04290"></a>04290 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> sum_;

4315

<a name="l04291"></a>04291 };

4316

<a name="l04292"></a>04292

4317

<a name="l04293"></a>04293 /**

4318

<a name="l04294"></a>04294 Adapter to get words from a range stream

4319

<a name="l04295"></a>04295 (see range serialized bit-block)

4320

<a name="l04296"></a>04296 \internal

4321

<a name="l04297"></a>04297 */

4322

<a name="l04298"></a><a class="code" href="a00045.html">04298</a> template<class DEC> class <a class="code" href="a00045.html" title="Adapter to get words from a range stream (see range serialized bit-block).">decoder_range_adapter</a>

4323

<a name="l04299"></a>04299 {

4324

<a name="l04300"></a>04300 public:

4325

<a name="l04301"></a><a class="code" href="a00045.html#cef081bdb43b428cb65663ad422b2bd3">04301</a> <a class="code" href="a00045.html#cef081bdb43b428cb65663ad422b2bd3">decoder_range_adapter</a>(DEC& dec, unsigned from_idx, unsigned to_idx)

4326

<a name="l04302"></a>04302 : decoder_(dec),

4327

<a name="l04303"></a>04303 from_(from_idx),

4328

<a name="l04304"></a>04304 to_(to_idx),

4329

<a name="l04305"></a>04305 cnt_(0)

4330

<a name="l04306"></a>04306 {}

4331

<a name="l04307"></a>04307

4332

<a name="l04308"></a><a class="code" href="a00045.html#42cd4bd363dec579dab6c0f5b2939562">04308</a> <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> <a class="code" href="a00045.html#42cd4bd363dec579dab6c0f5b2939562">get_32</a>()

4333

<a name="l04309"></a>04309 {

4334

<a name="l04310"></a>04310 if (cnt_ < from_ || cnt_ > to_)

4335

<a name="l04311"></a>04311 {

4336

<a name="l04312"></a>04312 ++cnt_; return 0;

4337

<a name="l04313"></a>04313 }

4338

<a name="l04314"></a>04314 ++cnt_;

4339

<a name="l04315"></a>04315 return decoder_.get_32();

4340

<a name="l04316"></a>04316 }

4341

<a name="l04317"></a>04317

4342

<a name="l04318"></a>04318 private:

4343

<a name="l04319"></a>04319 DEC& decoder_;

4344

<a name="l04320"></a>04320 unsigned from_;

4345

<a name="l04321"></a>04321 unsigned to_;

4346

<a name="l04322"></a>04322 unsigned cnt_;

4347

<a name="l04323"></a>04323 };

4348

<a name="l04324"></a>04324

4349

<a name="l04325"></a>04325

4350

<a name="l04326"></a>04326 /*!

4351

<a name="l04327"></a>04327 Abstract recombination algorithm for two bit-blocks

4352

<a name="l04328"></a>04328 Bit blocks can come as dserialization decoders or bit-streams

4353

<a name="l04329"></a>04329 */

4354

<a name="l04330"></a>04330 template<class It1, class It2, class BinaryOp, class Encoder>

4355

<a name="l04331"></a><a class="code" href="a00078.html#503fecc0ee281059897412d68f489e1e">04331</a> void <a class="code" href="a00078.html#503fecc0ee281059897412d68f489e1e">bit_recomb</a>(It1& it1, It2& it2,

4356

<a name="l04332"></a>04332 BinaryOp& op,

4357

<a name="l04333"></a>04333 Encoder& enc,

4358

<a name="l04334"></a>04334 unsigned block_size = <a class="code" href="a00078.html#91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>)

4359

<a name="l04335"></a>04335 {

4360

<a name="l04336"></a>04336 for (unsigned i = 0; i < block_size; ++i)

4361

<a name="l04337"></a>04337 {

4362

<a name="l04338"></a>04338 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> w1 = it1.get_32();

4363

<a name="l04339"></a>04339 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> w2 = it2.get_32();

4364

<a name="l04340"></a>04340 <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> w = op(w1, w2);

4365

<a name="l04341"></a>04341 enc.push_back( w );

4366

<a name="l04342"></a>04342 } // for

4367

<a name="l04343"></a>04343 }

4368

<a name="l04344"></a>04344

4369

<a name="l04345"></a>04345 /// Bit AND functor

4370

<a name="l04346"></a><a class="code" href="a00013.html">04346</a> template<typename W> struct <a class="code" href="a00013.html" title="Bit AND functor.">bit_AND</a>

4371

<a name="l04347"></a>04347 {

4372

<a name="l04348"></a><a class="code" href="a00013.html#158a14b25ed6831c7fefd64695fc816c">04348</a> W <a class="code" href="a00013.html#158a14b25ed6831c7fefd64695fc816c">operator()</a>(W w1, W w2) { return w1 & w2; }

4373

<a name="l04349"></a>04349 };

4374

<a name="l04350"></a>04350

4375

<a name="l04351"></a>04351 /// Bit OR functor

4376

<a name="l04352"></a><a class="code" href="a00024.html">04352</a> template<typename W> struct <a class="code" href="a00024.html" title="Bit OR functor.">bit_OR</a>

4377

<a name="l04353"></a>04353 {

4378

<a name="l04354"></a><a class="code" href="a00024.html#f6b753153686968b4fad2871ea7f60f2">04354</a> W <a class="code" href="a00024.html#f6b753153686968b4fad2871ea7f60f2">operator()</a>(W w1, W w2) { return w1 | w2; }

4379

<a name="l04355"></a>04355 };

4380

<a name="l04356"></a>04356

4381

<a name="l04357"></a>04357 /// Bit SUB functor

4382

<a name="l04358"></a><a class="code" href="a00025.html">04358</a> template<typename W> struct <a class="code" href="a00025.html" title="Bit SUB functor.">bit_SUB</a>

4383

<a name="l04359"></a>04359 {

4384

<a name="l04360"></a><a class="code" href="a00025.html#bd0415edafa50c93116c66314cb88148">04360</a> W <a class="code" href="a00025.html#bd0415edafa50c93116c66314cb88148">operator()</a>(W w1, W w2) { return w1 & ~w2; }

4385

<a name="l04361"></a>04361 };

4386

<a name="l04362"></a>04362

4387

<a name="l04363"></a>04363 /// Bit XOR functor

4388

<a name="l04364"></a><a class="code" href="a00026.html">04364</a> template<typename W> struct <a class="code" href="a00026.html" title="Bit XOR functor.">bit_XOR</a>

4389

<a name="l04365"></a>04365 {

4390

<a name="l04366"></a><a class="code" href="a00026.html#21cb402c91174d72ca7fe473b9e22bd8">04366</a> W <a class="code" href="a00026.html#21cb402c91174d72ca7fe473b9e22bd8">operator()</a>(W w1, W w2) { return w1 ^ w2; }

4391

<a name="l04367"></a>04367 };

4392

<a name="l04368"></a>04368

4393

<a name="l04369"></a>04369 /// Bit ASSIGN functor

4394

<a name="l04370"></a><a class="code" href="a00014.html">04370</a> template<typename W> struct <a class="code" href="a00014.html" title="Bit ASSIGN functor.">bit_ASSIGN</a>

4395

<a name="l04371"></a>04371 {

4396

<a name="l04372"></a><a class="code" href="a00014.html#870b61da95d05789a6cda3d57df7053e">04372</a> W <a class="code" href="a00014.html#870b61da95d05789a6cda3d57df7053e">operator()</a>(W w1, W w2) { return w2; }

4397

<a name="l04373"></a>04373 };

4398

<a name="l04374"></a>04374

4399

<a name="l04375"></a>04375 /// Bit COUNT functor

4400

<a name="l04376"></a><a class="code" href="a00015.html">04376</a> template<typename W> struct <a class="code" href="a00015.html" title="Bit COUNT functor.">bit_COUNT</a>

4401

<a name="l04377"></a>04377 {

4402

<a name="l04378"></a><a class="code" href="a00015.html#6241ea700bd682e3f0c35c679f80c352">04378</a> W <a class="code" href="a00015.html#6241ea700bd682e3f0c35c679f80c352">operator()</a>(W w1, W w2)

4403

<a name="l04379"></a>04379 {

4404

<a name="l04380"></a>04380 w1 = 0;

4405

<a name="l04381"></a>04381 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(w1, w2);

4406

<a name="l04382"></a>04382 return w1;

4407

<a name="l04383"></a>04383 }

4408

<a name="l04384"></a>04384 };

4409

<a name="l04385"></a>04385

4410

<a name="l04386"></a>04386 /// Bit COUNT AND functor

4411

<a name="l04387"></a><a class="code" href="a00017.html">04387</a> template<typename W> struct <a class="code" href="a00017.html" title="Bit COUNT AND functor.">bit_COUNT_AND</a>

4412

<a name="l04388"></a>04388 {

4413

<a name="l04389"></a><a class="code" href="a00017.html#c5e35266fd22b666d2e47922585e0bd4">04389</a> W <a class="code" href="a00017.html#c5e35266fd22b666d2e47922585e0bd4">operator()</a>(W w1, W w2)

4414

<a name="l04390"></a>04390 {

4415

<a name="l04391"></a>04391 W r = 0;

4416

<a name="l04392"></a>04392 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(r, w1 & w2);

4417

<a name="l04393"></a>04393 return r;

4418

<a name="l04394"></a>04394 }

4419

<a name="l04395"></a>04395 };

4420

<a name="l04396"></a>04396

4421

<a name="l04397"></a>04397 /// Bit COUNT XOR functor

4422

<a name="l04398"></a><a class="code" href="a00023.html">04398</a> template<typename W> struct <a class="code" href="a00023.html" title="Bit COUNT XOR functor.">bit_COUNT_XOR</a>

4423

<a name="l04399"></a>04399 {

4424

<a name="l04400"></a><a class="code" href="a00023.html#f51df3f3d2a924fe77c157203cce4105">04400</a> W <a class="code" href="a00023.html#f51df3f3d2a924fe77c157203cce4105">operator()</a>(W w1, W w2)

4425

<a name="l04401"></a>04401 {

4426

<a name="l04402"></a>04402 W r = 0;

4427

<a name="l04403"></a>04403 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(r, w1 ^ w2);

4428

<a name="l04404"></a>04404 return r;

4429

<a name="l04405"></a>04405 }

4430

<a name="l04406"></a>04406 };

4431

<a name="l04407"></a>04407

4432

<a name="l04408"></a>04408 /// Bit COUNT OR functor

4433

<a name="l04409"></a><a class="code" href="a00019.html">04409</a> template<typename W> struct <a class="code" href="a00019.html" title="Bit COUNT OR functor.">bit_COUNT_OR</a>

4434

<a name="l04410"></a>04410 {

4435

<a name="l04411"></a><a class="code" href="a00019.html#6e7b8d564dc730e304e55975a85602cd">04411</a> W <a class="code" href="a00019.html#6e7b8d564dc730e304e55975a85602cd">operator()</a>(W w1, W w2)

4436

<a name="l04412"></a>04412 {

4437

<a name="l04413"></a>04413 W r = 0;

4438

<a name="l04414"></a>04414 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(r, w1 | w2);

4439

<a name="l04415"></a>04415 return r;

4440

<a name="l04416"></a>04416 }

4441

<a name="l04417"></a>04417 };

4442

<a name="l04418"></a>04418

4443

<a name="l04419"></a>04419

4444

<a name="l04420"></a>04420 /// Bit COUNT SUB AB functor

4445

<a name="l04421"></a><a class="code" href="a00020.html">04421</a> template<typename W> struct <a class="code" href="a00020.html" title="Bit COUNT SUB AB functor.">bit_COUNT_SUB_AB</a>

4446

<a name="l04422"></a>04422 {

4447

<a name="l04423"></a><a class="code" href="a00020.html#27efa5d69da163f699b58f8cf30cc7a8">04423</a> W <a class="code" href="a00020.html#27efa5d69da163f699b58f8cf30cc7a8">operator()</a>(W w1, W w2)

4448

<a name="l04424"></a>04424 {

4449

<a name="l04425"></a>04425 W r = 0;

4450

<a name="l04426"></a>04426 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(r, w1 & (~w2));

4451

<a name="l04427"></a>04427 return r;

4452

<a name="l04428"></a>04428 }

4453

<a name="l04429"></a>04429 };

4454

<a name="l04430"></a>04430

4455

<a name="l04431"></a>04431 /// Bit SUB BA functor

4456

<a name="l04432"></a><a class="code" href="a00021.html">04432</a> template<typename W> struct <a class="code" href="a00021.html" title="Bit SUB BA functor.">bit_COUNT_SUB_BA</a>

4457

<a name="l04433"></a>04433 {

4458

<a name="l04434"></a><a class="code" href="a00021.html#f182abdd0dc2c8e13c2ee8c7e91ee086">04434</a> W <a class="code" href="a00021.html#f182abdd0dc2c8e13c2ee8c7e91ee086">operator()</a>(W w1, W w2)

4459

<a name="l04435"></a>04435 {

4460

<a name="l04436"></a>04436 W r = 0;

4461

<a name="l04437"></a>04437 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(r, w2 & (~w1));

4462

<a name="l04438"></a>04438 return r;

4463

<a name="l04439"></a>04439 }

4464

<a name="l04440"></a>04440 };

4465

<a name="l04441"></a>04441

4466

<a name="l04442"></a>04442 /// Bit COUNT A functor

4467

<a name="l04443"></a><a class="code" href="a00016.html">04443</a> template<typename W> struct <a class="code" href="a00016.html" title="Bit COUNT A functor.">bit_COUNT_A</a>

4468

<a name="l04444"></a>04444 {

4469

<a name="l04445"></a><a class="code" href="a00016.html#fb9ecfc944e0e77280c15eb566ed7823">04445</a> W <a class="code" href="a00016.html#fb9ecfc944e0e77280c15eb566ed7823">operator()</a>(W w1, W w2)

4470

<a name="l04446"></a>04446 {

4471

<a name="l04447"></a>04447 W r = 0;

4472

<a name="l04448"></a>04448 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(r, w1);

4473

<a name="l04449"></a>04449 return r;

4474

<a name="l04450"></a>04450 }

4475

<a name="l04451"></a>04451 };

4476

<a name="l04452"></a>04452

4477

<a name="l04453"></a>04453 /// Bit COUNT B functor

4478

<a name="l04454"></a><a class="code" href="a00018.html">04454</a> template<typename W> struct <a class="code" href="a00018.html" title="Bit COUNT B functor.">bit_COUNT_B</a>

4479

<a name="l04455"></a>04455 {

4480

<a name="l04456"></a><a class="code" href="a00018.html#93802670706a36aae11a651ac68c2b6d">04456</a> W <a class="code" href="a00018.html#93802670706a36aae11a651ac68c2b6d">operator()</a>(W w1, W w2)

4481

<a name="l04457"></a>04457 {

4482

<a name="l04458"></a>04458 W r = 0;

4483

<a name="l04459"></a>04459 <a class="code" href="a00083.html#g967f6a5264f47d8adb93f6bdf8cdc129">BM_INCWORD_BITCOUNT</a>(r, w2);

4484

<a name="l04460"></a>04460 return r;

4485

<a name="l04461"></a>04461 }

4486

<a name="l04462"></a>04462 };

4487

<a name="l04463"></a>04463

4488

<a name="l04464"></a>04464 typedef

4489

<a name="l04465"></a><a class="code" href="a00078.html#18a8f03b151ca3a6d5e39e7709fb6c7c">04465</a> void (*<a class="code" href="a00078.html#18a8f03b151ca3a6d5e39e7709fb6c7c">gap_operation_to_bitset_func_type</a>)(unsigned*,

4490

<a name="l04466"></a>04466 const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>*);

4491

<a name="l04467"></a>04467

4492

<a name="l04468"></a>04468 typedef

4493

<a name="l04469"></a><a class="code" href="a00078.html#6d273f6e93ebb6d9fbc0346edd073bcb">04469</a> <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>* (*gap_operation_func_type)(const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>*,

4494

<a name="l04470"></a>04470 const <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>*,

4495

<a name="l04471"></a>04471 <a class="code" href="a00078.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>*);

4496

<a name="l04472"></a>04472

4497

<a name="l04473"></a>04473 typedef

4498

<a name="l04474"></a><a class="code" href="a00078.html#7b51373d2cc94c0d21a593a6fd789d96">04474</a> <a class="code" href="a00078.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> (*<a class="code" href="a00078.html#7b51373d2cc94c0d21a593a6fd789d96">bit_operation_count_func_type</a>)(const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* ,

4499

<a name="l04475"></a>04475 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*,

4500

<a name="l04476"></a>04476 const <a class="code" href="a00078.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*);

4501

<a name="l04477"></a>04477

4502

<a name="l04478"></a>04478

4503

<a name="l04479"></a>04479 template<bool T>

4504

<a name="l04480"></a><a class="code" href="a00056.html">04480</a> struct <a class="code" href="a00056.html">operation_functions</a>

4505

<a name="l04481"></a>04481 {

4506

<a name="l04482"></a>04482 static

4507

<a name="l04483"></a><a class="code" href="a00056.html#ee09fac26fae4f59affa6ef4eeaea757">04483</a> <a class="code" href="a00078.html#18a8f03b151ca3a6d5e39e7709fb6c7c">gap_operation_to_bitset_func_type</a> <a class="code" href="a00056.html#ee09fac26fae4f59affa6ef4eeaea757">gap2bit_table_</a>[<a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109d894d257a23664720dbf4155153a1e5c">bm::set_END</a>];

4508

<a name="l04484"></a>04484 static

4509

<a name="l04485"></a><a class="code" href="a00056.html#ed0f01bb28a3bc16c7362d9fdb0e34b1">04485</a> <a class="code" href="a00078.html#6d273f6e93ebb6d9fbc0346edd073bcb">gap_operation_func_type</a> <a class="code" href="a00056.html#ed0f01bb28a3bc16c7362d9fdb0e34b1">gapop_table_</a>[<a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109d894d257a23664720dbf4155153a1e5c">bm::set_END</a>];

4510

<a name="l04486"></a>04486 static

4511

<a name="l04487"></a><a class="code" href="a00056.html#7c99937be5149113db2007bc554fbfb6">04487</a> <a class="code" href="a00078.html#7b51373d2cc94c0d21a593a6fd789d96">bit_operation_count_func_type</a> <a class="code" href="a00056.html#7c99937be5149113db2007bc554fbfb6">bit_op_count_table_</a>[<a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109d894d257a23664720dbf4155153a1e5c">bm::set_END</a>];

4512

<a name="l04488"></a>04488

4513

<a name="l04489"></a>04489 static

4514

<a name="l04490"></a><a class="code" href="a00056.html#691347341c16758acd97a7cebaf2d28e">04490</a> <a class="code" href="a00078.html#18a8f03b151ca3a6d5e39e7709fb6c7c">gap_operation_to_bitset_func_type</a> <a class="code" href="a00056.html#691347341c16758acd97a7cebaf2d28e">gap_op_to_bit</a>(unsigned i)

4515

<a name="l04491"></a>04491 {

4516

<a name="l04492"></a>04492 return <a class="code" href="a00056.html#ee09fac26fae4f59affa6ef4eeaea757">gap2bit_table_</a>[i];

4517

<a name="l04493"></a>04493 }

4518

<a name="l04494"></a>04494

4519

<a name="l04495"></a>04495 static

4520

<a name="l04496"></a><a class="code" href="a00056.html#dc10260f808b51e3870e1bbc7e5dffd4">04496</a> <a class="code" href="a00078.html#6d273f6e93ebb6d9fbc0346edd073bcb">gap_operation_func_type</a> <a class="code" href="a00056.html#dc10260f808b51e3870e1bbc7e5dffd4">gap_operation</a>(unsigned i)

4521

<a name="l04497"></a>04497 {

4522

<a name="l04498"></a>04498 return <a class="code" href="a00056.html#ed0f01bb28a3bc16c7362d9fdb0e34b1">gapop_table_</a>[i];

4523

<a name="l04499"></a>04499 }

4524

<a name="l04500"></a>04500

4525

<a name="l04501"></a>04501 static

4526

<a name="l04502"></a><a class="code" href="a00056.html#4fc04066445af644759bf65ebf765760">04502</a> <a class="code" href="a00078.html#7b51373d2cc94c0d21a593a6fd789d96">bit_operation_count_func_type</a> <a class="code" href="a00056.html#4fc04066445af644759bf65ebf765760">bit_operation_count</a>(unsigned i)

4527

<a name="l04503"></a>04503 {

4528

<a name="l04504"></a>04504 return <a class="code" href="a00056.html#7c99937be5149113db2007bc554fbfb6">bit_op_count_table_</a>[i];

4529

<a name="l04505"></a>04505 }

4530

<a name="l04506"></a>04506 };

4531

<a name="l04507"></a>04507

4532

<a name="l04508"></a>04508 template<bool T>

4533

<a name="l04509"></a>04509 <a class="code" href="a00078.html#18a8f03b151ca3a6d5e39e7709fb6c7c">gap_operation_to_bitset_func_type</a>

4534

<a name="l04510"></a>04510 operation_functions<T>::gap2bit_table_[<a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109d894d257a23664720dbf4155153a1e5c">bm::set_END</a>] = {

4535

<a name="l04511"></a>04511 &gap_and_to_bitset<bm::gap_word_t>, // set_AND

4536

<a name="l04512"></a>04512 &gap_add_to_bitset<bm::gap_word_t>, // set_OR

4537

<a name="l04513"></a>04513 &gap_sub_to_bitset<bm::gap_word_t>, // set_SUB

4538

<a name="l04514"></a>04514 &gap_xor_to_bitset<bm::gap_word_t>, // set_XOR

4539

<a name="l04515"></a>04515 0

4540

<a name="l04516"></a>04516 };

4541

<a name="l04517"></a>04517

4542

<a name="l04518"></a>04518 template<bool T>

4543

<a name="l04519"></a>04519 <a class="code" href="a00078.html#6d273f6e93ebb6d9fbc0346edd073bcb">gap_operation_func_type</a>

4544

<a name="l04520"></a>04520 operation_functions<T>::gapop_table_[<a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109d894d257a23664720dbf4155153a1e5c">bm::set_END</a>] = {

4545

<a name="l04521"></a>04521 &<a class="code" href="a00082.html#g85662839207d06d07ae026c72b1f01c2" title="GAP AND operation.">gap_operation_and</a>, // set_AND

4546

<a name="l04522"></a>04522 &<a class="code" href="a00082.html#g9f62f1af74e44064f7407ec897b1b0b4" title="GAP OR operation.">gap_operation_or</a>, // set_OR

4547

<a name="l04523"></a>04523 &<a class="code" href="a00082.html#g0dcdf6a933f8f8bf901e258266a67c5f" title="GAP SUB (AND NOT) operation.">gap_operation_sub</a>, // set_SUB

4548

<a name="l04524"></a>04524 &<a class="code" href="a00082.html#g77553da699f68743fb12ebc6f6b0e477" title="GAP XOR operation.">gap_operation_xor</a>, // set_XOR

4549

<a name="l04525"></a>04525 0

4550

<a name="l04526"></a>04526 };

4551

<a name="l04527"></a>04527

4552

<a name="l04528"></a>04528

4553

<a name="l04529"></a>04529 template<bool T>

4554

<a name="l04530"></a>04530 <a class="code" href="a00078.html#7b51373d2cc94c0d21a593a6fd789d96">bit_operation_count_func_type</a>

4555

<a name="l04531"></a>04531 operation_functions<T>::bit_op_count_table_[<a class="code" href="a00078.html#76b70d2b9182a6dcac151d1bd9ec6109d894d257a23664720dbf4155153a1e5c">bm::set_END</a>] = {

4556

<a name="l04532"></a>04532 0, // set_AND

4557

<a name="l04533"></a>04533 0, // set_OR

4558

<a name="l04534"></a>04534 0, // set_SUB

4559

<a name="l04535"></a>04535 0, // set_XOR

4560

<a name="l04536"></a>04536 0, // set_ASSIGN

4561

<a name="l04537"></a>04537 0, // set_COUNT

4562

<a name="l04538"></a>04538 &<a class="code" href="a00083.html#g9765914087df2fc22ec18db8128f2a12" title="Performs bitblock AND operation and calculates bitcount of the result.">bit_operation_and_count</a>, // set_COUNT_AND

4563

<a name="l04539"></a>04539 &<a class="code" href="a00083.html#gce08ab77feefb638daee164ee83118bc" title="Performs bitblock XOR operation and calculates bitcount of the result.">bit_operation_xor_count</a>, // set_COUNT_XOR

4564

<a name="l04540"></a>04540 &<a class="code" href="a00083.html#g5a267aff3b56cc6dadf5a3a338e00a1d" title="Performs bitblock OR operation and calculates bitcount of the result.">bit_operation_or_count</a>, // set_COUNT_OR

4565

<a name="l04541"></a>04541 &<a class="code" href="a00083.html#gabb39bf01bf973cb7bf3648873921ab7" title="Performs bitblock SUB operation and calculates bitcount of the result.">bit_operation_sub_count</a>, // set_COUNT_SUB_AB

4566

<a name="l04542"></a>04542 &<a class="code" href="a00083.html#g53867faf377db72324b858a37063c0b8" title="Performs inverted bitblock SUB operation and calculates bitcount of the result.">bit_operation_sub_count_inv</a>, // set_COUNT_SUB_BA

4567

<a name="l04543"></a>04543 0, // set_COUNT_A

4568

<a name="l04544"></a>04544 0, // set_COUNT_B

4569

<a name="l04545"></a>04545 };

4570

<a name="l04546"></a>04546

4571

<a name="l04547"></a>04547 } // namespace bm

4572

<a name="l04548"></a>04548

4573

<a name="l04549"></a>04549 #endif

4574

<a name="l04550"></a>04550

4575

</pre></div></div>

4576

<hr size="1"><address style="text-align: right;">Generated on Sun Jul 12 10:40:28 2009 for BitMagic by

4577

4578

4579

</body>

4580

</html>

Older »