53
53
<a name="l00026"></a>00026 <span class="comment"></span>
54
54
<a name="l00027"></a>00027 <span class="comment">*/</span>
55
55
<a name="l00028"></a>00028
56
<a name="l00029"></a>00029 <span class="preprocessor">#ifdef _MSC_VER</span>
57
<a name="l00030"></a>00030 <span class="preprocessor"></span><span class="preprocessor">#pragma warning( disable : 4311 4312)</span>
58
<a name="l00031"></a>00031 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
59
<a name="l00032"></a>00032 <span class="preprocessor"></span>
60
<a name="l00033"></a>00033 <span class="preprocessor">#include "<a class="code" href="a00093.html">bmdef.h</a>"</span>
56
<a name="l00029"></a>00029 <span class="preprocessor">#include <stdlib.h></span>
57
<a name="l00030"></a>00030 <span class="preprocessor">#include <new></span>
58
<a name="l00031"></a>00031
59
<a name="l00032"></a>00032 <span class="keyword">namespace </span>bm
60
<a name="l00033"></a>00033 {
61
61
<a name="l00034"></a>00034
62
<a name="l00035"></a>00035 <span class="keyword">namespace </span>bm
63
<a name="l00036"></a>00036 {
64
<a name="l00037"></a>00037 <span class="comment"></span>
65
<a name="l00038"></a>00038 <span class="comment">/*! \defgroup setalgo Set algorithms </span>
66
<a name="l00039"></a>00039 <span class="comment"> * Set algorithms </span>
67
<a name="l00040"></a>00040 <span class="comment"> * \ingroup bmagic</span>
62
<a name="l00035"></a>00035 <span class="comment"></span>
63
<a name="l00036"></a>00036 <span class="comment">/*! @defgroup alloc Memory Allocation</span>
64
<a name="l00037"></a>00037 <span class="comment"> * Memory allocation related units</span>
65
<a name="l00038"></a>00038 <span class="comment"> * @ingroup bmagic</span>
66
<a name="l00039"></a>00039 <span class="comment"> *</span>
67
<a name="l00040"></a>00040 <span class="comment"> * @{</span>
68
68
<a name="l00041"></a>00041 <span class="comment"> */</span>
69
69
<a name="l00042"></a>00042 <span class="comment"></span>
70
<a name="l00043"></a>00043 <span class="comment">/*! \defgroup distance Distance metrics </span>
71
<a name="l00044"></a>00044 <span class="comment"> * Algorithms to compute binary distance metrics</span>
72
<a name="l00045"></a>00045 <span class="comment"> * \ingroup setalgo</span>
73
<a name="l00046"></a>00046 <span class="comment"> */</span>
74
<a name="l00047"></a>00047
75
<a name="l00048"></a>00048 <span class="comment"></span>
76
<a name="l00049"></a>00049 <span class="comment">/*! </span>
77
<a name="l00050"></a>00050 <span class="comment"> \brief Distance metrics codes defined for vectors A and B</span>
78
<a name="l00051"></a>00051 <span class="comment"> \ingroup distance</span>
79
<a name="l00052"></a>00052 <span class="comment">*/</span>
80
<a name="l00053"></a><a class="code" href="a00126.html#gac38d64c8b27b652413a664cddd4d40ab">00053</a> <span class="keyword">enum</span> <a class="code" href="a00126.html#gac38d64c8b27b652413a664cddd4d40ab" title="Distance metrics codes defined for vectors A and B.">distance_metric</a>
81
<a name="l00054"></a>00054 {
82
<a name="l00055"></a><a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce">00055</a> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce" title="(A &amp; B).count()">COUNT_AND</a> = <a class="code" href="a00116.html#a76b70d2b9182a6dcac151d1bd9ec6109a378be4b14cee6a341e859fd3157ab959">set_COUNT_AND</a>, <span class="comment">//!< (A & B).count()</span>
83
<a name="l00056"></a><a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061">00056</a> <span class="comment"></span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">COUNT_XOR</a> = <a class="code" href="a00116.html#a76b70d2b9182a6dcac151d1bd9ec6109a1373054e4f243dffb762a55b8a8bfe4c">set_COUNT_XOR</a>, <span class="comment">//!< (A ^ B).count()</span>
84
<a name="l00057"></a><a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb">00057</a> <span class="comment"></span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb" title="(A | B).count()">COUNT_OR</a> = <a class="code" href="a00116.html#a76b70d2b9182a6dcac151d1bd9ec6109a27e34c148d06e3d8a405482d820cd7fb">set_COUNT_OR</a>, <span class="comment">//!< (A | B).count()</span>
85
<a name="l00058"></a><a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62">00058</a> <span class="comment"></span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">COUNT_SUB_AB</a> = <a class="code" href="a00116.html#a76b70d2b9182a6dcac151d1bd9ec6109a0028cc7084b37fe66ce5ae459b93b7f1">set_COUNT_SUB_AB</a>, <span class="comment">//!< (A - B).count()</span>
86
<a name="l00059"></a><a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400">00059</a> <span class="comment"></span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">COUNT_SUB_BA</a> = <a class="code" href="a00116.html#a76b70d2b9182a6dcac151d1bd9ec6109a2f7b894c11c058598d02722a7eeef03b">set_COUNT_SUB_BA</a>, <span class="comment">//!< (B - A).count()</span>
87
<a name="l00060"></a><a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abaac7947d53eb3acf81251ee4130e6a4a2">00060</a> <span class="comment"></span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abaac7947d53eb3acf81251ee4130e6a4a2" title="A.count().">COUNT_A</a> = <a class="code" href="a00116.html#a76b70d2b9182a6dcac151d1bd9ec6109abafe8a971864164aeec7f43d1205ed29">set_COUNT_A</a>, <span class="comment">//!< A.count()</span>
88
<a name="l00061"></a><a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abac6dbadf2ab9405daa47dc0f10d082516">00061</a> <span class="comment"></span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abac6dbadf2ab9405daa47dc0f10d082516" title="B.count().">COUNT_B</a> = <a class="code" href="a00116.html#a76b70d2b9182a6dcac151d1bd9ec6109a2ac4eb7f41d00f8387d5dd3ffb9d0617">set_COUNT_B</a> <span class="comment">//!< B.count()</span>
89
<a name="l00062"></a>00062 <span class="comment"></span>};
90
<a name="l00063"></a>00063 <span class="comment"></span>
91
<a name="l00064"></a>00064 <span class="comment">/**</span>
92
<a name="l00065"></a>00065 <span class="comment"> Convert set operation into compatible distance metric</span>
93
<a name="l00066"></a>00066 <span class="comment"> \ingroup distance</span>
94
<a name="l00067"></a>00067 <span class="comment">*/</span>
95
<a name="l00068"></a>00068 <span class="keyword">inline</span>
96
<a name="l00069"></a><a class="code" href="a00126.html#ga158946ea41ca66c3e1bca62c92684788">00069</a> <a class="code" href="a00126.html#gac38d64c8b27b652413a664cddd4d40ab" title="Distance metrics codes defined for vectors A and B.">distance_metric</a> <a class="code" href="a00126.html#ga158946ea41ca66c3e1bca62c92684788" title="Convert set operation into compatible distance metric.">operation2metric</a>(<a class="code" href="a00116.html#a76b70d2b9182a6dcac151d1bd9ec6109" title="Nomenclature of set operations.">set_operation</a> op)
97
<a name="l00070"></a>00070 {
98
<a name="l00071"></a>00071 <a class="code" href="a00093.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(<a class="code" href="a00116.html#a3deb310cdf11bca948817f94adfec160" title="Returns true if set operation is constant (bitcount).">is_const_set_operation</a>(op));
99
<a name="l00072"></a>00072 <span class="keywordflow">if</span> (op == <a class="code" href="a00116.html#a76b70d2b9182a6dcac151d1bd9ec6109a3f165b7944e33214e8721aaf2eb8378e">set_COUNT</a>) op = <a class="code" href="a00116.html#a76b70d2b9182a6dcac151d1bd9ec6109a2ac4eb7f41d00f8387d5dd3ffb9d0617">set_COUNT_B</a>;
100
<a name="l00073"></a>00073 <span class="comment">// distance metric is created as a set operation sub-class</span>
101
<a name="l00074"></a>00074 <span class="comment">// simple cast will work to convert</span>
102
<a name="l00075"></a>00075 <span class="keywordflow">return</span> (<a class="code" href="a00126.html#gac38d64c8b27b652413a664cddd4d40ab" title="Distance metrics codes defined for vectors A and B.">distance_metric</a>) op;
103
<a name="l00076"></a>00076 }
104
<a name="l00077"></a>00077 <span class="comment"></span>
105
<a name="l00078"></a>00078 <span class="comment">/*! </span>
106
<a name="l00079"></a>00079 <span class="comment"> \brief Distance metric descriptor, holds metric code and result.</span>
107
<a name="l00080"></a>00080 <span class="comment"> \sa distance_operation</span>
108
<a name="l00081"></a>00081 <span class="comment">*/</span>
109
<a name="l00082"></a>00082
110
<a name="l00083"></a><a class="code" href="a00061.html">00083</a> <span class="keyword">struct </span><a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>
111
<a name="l00084"></a>00084 {
112
<a name="l00085"></a><a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">00085</a> <a class="code" href="a00126.html#gac38d64c8b27b652413a664cddd4d40ab" title="Distance metrics codes defined for vectors A and B.">distance_metric</a> <a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>;
113
<a name="l00086"></a><a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">00086</a> <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>;
114
<a name="l00087"></a>00087
115
<a name="l00088"></a><a class="code" href="a00061.html#ab4cc0e59d35431f9a6fe110b7a1392df">00088</a> <a class="code" href="a00061.html#a33061afe75bacd27a76abdcffbba65d5">distance_metric_descriptor</a>(<a class="code" href="a00126.html#gac38d64c8b27b652413a664cddd4d40ab" title="Distance metrics codes defined for vectors A and B.">distance_metric</a> m)
116
<a name="l00089"></a>00089 : <a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>(m),
117
<a name="l00090"></a>00090 <a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>(0)
118
<a name="l00091"></a>00091 {}
119
<a name="l00092"></a><a class="code" href="a00061.html#a33061afe75bacd27a76abdcffbba65d5">00092</a> <a class="code" href="a00061.html#a33061afe75bacd27a76abdcffbba65d5">distance_metric_descriptor</a>()
120
<a name="l00093"></a>00093 : <a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>(bm::<a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">COUNT_XOR</a>),
121
<a name="l00094"></a>00094 <a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>(0)
122
<a name="l00095"></a>00095 {}
123
<a name="l00096"></a>00096 <span class="comment"></span>
124
<a name="l00097"></a>00097 <span class="comment"> /*! </span>
125
<a name="l00098"></a>00098 <span class="comment"> \brief Sets metric result to 0</span>
126
<a name="l00099"></a>00099 <span class="comment"> */</span>
127
<a name="l00100"></a><a class="code" href="a00061.html#a30de8a19da0c250c3d3645eb51ea942c">00100</a> <span class="keywordtype">void</span> <a class="code" href="a00061.html#a30de8a19da0c250c3d3645eb51ea942c" title="Sets metric result to 0.">reset</a>()
128
<a name="l00101"></a>00101 {
129
<a name="l00102"></a>00102 <a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> = 0;
130
<a name="l00103"></a>00103 }
131
<a name="l00104"></a>00104 };
132
<a name="l00105"></a>00105
133
<a name="l00106"></a>00106 <span class="comment"></span>
134
<a name="l00107"></a>00107 <span class="comment">/*!</span>
135
<a name="l00108"></a>00108 <span class="comment"> \brief Internal function computes different distance metrics.</span>
136
<a name="l00109"></a>00109 <span class="comment"> \internal </span>
137
<a name="l00110"></a>00110 <span class="comment"> \ingroup distance</span>
138
<a name="l00111"></a>00111 <span class="comment"> </span>
139
<a name="l00112"></a>00112 <span class="comment">*/</span>
140
<a name="l00113"></a>00113 <span class="keyword">inline</span>
141
<a name="l00114"></a><a class="code" href="a00116.html#abecd5b24d5e394fd46a9db514cfa659a">00114</a> <span class="keywordtype">void</span> <a class="code" href="a00116.html#abecd5b24d5e394fd46a9db514cfa659a" title="Internal function computes different distance metrics.">combine_count_operation_with_block</a>(<span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk,
142
<a name="l00115"></a>00115 <span class="keywordtype">unsigned</span> gap,
143
<a name="l00116"></a>00116 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* arg_blk,
144
<a name="l00117"></a>00117 <span class="keywordtype">int</span> arg_gap,
145
<a name="l00118"></a>00118 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_blk,
146
<a name="l00119"></a>00119 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* dmit,
147
<a name="l00120"></a>00120 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* dmit_end)
148
<a name="l00121"></a>00121
149
<a name="l00122"></a>00122 {
150
<a name="l00123"></a>00123 <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* res=0;
151
<a name="l00124"></a>00124
152
<a name="l00125"></a>00125 <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* g1 = <a class="code" href="a00093.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(blk);
153
<a name="l00126"></a>00126 <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* g2 = <a class="code" href="a00093.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(arg_blk);
154
<a name="l00127"></a>00127
155
<a name="l00128"></a>00128 <span class="keywordflow">if</span> (gap) <span class="comment">// first block GAP-type</span>
156
<a name="l00129"></a>00129 {
157
<a name="l00130"></a>00130 <span class="keywordflow">if</span> (arg_gap) <span class="comment">// both blocks GAP-type</span>
158
<a name="l00131"></a>00131 {
159
<a name="l00132"></a>00132 <span class="comment">// TODO: optimize to avoid temp</span>
160
<a name="l00133"></a>00133 <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> tmp_buf[<a class="code" href="a00116.html#a9b1715d6d9164d56172e75bbbd0e3000">bm::gap_equiv_len</a> * 3]; <span class="comment">// temporary result</span>
161
<a name="l00134"></a>00134
162
<a name="l00135"></a>00135 <span class="keywordflow">for</span> (<a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* it = dmit;it < dmit_end; ++it)
163
<a name="l00136"></a>00136 {
164
<a name="l00137"></a>00137 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>& dmd = *it;
165
<a name="l00138"></a>00138 <span class="keywordtype">unsigned</span> dsize = 0;
166
<a name="l00139"></a>00139
167
<a name="l00140"></a>00140 <span class="keywordflow">switch</span> (dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>)
168
<a name="l00141"></a>00141 {
169
<a name="l00142"></a>00142 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce" title="(A &amp; B).count()">bm::COUNT_AND</a>:
170
<a name="l00143"></a>00143 res = <a class="code" href="a00120.html#ga1666464d22f7fd473db9aafcf2f77a63" title="GAP AND operation.">gap_operation_and</a>(g1, g2, tmp_buf, dsize);
171
<a name="l00144"></a>00144 <span class="keywordflow">break</span>;
172
<a name="l00145"></a>00145 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb" title="(A | B).count()">bm::COUNT_OR</a>:
173
<a name="l00146"></a>00146 res = <a class="code" href="a00120.html#gacda280af8910ae5fde37731a3a7a1226" title="GAP OR operation.">gap_operation_or</a>(g1, g2, tmp_buf, dsize);
174
<a name="l00147"></a>00147 <span class="keywordflow">break</span>;
175
<a name="l00148"></a>00148 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>:
176
<a name="l00149"></a>00149 res = <a class="code" href="a00120.html#gabe4c83e5e162c38e297116dd1cd05ac4" title="GAP SUB (AND NOT) operation.">gap_operation_sub</a>(g1, g2, tmp_buf, dsize);
177
<a name="l00150"></a>00150 <span class="keywordflow">break</span>;
178
<a name="l00151"></a>00151 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>:
179
<a name="l00152"></a>00152 res = <a class="code" href="a00120.html#gabe4c83e5e162c38e297116dd1cd05ac4" title="GAP SUB (AND NOT) operation.">gap_operation_sub</a>(g2, g1, tmp_buf, dsize);
180
<a name="l00153"></a>00153 <span class="keywordflow">break</span>;
181
<a name="l00154"></a>00154 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">bm::COUNT_XOR</a>:
182
<a name="l00155"></a>00155 res = <a class="code" href="a00120.html#gaa5e07ad0256bf784ad3397acbbd23bb2" title="GAP XOR operation.">gap_operation_xor</a>(g1, g2, tmp_buf, dsize);
183
<a name="l00156"></a>00156 <span class="keywordflow">break</span>;
184
<a name="l00157"></a>00157 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abaac7947d53eb3acf81251ee4130e6a4a2" title="A.count().">bm::COUNT_A</a>:
185
<a name="l00158"></a>00158 res = g1;
186
<a name="l00159"></a>00159 <span class="keywordflow">break</span>;
187
<a name="l00160"></a>00160 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abac6dbadf2ab9405daa47dc0f10d082516" title="B.count().">bm::COUNT_B</a>:
188
<a name="l00161"></a>00161 res = g2;
189
<a name="l00162"></a>00162 <span class="keywordflow">break</span>;
190
<a name="l00163"></a>00163 } <span class="comment">// switch</span>
191
<a name="l00164"></a>00164
192
<a name="l00165"></a>00165 <span class="keywordflow">if</span> (res)
193
<a name="l00166"></a>00166 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00120.html#ga570a6f573ffb9ac9e41a688d2bdc6004" title="Calculates number of bits ON in GAP buffer.">gap_bit_count</a>(res, dsize);
194
<a name="l00167"></a>00167
195
<a name="l00168"></a>00168 } <span class="comment">// for it</span>
196
<a name="l00169"></a>00169
197
<a name="l00170"></a>00170 <span class="keywordflow">return</span>;
198
<a name="l00171"></a>00171
199
<a name="l00172"></a>00172 }
200
<a name="l00173"></a>00173 <span class="keywordflow">else</span> <span class="comment">// first block - GAP, argument - BITSET</span>
201
<a name="l00174"></a>00174 {
202
<a name="l00175"></a>00175 <span class="keywordflow">for</span> (<a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* it = dmit;it < dmit_end; ++it)
203
<a name="l00176"></a>00176 {
204
<a name="l00177"></a>00177 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>& dmd = *it;
205
<a name="l00178"></a>00178
206
<a name="l00179"></a>00179 <span class="keywordflow">switch</span> (dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>)
207
<a name="l00180"></a>00180 {
208
<a name="l00181"></a>00181 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce" title="(A &amp; B).count()">bm::COUNT_AND</a>:
209
<a name="l00182"></a>00182 <span class="keywordflow">if</span> (arg_blk)
210
<a name="l00183"></a>00183 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#gab87384cbf46a04d86c008ab2463d02cc" title="Compute bitcount of bit block AND masked by GAP block.">gap_bitset_and_count</a>(arg_blk, g1);
211
<a name="l00184"></a>00184 <span class="keywordflow">break</span>;
212
<a name="l00185"></a>00185 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb" title="(A | B).count()">bm::COUNT_OR</a>:
213
<a name="l00186"></a>00186 <span class="keywordflow">if</span> (!arg_blk)
214
<a name="l00187"></a>00187 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00120.html#ga570a6f573ffb9ac9e41a688d2bdc6004" title="Calculates number of bits ON in GAP buffer.">gap_bit_count</a>(g1);
215
<a name="l00188"></a>00188 <span class="keywordflow">else</span>
216
<a name="l00189"></a>00189 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#ga23733890861063a59f787e26763a734a" title="Compute bitcount of bit block OR masked by GAP block.">gap_bitset_or_count</a>(arg_blk, g1);
217
<a name="l00190"></a>00190 <span class="keywordflow">break</span>;
218
<a name="l00191"></a>00191 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>:
219
<a name="l00192"></a>00192 <a class="code" href="a00120.html#ga4862f4dcdcb7c0575e2e2db9e5f2a849" title="GAP block to bitblock conversion.">gap_convert_to_bitset</a>((<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*) temp_blk, g1);
220
<a name="l00193"></a>00193 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> +=
221
<a name="l00194"></a>00194 <a class="code" href="a00121.html#gaabb39bf01bf973cb7bf3648873921ab7" title="Performs bitblock SUB operation and calculates bitcount of the result.">bit_operation_sub_count</a>((<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)temp_blk,
222
<a name="l00195"></a>00195 ((<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)temp_blk) + <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>,
223
<a name="l00196"></a>00196 arg_blk);
224
<a name="l00197"></a>00197
225
<a name="l00198"></a>00198 <span class="keywordflow">break</span>;
226
<a name="l00199"></a>00199 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>:
227
<a name="l00200"></a>00200 dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a> = <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>; <span class="comment">// recursive call to SUB_AB</span>
228
<a name="l00201"></a>00201 <a class="code" href="a00116.html#abecd5b24d5e394fd46a9db514cfa659a" title="Internal function computes different distance metrics.">combine_count_operation_with_block</a>(arg_blk,
229
<a name="l00202"></a>00202 arg_gap,
230
<a name="l00203"></a>00203 blk,
231
<a name="l00204"></a>00204 gap,
232
<a name="l00205"></a>00205 temp_blk,
233
<a name="l00206"></a>00206 it, it+1);
234
<a name="l00207"></a>00207 dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a> = <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>; <span class="comment">// restore status quo</span>
235
<a name="l00208"></a>00208 <span class="keywordflow">break</span>;
236
<a name="l00209"></a>00209 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">bm::COUNT_XOR</a>:
237
<a name="l00210"></a>00210 <span class="keywordflow">if</span> (!arg_blk)
238
<a name="l00211"></a>00211 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00120.html#ga570a6f573ffb9ac9e41a688d2bdc6004" title="Calculates number of bits ON in GAP buffer.">gap_bit_count</a>(g1);
239
<a name="l00212"></a>00212 <span class="keywordflow">else</span>
240
<a name="l00213"></a>00213 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#ga803fbc7c790f07b14175303e524bd2d8" title="Compute bitcount of bit block XOR masked by GAP block.">gap_bitset_xor_count</a>(arg_blk, g1);
241
<a name="l00214"></a>00214 <span class="keywordflow">break</span>;
242
<a name="l00215"></a>00215 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abaac7947d53eb3acf81251ee4130e6a4a2" title="A.count().">bm::COUNT_A</a>:
243
<a name="l00216"></a>00216 <span class="keywordflow">if</span> (g1)
244
<a name="l00217"></a>00217 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00120.html#ga570a6f573ffb9ac9e41a688d2bdc6004" title="Calculates number of bits ON in GAP buffer.">gap_bit_count</a>(g1);
245
<a name="l00218"></a>00218 <span class="keywordflow">break</span>;
246
<a name="l00219"></a>00219 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abac6dbadf2ab9405daa47dc0f10d082516" title="B.count().">bm::COUNT_B</a>:
247
<a name="l00220"></a>00220 <span class="keywordflow">if</span> (arg_blk)
248
<a name="l00221"></a>00221 {
249
<a name="l00222"></a>00222 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> +=
250
<a name="l00223"></a>00223 <a class="code" href="a00121.html#gab30df14a61f036d690c091878feaff1c" title="Bitcount for bit string.">bit_block_calc_count</a>(arg_blk,
251
<a name="l00224"></a>00224 arg_blk + <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);
252
<a name="l00225"></a>00225 }
253
<a name="l00226"></a>00226 <span class="keywordflow">break</span>;
254
<a name="l00227"></a>00227 } <span class="comment">// switch</span>
255
<a name="l00228"></a>00228
256
<a name="l00229"></a>00229 } <span class="comment">// for it</span>
257
<a name="l00230"></a>00230
258
<a name="l00231"></a>00231 <span class="keywordflow">return</span>;
259
<a name="l00232"></a>00232
260
<a name="l00233"></a>00233 }
261
<a name="l00234"></a>00234 }
262
<a name="l00235"></a>00235 <span class="keywordflow">else</span> <span class="comment">// first block is BITSET-type</span>
263
<a name="l00236"></a>00236 {
264
<a name="l00237"></a>00237 <span class="keywordflow">if</span> (arg_gap) <span class="comment">// second argument block is GAP-type</span>
265
<a name="l00238"></a>00238 {
266
<a name="l00239"></a>00239 <span class="keywordflow">for</span> (<a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* it = dmit;it < dmit_end; ++it)
267
<a name="l00240"></a>00240 {
268
<a name="l00241"></a>00241 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>& dmd = *it;
269
<a name="l00242"></a>00242
270
<a name="l00243"></a>00243 <span class="keywordflow">switch</span> (dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>)
271
<a name="l00244"></a>00244 {
272
<a name="l00245"></a>00245 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce" title="(A &amp; B).count()">bm::COUNT_AND</a>:
273
<a name="l00246"></a>00246 <span class="keywordflow">if</span> (blk)
274
<a name="l00247"></a>00247 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#gab87384cbf46a04d86c008ab2463d02cc" title="Compute bitcount of bit block AND masked by GAP block.">gap_bitset_and_count</a>(blk, g2);
275
<a name="l00248"></a>00248 <span class="keywordflow">break</span>;
276
<a name="l00249"></a>00249 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb" title="(A | B).count()">bm::COUNT_OR</a>:
277
<a name="l00250"></a>00250 <span class="keywordflow">if</span> (!blk)
278
<a name="l00251"></a>00251 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00120.html#ga570a6f573ffb9ac9e41a688d2bdc6004" title="Calculates number of bits ON in GAP buffer.">gap_bit_count</a>(g2);
279
<a name="l00252"></a>00252 <span class="keywordflow">else</span>
280
<a name="l00253"></a>00253 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#ga23733890861063a59f787e26763a734a" title="Compute bitcount of bit block OR masked by GAP block.">gap_bitset_or_count</a>(blk, g2);
281
<a name="l00254"></a>00254 <span class="keywordflow">break</span>;
282
<a name="l00255"></a>00255 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>:
283
<a name="l00256"></a>00256 <span class="keywordflow">if</span> (blk)
284
<a name="l00257"></a>00257 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#ga15a780da58d5aeb67ffc51c84fa6152e" title="Compute bitcount of bit block SUB masked by GAP block.">gap_bitset_sub_count</a>(blk, g2);
285
<a name="l00258"></a>00258 <span class="keywordflow">break</span>;
286
<a name="l00259"></a>00259 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>:
287
<a name="l00260"></a>00260 dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a> = <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>; <span class="comment">// recursive call to SUB_AB</span>
288
<a name="l00261"></a>00261 <a class="code" href="a00116.html#abecd5b24d5e394fd46a9db514cfa659a" title="Internal function computes different distance metrics.">combine_count_operation_with_block</a>(arg_blk,
289
<a name="l00262"></a>00262 arg_gap,
290
<a name="l00263"></a>00263 blk,
291
<a name="l00264"></a>00264 gap,
292
<a name="l00265"></a>00265 temp_blk,
293
<a name="l00266"></a>00266 it, it+1);
294
<a name="l00267"></a>00267 dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a> = <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>; <span class="comment">// restore status quo</span>
295
<a name="l00268"></a>00268 <span class="keywordflow">break</span>;
296
<a name="l00269"></a>00269 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">bm::COUNT_XOR</a>:
297
<a name="l00270"></a>00270 <span class="keywordflow">if</span> (!blk)
298
<a name="l00271"></a>00271 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00120.html#ga570a6f573ffb9ac9e41a688d2bdc6004" title="Calculates number of bits ON in GAP buffer.">gap_bit_count</a>(g2);
299
<a name="l00272"></a>00272 <span class="keywordflow">else</span>
300
<a name="l00273"></a>00273 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#ga803fbc7c790f07b14175303e524bd2d8" title="Compute bitcount of bit block XOR masked by GAP block.">gap_bitset_xor_count</a>(blk, g2);
301
<a name="l00274"></a>00274 <span class="keywordflow">break</span>;
302
<a name="l00275"></a>00275 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abaac7947d53eb3acf81251ee4130e6a4a2" title="A.count().">bm::COUNT_A</a>:
303
<a name="l00276"></a>00276 <span class="keywordflow">if</span> (blk)
304
<a name="l00277"></a>00277 {
305
<a name="l00278"></a>00278 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> +=
306
<a name="l00279"></a>00279 <a class="code" href="a00121.html#gab30df14a61f036d690c091878feaff1c" title="Bitcount for bit string.">bit_block_calc_count</a>(blk,
307
<a name="l00280"></a>00280 blk + <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);
308
<a name="l00281"></a>00281 }
309
<a name="l00282"></a>00282 <span class="keywordflow">break</span>;
310
<a name="l00283"></a>00283 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abac6dbadf2ab9405daa47dc0f10d082516" title="B.count().">bm::COUNT_B</a>:
311
<a name="l00284"></a>00284 <span class="keywordflow">if</span> (g2)
312
<a name="l00285"></a>00285 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00120.html#ga570a6f573ffb9ac9e41a688d2bdc6004" title="Calculates number of bits ON in GAP buffer.">gap_bit_count</a>(g2);
313
<a name="l00286"></a>00286 <span class="keywordflow">break</span>;
314
<a name="l00287"></a>00287 } <span class="comment">// switch</span>
315
<a name="l00288"></a>00288
316
<a name="l00289"></a>00289 } <span class="comment">// for it</span>
317
<a name="l00290"></a>00290
318
<a name="l00291"></a>00291 <span class="keywordflow">return</span>;
319
<a name="l00292"></a>00292 }
320
<a name="l00293"></a>00293 }
321
<a name="l00294"></a>00294
322
<a name="l00295"></a>00295 <span class="comment">// --------------------------------------------</span>
323
<a name="l00296"></a>00296 <span class="comment">//</span>
324
<a name="l00297"></a>00297 <span class="comment">// Here we combine two plain bitblocks </span>
325
<a name="l00298"></a>00298
326
<a name="l00299"></a>00299 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk_end;
327
<a name="l00300"></a>00300 <span class="comment">//const bm::word_t* arg_end;</span>
328
<a name="l00301"></a>00301
329
<a name="l00302"></a>00302 blk_end = blk + (<a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);
330
<a name="l00303"></a>00303 <span class="comment">//arg_end = arg_blk + (bm::set_block_size);</span>
331
<a name="l00304"></a>00304
332
<a name="l00305"></a>00305
333
<a name="l00306"></a>00306 <span class="keywordflow">for</span> (<a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* it = dmit; it < dmit_end; ++it)
334
<a name="l00307"></a>00307 {
335
<a name="l00308"></a>00308 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>& dmd = *it;
336
<a name="l00309"></a>00309 <a class="code" href="a00116.html#ad93f96a77f223240b8c6b8f81c5db840">bit_operation_count_func_type</a> gfunc =
337
<a name="l00310"></a>00310 <a class="code" href="a00077.html#a4fc04066445af644759bf65ebf765760">operation_functions<true>::bit_operation_count</a>(dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>);
338
<a name="l00311"></a>00311 <span class="keywordflow">if</span> (gfunc)
339
<a name="l00312"></a>00312 {
340
<a name="l00313"></a>00313 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += (*gfunc)(blk, blk_end, arg_blk);
341
<a name="l00314"></a>00314 }
342
<a name="l00315"></a>00315 <span class="keywordflow">else</span>
343
<a name="l00316"></a>00316 {
344
<a name="l00317"></a>00317 <span class="keywordflow">switch</span> (dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>)
345
<a name="l00318"></a>00318 {
346
<a name="l00319"></a>00319 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abaac7947d53eb3acf81251ee4130e6a4a2" title="A.count().">bm::COUNT_A</a>:
347
<a name="l00320"></a>00320 <span class="keywordflow">if</span> (blk)
348
<a name="l00321"></a>00321 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#gab30df14a61f036d690c091878feaff1c" title="Bitcount for bit string.">bit_block_calc_count</a>(blk, blk_end);
349
<a name="l00322"></a>00322 <span class="keywordflow">break</span>;
350
<a name="l00323"></a>00323 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abac6dbadf2ab9405daa47dc0f10d082516" title="B.count().">bm::COUNT_B</a>:
351
<a name="l00324"></a>00324 <span class="keywordflow">if</span> (arg_blk)
352
<a name="l00325"></a>00325 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> +=
353
<a name="l00326"></a>00326 <a class="code" href="a00121.html#gab30df14a61f036d690c091878feaff1c" title="Bitcount for bit string.">bit_block_calc_count</a>(arg_blk,
354
<a name="l00327"></a>00327 arg_blk + <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);
355
<a name="l00328"></a>00328 <span class="keywordflow">break</span>;
356
<a name="l00329"></a>00329 <span class="keywordflow">default</span>:
357
<a name="l00330"></a>00330 <a class="code" href="a00093.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);
358
<a name="l00331"></a>00331 } <span class="comment">// switch</span>
359
<a name="l00332"></a>00332 }
360
<a name="l00333"></a>00333
361
<a name="l00334"></a>00334 } <span class="comment">// for it</span>
362
<a name="l00335"></a>00335 }
363
<a name="l00336"></a>00336 <span class="comment"></span>
364
<a name="l00337"></a>00337 <span class="comment">/*!</span>
365
<a name="l00338"></a>00338 <span class="comment"> \brief Internal function computes different existense of distance metric.</span>
366
<a name="l00339"></a>00339 <span class="comment"> \internal </span>
367
<a name="l00340"></a>00340 <span class="comment"> \ingroup distance</span>
368
<a name="l00341"></a>00341 <span class="comment">*/</span>
369
<a name="l00342"></a>00342 <span class="keyword">inline</span>
370
<a name="l00343"></a><a class="code" href="a00116.html#a24069ced9ea689034ff51246ae707ecc">00343</a> <span class="keywordtype">void</span> <a class="code" href="a00116.html#a24069ced9ea689034ff51246ae707ecc" title="Internal function computes different existense of distance metric.">combine_any_operation_with_block</a>(<span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk,
371
<a name="l00344"></a>00344 <span class="keywordtype">unsigned</span> gap,
372
<a name="l00345"></a>00345 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* arg_blk,
373
<a name="l00346"></a>00346 <span class="keywordtype">int</span> arg_gap,
374
<a name="l00347"></a>00347 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_blk,
375
<a name="l00348"></a>00348 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* dmit,
376
<a name="l00349"></a>00349 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* dmit_end)
377
<a name="l00350"></a>00350
378
<a name="l00351"></a>00351 {
379
<a name="l00352"></a>00352 <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* res=0;
380
<a name="l00353"></a>00353
381
<a name="l00354"></a>00354 <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* g1 = <a class="code" href="a00093.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(blk);
382
<a name="l00355"></a>00355 <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* g2 = <a class="code" href="a00093.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(arg_blk);
383
<a name="l00356"></a>00356
384
<a name="l00357"></a>00357 <span class="keywordflow">if</span> (gap) <span class="comment">// first block GAP-type</span>
385
<a name="l00358"></a>00358 {
386
<a name="l00359"></a>00359 <span class="keywordflow">if</span> (arg_gap) <span class="comment">// both blocks GAP-type</span>
387
<a name="l00360"></a>00360 {
388
<a name="l00361"></a>00361 <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a> tmp_buf[<a class="code" href="a00116.html#aa5e01dfb650d168f9be0525e042af647">bm::gap_max_buff_len</a> * 3]; <span class="comment">// temporary result</span>
389
<a name="l00362"></a>00362
390
<a name="l00363"></a>00363 <span class="keywordflow">for</span> (<a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* it = dmit;it < dmit_end; ++it)
391
<a name="l00364"></a>00364 {
392
<a name="l00365"></a>00365 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>& dmd = *it;
393
<a name="l00366"></a>00366 <span class="keywordflow">if</span> (dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>)
394
<a name="l00367"></a>00367 {
395
<a name="l00368"></a>00368 <span class="keywordflow">continue</span>;
396
<a name="l00369"></a>00369 }
397
<a name="l00370"></a>00370 res = 0;
398
<a name="l00371"></a>00371 <span class="keywordtype">unsigned</span> dsize = 0;
399
<a name="l00372"></a>00372 <span class="keywordflow">switch</span> (dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>)
400
<a name="l00373"></a>00373 {
401
<a name="l00374"></a>00374 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce" title="(A &amp; B).count()">bm::COUNT_AND</a>:
402
<a name="l00375"></a>00375 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00120.html#gafb24a1e2588c5670df6facc537594d9d" title="GAP AND operation test.">gap_operation_any_and</a>(g1, g2);
403
<a name="l00376"></a>00376 <span class="keywordflow">break</span>;
404
<a name="l00377"></a>00377 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb" title="(A | B).count()">bm::COUNT_OR</a>:
405
<a name="l00378"></a>00378 res = <a class="code" href="a00120.html#gacda280af8910ae5fde37731a3a7a1226" title="GAP OR operation.">gap_operation_or</a>(g1, g2, tmp_buf, dsize);
406
<a name="l00379"></a>00379 <span class="keywordflow">break</span>;
407
<a name="l00380"></a>00380 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>:
408
<a name="l00381"></a>00381 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00120.html#gae0b1d4aca0ddfa58d83e4b089a4f35d9" title="GAP SUB operation test.">gap_operation_any_sub</a>(g1, g2);
409
<a name="l00382"></a>00382 <span class="keywordflow">break</span>;
410
<a name="l00383"></a>00383 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>:
411
<a name="l00384"></a>00384 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00120.html#gae0b1d4aca0ddfa58d83e4b089a4f35d9" title="GAP SUB operation test.">gap_operation_any_sub</a>(g2, g1);
412
<a name="l00385"></a>00385 <span class="keywordflow">break</span>;
413
<a name="l00386"></a>00386 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">bm::COUNT_XOR</a>:
414
<a name="l00387"></a>00387 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00120.html#gab46833bf0d7813f868a1608f70db12de" title="GAP XOR operation test.">gap_operation_any_xor</a>(g1, g2);
415
<a name="l00388"></a>00388 <span class="keywordflow">break</span>;
416
<a name="l00389"></a>00389 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abaac7947d53eb3acf81251ee4130e6a4a2" title="A.count().">bm::COUNT_A</a>:
417
<a name="l00390"></a>00390 res = g1;
418
<a name="l00391"></a>00391 <span class="keywordflow">break</span>;
419
<a name="l00392"></a>00392 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abac6dbadf2ab9405daa47dc0f10d082516" title="B.count().">bm::COUNT_B</a>:
420
<a name="l00393"></a>00393 res = g2;
421
<a name="l00394"></a>00394 <span class="keywordflow">break</span>;
422
<a name="l00395"></a>00395 } <span class="comment">// switch</span>
423
<a name="l00396"></a>00396 <span class="keywordflow">if</span> (res)
424
<a name="l00397"></a>00397 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += !<a class="code" href="a00120.html#ga690ff7c8b16e1821a77663b7194267e7" title="Temporary inverts all bits in the GAP buffer.">gap_is_all_zero</a>(res, <a class="code" href="a00116.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>);
425
<a name="l00398"></a>00398
426
<a name="l00399"></a>00399 } <span class="comment">// for it</span>
427
<a name="l00400"></a>00400
428
<a name="l00401"></a>00401 <span class="keywordflow">return</span>;
429
<a name="l00402"></a>00402
430
<a name="l00403"></a>00403 }
431
<a name="l00404"></a>00404 <span class="keywordflow">else</span> <span class="comment">// first block - GAP, argument - BITSET</span>
432
<a name="l00405"></a>00405 {
433
<a name="l00406"></a>00406 <span class="keywordflow">for</span> (<a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* it = dmit;it < dmit_end; ++it)
434
<a name="l00407"></a>00407 {
435
<a name="l00408"></a>00408 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>& dmd = *it;
436
<a name="l00409"></a>00409 <span class="keywordflow">if</span> (dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>)
437
<a name="l00410"></a>00410 {
438
<a name="l00411"></a>00411 <span class="keywordflow">continue</span>;
439
<a name="l00412"></a>00412 }
440
<a name="l00413"></a>00413
441
<a name="l00414"></a>00414 <span class="keywordflow">switch</span> (dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>)
442
<a name="l00415"></a>00415 {
443
<a name="l00416"></a>00416 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce" title="(A &amp; B).count()">bm::COUNT_AND</a>:
444
<a name="l00417"></a>00417 <span class="keywordflow">if</span> (arg_blk)
445
<a name="l00418"></a>00418 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#gad6e40898b8836ae1923b06a3d028fcaa" title="Bitcount test of bit block AND masked by GAP block.">gap_bitset_and_any</a>(arg_blk, g1);
446
<a name="l00419"></a>00419 <span class="keywordflow">break</span>;
447
<a name="l00420"></a>00420 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb" title="(A | B).count()">bm::COUNT_OR</a>:
448
<a name="l00421"></a>00421 <span class="keywordflow">if</span> (!arg_blk)
449
<a name="l00422"></a>00422 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += !<a class="code" href="a00120.html#ga690ff7c8b16e1821a77663b7194267e7" title="Temporary inverts all bits in the GAP buffer.">gap_is_all_zero</a>(g1, <a class="code" href="a00116.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>);
450
<a name="l00423"></a>00423 <span class="keywordflow">else</span>
451
<a name="l00424"></a>00424 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#gad15f1b92c70752cd3b97fa9e0c585f00" title="Compute bitcount test of bit block OR masked by GAP block.">gap_bitset_or_any</a>(arg_blk, g1);
452
<a name="l00425"></a>00425 <span class="keywordflow">break</span>;
453
<a name="l00426"></a>00426 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>:
454
<a name="l00427"></a>00427 <a class="code" href="a00120.html#ga4862f4dcdcb7c0575e2e2db9e5f2a849" title="GAP block to bitblock conversion.">gap_convert_to_bitset</a>((<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*) temp_blk, g1);
455
<a name="l00428"></a>00428 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> +=
456
<a name="l00429"></a>00429 <a class="code" href="a00121.html#ga847d5a84673b284be984f0db583e2723" title="Performs bitblock test of SUB operation.">bit_operation_sub_any</a>((<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)temp_blk,
457
<a name="l00430"></a>00430 ((<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)temp_blk) + <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>,
458
<a name="l00431"></a>00431 arg_blk);
459
<a name="l00432"></a>00432
460
<a name="l00433"></a>00433 <span class="keywordflow">break</span>;
461
<a name="l00434"></a>00434 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>:
462
<a name="l00435"></a>00435 dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a> = <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>; <span class="comment">// recursive call to SUB_AB</span>
463
<a name="l00436"></a>00436 <a class="code" href="a00116.html#a24069ced9ea689034ff51246ae707ecc" title="Internal function computes different existense of distance metric.">combine_any_operation_with_block</a>(arg_blk,
464
<a name="l00437"></a>00437 arg_gap,
465
<a name="l00438"></a>00438 blk,
466
<a name="l00439"></a>00439 gap,
467
<a name="l00440"></a>00440 temp_blk,
468
<a name="l00441"></a>00441 it, it+1);
469
<a name="l00442"></a>00442 dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a> = <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>; <span class="comment">// restore status quo</span>
470
<a name="l00443"></a>00443 <span class="keywordflow">break</span>;
471
<a name="l00444"></a>00444 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">bm::COUNT_XOR</a>:
472
<a name="l00445"></a>00445 <span class="keywordflow">if</span> (!arg_blk)
473
<a name="l00446"></a>00446 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += !<a class="code" href="a00120.html#ga690ff7c8b16e1821a77663b7194267e7" title="Temporary inverts all bits in the GAP buffer.">gap_is_all_zero</a>(g1, <a class="code" href="a00116.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>);
474
<a name="l00447"></a>00447 <span class="keywordflow">else</span>
475
<a name="l00448"></a>00448 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#gad0f7ee00f84ea357d55e6a2f507c8918" title="Compute bitcount test of bit block XOR masked by GAP block.">gap_bitset_xor_any</a>(arg_blk, g1);
476
<a name="l00449"></a>00449 <span class="keywordflow">break</span>;
477
<a name="l00450"></a>00450 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abaac7947d53eb3acf81251ee4130e6a4a2" title="A.count().">bm::COUNT_A</a>:
478
<a name="l00451"></a>00451 <span class="keywordflow">if</span> (g1)
479
<a name="l00452"></a>00452 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += !<a class="code" href="a00120.html#ga690ff7c8b16e1821a77663b7194267e7" title="Temporary inverts all bits in the GAP buffer.">gap_is_all_zero</a>(g1, <a class="code" href="a00116.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>);
480
<a name="l00453"></a>00453 <span class="keywordflow">break</span>;
481
<a name="l00454"></a>00454 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abac6dbadf2ab9405daa47dc0f10d082516" title="B.count().">bm::COUNT_B</a>:
482
<a name="l00455"></a>00455 <span class="keywordflow">if</span> (arg_blk)
483
<a name="l00456"></a>00456 {
484
<a name="l00457"></a>00457 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> +=
485
<a name="l00458"></a>00458 !<a class="code" href="a00121.html#gac6cfb9f92e4df6bb4c76f6efb2382860" title="Returns &quot;true&quot; if all bits in the block are 0.">bit_is_all_zero</a>((<a class="code" href="a00116.html#a7176bf7817550ca24cb6612bd8d7957d">bm::wordop_t</a>*)arg_blk,
486
<a name="l00459"></a>00459 (<a class="code" href="a00116.html#a7176bf7817550ca24cb6612bd8d7957d">bm::wordop_t</a>*)(arg_blk + <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>));
487
<a name="l00460"></a>00460 }
488
<a name="l00461"></a>00461 <span class="keywordflow">break</span>;
489
<a name="l00462"></a>00462 } <span class="comment">// switch</span>
490
<a name="l00463"></a>00463
491
<a name="l00464"></a>00464 } <span class="comment">// for it</span>
492
<a name="l00465"></a>00465
493
<a name="l00466"></a>00466 <span class="keywordflow">return</span>;
494
<a name="l00467"></a>00467
495
<a name="l00468"></a>00468 }
496
<a name="l00469"></a>00469 }
497
<a name="l00470"></a>00470 <span class="keywordflow">else</span> <span class="comment">// first block is BITSET-type</span>
498
<a name="l00471"></a>00471 {
499
<a name="l00472"></a>00472 <span class="keywordflow">if</span> (arg_gap) <span class="comment">// second argument block is GAP-type</span>
500
<a name="l00473"></a>00473 {
501
<a name="l00474"></a>00474 <span class="keywordflow">for</span> (<a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* it = dmit;it < dmit_end; ++it)
502
<a name="l00475"></a>00475 {
503
<a name="l00476"></a>00476 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>& dmd = *it;
504
<a name="l00477"></a>00477 <span class="keywordflow">if</span> (dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>)
505
<a name="l00478"></a>00478 {
506
<a name="l00479"></a>00479 <span class="keywordflow">continue</span>;
507
<a name="l00480"></a>00480 }
508
<a name="l00481"></a>00481
509
<a name="l00482"></a>00482 <span class="keywordflow">switch</span> (dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>)
510
<a name="l00483"></a>00483 {
511
<a name="l00484"></a>00484 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce" title="(A &amp; B).count()">bm::COUNT_AND</a>:
512
<a name="l00485"></a>00485 <span class="keywordflow">if</span> (blk)
513
<a name="l00486"></a>00486 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#gad6e40898b8836ae1923b06a3d028fcaa" title="Bitcount test of bit block AND masked by GAP block.">gap_bitset_and_any</a>(blk, g2);
514
<a name="l00487"></a>00487 <span class="keywordflow">break</span>;
515
<a name="l00488"></a>00488 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb" title="(A | B).count()">bm::COUNT_OR</a>:
516
<a name="l00489"></a>00489 <span class="keywordflow">if</span> (!blk)
517
<a name="l00490"></a>00490 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += !<a class="code" href="a00120.html#ga690ff7c8b16e1821a77663b7194267e7" title="Temporary inverts all bits in the GAP buffer.">gap_is_all_zero</a>(g2, <a class="code" href="a00116.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>);
518
<a name="l00491"></a>00491 <span class="keywordflow">else</span>
519
<a name="l00492"></a>00492 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#gad15f1b92c70752cd3b97fa9e0c585f00" title="Compute bitcount test of bit block OR masked by GAP block.">gap_bitset_or_any</a>(blk, g2);
520
<a name="l00493"></a>00493 <span class="keywordflow">break</span>;
521
<a name="l00494"></a>00494 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>:
522
<a name="l00495"></a>00495 <span class="keywordflow">if</span> (blk)
523
<a name="l00496"></a>00496 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#gaab7c711122e8f189555dffd83a21111c" title="Compute bitcount test of bit block SUB masked by GAP block.">gap_bitset_sub_any</a>(blk, g2);
524
<a name="l00497"></a>00497 <span class="keywordflow">break</span>;
525
<a name="l00498"></a>00498 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>:
526
<a name="l00499"></a>00499 dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a> = <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>; <span class="comment">// recursive call to SUB_AB</span>
527
<a name="l00500"></a>00500 <a class="code" href="a00116.html#a24069ced9ea689034ff51246ae707ecc" title="Internal function computes different existense of distance metric.">combine_any_operation_with_block</a>(arg_blk,
528
<a name="l00501"></a>00501 arg_gap,
529
<a name="l00502"></a>00502 blk,
530
<a name="l00503"></a>00503 gap,
531
<a name="l00504"></a>00504 temp_blk,
532
<a name="l00505"></a>00505 it, it+1);
533
<a name="l00506"></a>00506 dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a> = <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>; <span class="comment">// restore status quo</span>
534
<a name="l00507"></a>00507 <span class="keywordflow">break</span>;
535
<a name="l00508"></a>00508 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">bm::COUNT_XOR</a>:
536
<a name="l00509"></a>00509 <span class="keywordflow">if</span> (!blk)
537
<a name="l00510"></a>00510 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += !<a class="code" href="a00120.html#ga690ff7c8b16e1821a77663b7194267e7" title="Temporary inverts all bits in the GAP buffer.">gap_is_all_zero</a>(g2, <a class="code" href="a00116.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>);
538
<a name="l00511"></a>00511 <span class="keywordflow">else</span>
539
<a name="l00512"></a>00512 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += <a class="code" href="a00121.html#gad0f7ee00f84ea357d55e6a2f507c8918" title="Compute bitcount test of bit block XOR masked by GAP block.">gap_bitset_xor_any</a>(blk, g2);
540
<a name="l00513"></a>00513 <span class="keywordflow">break</span>;
541
<a name="l00514"></a>00514 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abaac7947d53eb3acf81251ee4130e6a4a2" title="A.count().">bm::COUNT_A</a>:
542
<a name="l00515"></a>00515 <span class="keywordflow">if</span> (blk)
543
<a name="l00516"></a>00516 {
544
<a name="l00517"></a>00517 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>+=
545
<a name="l00518"></a>00518 !<a class="code" href="a00121.html#gac6cfb9f92e4df6bb4c76f6efb2382860" title="Returns &quot;true&quot; if all bits in the block are 0.">bit_is_all_zero</a>((<a class="code" href="a00116.html#a7176bf7817550ca24cb6612bd8d7957d">bm::wordop_t</a>*)blk,
546
<a name="l00519"></a>00519 (<a class="code" href="a00116.html#a7176bf7817550ca24cb6612bd8d7957d">bm::wordop_t</a>*)blk + <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);
547
<a name="l00520"></a>00520 }
548
<a name="l00521"></a>00521 <span class="keywordflow">break</span>;
549
<a name="l00522"></a>00522 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abac6dbadf2ab9405daa47dc0f10d082516" title="B.count().">bm::COUNT_B</a>:
550
<a name="l00523"></a>00523 <span class="keywordflow">if</span> (g2)
551
<a name="l00524"></a>00524 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += !<a class="code" href="a00120.html#ga690ff7c8b16e1821a77663b7194267e7" title="Temporary inverts all bits in the GAP buffer.">gap_is_all_zero</a>(g2, <a class="code" href="a00116.html#ad0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>);
552
<a name="l00525"></a>00525 <span class="keywordflow">break</span>;
553
<a name="l00526"></a>00526 } <span class="comment">// switch</span>
554
<a name="l00527"></a>00527
555
<a name="l00528"></a>00528 } <span class="comment">// for it</span>
556
<a name="l00529"></a>00529
557
<a name="l00530"></a>00530 <span class="keywordflow">return</span>;
558
<a name="l00531"></a>00531 }
559
<a name="l00532"></a>00532 }
560
<a name="l00533"></a>00533
561
<a name="l00534"></a>00534 <span class="comment">// --------------------------------------------</span>
562
<a name="l00535"></a>00535 <span class="comment">//</span>
563
<a name="l00536"></a>00536 <span class="comment">// Here we combine two plain bitblocks </span>
564
<a name="l00537"></a>00537
565
<a name="l00538"></a>00538 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk_end;
566
<a name="l00539"></a>00539 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* arg_end;
567
<a name="l00540"></a>00540
568
<a name="l00541"></a>00541 blk_end = blk + (<a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);
569
<a name="l00542"></a>00542 arg_end = arg_blk + (<a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>);
570
<a name="l00543"></a>00543
571
<a name="l00544"></a>00544 <span class="keywordflow">for</span> (<a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* it = dmit; it < dmit_end; ++it)
572
<a name="l00545"></a>00545 {
573
<a name="l00546"></a>00546 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>& dmd = *it;
574
<a name="l00547"></a>00547 <span class="keywordflow">if</span> (dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>)
575
<a name="l00548"></a>00548 {
576
<a name="l00549"></a>00549 <span class="keywordflow">continue</span>;
577
<a name="l00550"></a>00550 }
578
<a name="l00551"></a>00551
579
<a name="l00552"></a>00552 <span class="keywordflow">switch</span> (dmd.<a class="code" href="a00061.html#a3ece2ccdb7a6616f06a5a15679ccabb1">metric</a>)
580
<a name="l00553"></a>00553 {
581
<a name="l00554"></a>00554 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce" title="(A &amp; B).count()">bm::COUNT_AND</a>:
582
<a name="l00555"></a>00555 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> +=
583
<a name="l00556"></a>00556 <a class="code" href="a00121.html#ga0e7995f7d6c791f6ff27a8dd21d324e5" title="Performs bitblock AND operation test.">bit_operation_and_any</a>(blk, blk_end, arg_blk);
584
<a name="l00557"></a>00557 <span class="keywordflow">break</span>;
585
<a name="l00558"></a>00558 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb" title="(A | B).count()">bm::COUNT_OR</a>:
586
<a name="l00559"></a>00559 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> +=
587
<a name="l00560"></a>00560 <a class="code" href="a00121.html#ga6d26742bdc373074474a6932eab4f388" title="Performs bitblock OR operation test.">bit_operation_or_any</a>(blk, blk_end, arg_blk);
588
<a name="l00561"></a>00561 <span class="keywordflow">break</span>;
589
<a name="l00562"></a>00562 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>:
590
<a name="l00563"></a>00563 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> +=
591
<a name="l00564"></a>00564 <a class="code" href="a00121.html#ga847d5a84673b284be984f0db583e2723" title="Performs bitblock test of SUB operation.">bit_operation_sub_any</a>(blk, blk_end, arg_blk);
592
<a name="l00565"></a>00565 <span class="keywordflow">break</span>;
593
<a name="l00566"></a>00566 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>:
594
<a name="l00567"></a>00567 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> +=
595
<a name="l00568"></a>00568 <a class="code" href="a00121.html#ga847d5a84673b284be984f0db583e2723" title="Performs bitblock test of SUB operation.">bit_operation_sub_any</a>(arg_blk, arg_end, blk);
596
<a name="l00569"></a>00569 <span class="keywordflow">break</span>;
597
<a name="l00570"></a>00570 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">bm::COUNT_XOR</a>:
598
<a name="l00571"></a>00571 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> +=
599
<a name="l00572"></a>00572 <a class="code" href="a00121.html#gaa86561b6d11c3f01dd772563c692f732" title="Performs bitblock XOR operation test.">bit_operation_xor_any</a>(blk, blk_end, arg_blk);
600
<a name="l00573"></a>00573 <span class="keywordflow">break</span>;
601
<a name="l00574"></a>00574 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abaac7947d53eb3acf81251ee4130e6a4a2" title="A.count().">bm::COUNT_A</a>:
602
<a name="l00575"></a>00575 <span class="keywordflow">if</span> (blk)
603
<a name="l00576"></a>00576 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += !<a class="code" href="a00121.html#gac6cfb9f92e4df6bb4c76f6efb2382860" title="Returns &quot;true&quot; if all bits in the block are 0.">bit_is_all_zero</a>((<a class="code" href="a00116.html#a7176bf7817550ca24cb6612bd8d7957d">bm::wordop_t</a>*)blk,
604
<a name="l00577"></a>00577 (<a class="code" href="a00116.html#a7176bf7817550ca24cb6612bd8d7957d">bm::wordop_t</a>*)blk_end);
605
<a name="l00578"></a>00578 <span class="keywordflow">break</span>;
606
<a name="l00579"></a>00579 <span class="keywordflow">case</span> <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abac6dbadf2ab9405daa47dc0f10d082516" title="B.count().">bm::COUNT_B</a>:
607
<a name="l00580"></a>00580 <span class="keywordflow">if</span> (arg_blk)
608
<a name="l00581"></a>00581 dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a> += !<a class="code" href="a00121.html#gac6cfb9f92e4df6bb4c76f6efb2382860" title="Returns &quot;true&quot; if all bits in the block are 0.">bit_is_all_zero</a>((<a class="code" href="a00116.html#a7176bf7817550ca24cb6612bd8d7957d">bm::wordop_t</a>*)arg_blk,
609
<a name="l00582"></a>00582 (<a class="code" href="a00116.html#a7176bf7817550ca24cb6612bd8d7957d">bm::wordop_t</a>*)arg_end);
610
<a name="l00583"></a>00583 <span class="keywordflow">break</span>;
611
<a name="l00584"></a>00584 } <span class="comment">// switch</span>
612
<a name="l00585"></a>00585
613
<a name="l00586"></a>00586 } <span class="comment">// for it</span>
614
<a name="l00587"></a>00587 }
615
<a name="l00588"></a>00588
616
<a name="l00589"></a>00589
617
<a name="l00590"></a>00590 <span class="comment"></span>
618
<a name="l00591"></a>00591 <span class="comment">/*!</span>
619
<a name="l00592"></a>00592 <span class="comment"> Convenience internal function to compute combine count for one metric</span>
620
<a name="l00593"></a>00593 <span class="comment"> \internal</span>
621
<a name="l00594"></a>00594 <span class="comment"> \ingroup distance</span>
622
<a name="l00595"></a>00595 <span class="comment">*/</span>
623
<a name="l00596"></a>00596 <span class="keyword">inline</span>
624
<a name="l00597"></a><a class="code" href="a00116.html#a2f81b8ce3d389973b4f867b0fcc98e7a">00597</a> <span class="keywordtype">unsigned</span> <a class="code" href="a00116.html#abecd5b24d5e394fd46a9db514cfa659a" title="Internal function computes different distance metrics.">combine_count_operation_with_block</a>(<span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk,
625
<a name="l00598"></a>00598 <span class="keywordtype">unsigned</span> gap,
626
<a name="l00599"></a>00599 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* arg_blk,
627
<a name="l00600"></a>00600 <span class="keywordtype">int</span> arg_gap,
628
<a name="l00601"></a>00601 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_blk,
629
<a name="l00602"></a>00602 <a class="code" href="a00126.html#gac38d64c8b27b652413a664cddd4d40ab" title="Distance metrics codes defined for vectors A and B.">distance_metric</a> metric)
630
<a name="l00603"></a>00603 {
631
<a name="l00604"></a>00604 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a> dmd(metric);
632
<a name="l00605"></a>00605 <a class="code" href="a00116.html#abecd5b24d5e394fd46a9db514cfa659a" title="Internal function computes different distance metrics.">combine_count_operation_with_block</a>(blk, gap,
633
<a name="l00606"></a>00606 arg_blk, arg_gap,
634
<a name="l00607"></a>00607 temp_blk,
635
<a name="l00608"></a>00608 &dmd, &dmd+1);
636
<a name="l00609"></a>00609 <span class="keywordflow">return</span> dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>;
637
<a name="l00610"></a>00610 }
638
<a name="l00611"></a>00611
639
<a name="l00612"></a>00612 <span class="comment"></span>
640
<a name="l00613"></a>00613 <span class="comment">/*!</span>
641
<a name="l00614"></a>00614 <span class="comment"> Convenience internal function to compute combine any for one metric</span>
642
<a name="l00615"></a>00615 <span class="comment"> \internal</span>
643
<a name="l00616"></a>00616 <span class="comment"> \ingroup distance</span>
644
<a name="l00617"></a>00617 <span class="comment">*/</span>
645
<a name="l00618"></a>00618 <span class="keyword">inline</span>
646
<a name="l00619"></a><a class="code" href="a00116.html#a093f2dadce40f42a184928c9d1456592">00619</a> <span class="keywordtype">unsigned</span> <a class="code" href="a00116.html#a24069ced9ea689034ff51246ae707ecc" title="Internal function computes different existense of distance metric.">combine_any_operation_with_block</a>(<span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk,
647
<a name="l00620"></a>00620 <span class="keywordtype">unsigned</span> gap,
648
<a name="l00621"></a>00621 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* arg_blk,
649
<a name="l00622"></a>00622 <span class="keywordtype">int</span> arg_gap,
650
<a name="l00623"></a>00623 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_blk,
651
<a name="l00624"></a>00624 <a class="code" href="a00126.html#gac38d64c8b27b652413a664cddd4d40ab" title="Distance metrics codes defined for vectors A and B.">distance_metric</a> metric)
652
<a name="l00625"></a>00625 {
653
<a name="l00626"></a>00626 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a> dmd(metric);
654
<a name="l00627"></a>00627 <a class="code" href="a00116.html#a24069ced9ea689034ff51246ae707ecc" title="Internal function computes different existense of distance metric.">combine_any_operation_with_block</a>(blk, gap,
655
<a name="l00628"></a>00628 arg_blk, arg_gap,
656
<a name="l00629"></a>00629 temp_blk,
657
<a name="l00630"></a>00630 &dmd, &dmd+1);
658
<a name="l00631"></a>00631 <span class="keywordflow">return</span> dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>;
659
<a name="l00632"></a>00632 }
660
<a name="l00633"></a>00633 <span class="comment"></span>
661
<a name="l00634"></a>00634 <span class="comment">/*!</span>
662
<a name="l00635"></a>00635 <span class="comment"> \brief Staging function for distance operation</span>
663
<a name="l00636"></a>00636 <span class="comment"></span>
664
<a name="l00637"></a>00637 <span class="comment"> \return temp block allocated (or NULL)</span>
665
<a name="l00638"></a>00638 <span class="comment"></span>
666
<a name="l00639"></a>00639 <span class="comment"> \internal</span>
667
<a name="l00640"></a>00640 <span class="comment">*/</span>
668
<a name="l00641"></a>00641 <span class="keyword">template</span><<span class="keyword">class</span> BV>
669
<a name="l00642"></a><a class="code" href="a00116.html#ad47cf2dce876dcbc25aef4c7a222c66f">00642</a> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00116.html#ad47cf2dce876dcbc25aef4c7a222c66f" title="Staging function for distance operation.">distance_stage</a>(<span class="keyword">const</span> BV& bv1,
670
<a name="l00643"></a>00643 <span class="keyword">const</span> <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* dmit,
671
<a name="l00644"></a>00644 <span class="keyword">const</span> <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* dmit_end,
672
<a name="l00645"></a>00645 <span class="keywordtype">bool</span>* is_all_and)
673
<a name="l00646"></a>00646 {
674
<a name="l00647"></a>00647 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_blk = 0;
675
<a name="l00648"></a>00648 <span class="keywordflow">for</span> (<span class="keyword">const</span> <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* it = dmit; it < dmit_end; ++it)
676
<a name="l00649"></a>00649 {
677
<a name="l00650"></a>00650 <span class="comment">// allocate temp block when necessary</span>
678
<a name="l00651"></a>00651 <span class="keywordflow">if</span> (temp_blk == 0)
679
<a name="l00652"></a>00652 {
680
<a name="l00653"></a>00653 <span class="keywordflow">if</span> (it->metric == <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a> ||
681
<a name="l00654"></a>00654 it->metric == <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400" title="(B - A).count()">bm::COUNT_SUB_BA</a>)
682
<a name="l00655"></a>00655 {
683
<a name="l00656"></a>00656 temp_blk = bv1.allocate_tempblock();
684
<a name="l00657"></a>00657 }
685
<a name="l00658"></a>00658 }
686
<a name="l00659"></a>00659 <span class="keywordflow">if</span> (it->metric != <a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce" title="(A &amp; B).count()">bm::COUNT_AND</a>)
687
<a name="l00660"></a>00660 {
688
<a name="l00661"></a>00661 *is_all_and = <span class="keyword">false</span>;
689
<a name="l00662"></a>00662 }
690
<a name="l00663"></a>00663 } <span class="comment">// for</span>
691
<a name="l00664"></a>00664 <span class="keywordflow">return</span> temp_blk;
692
<a name="l00665"></a>00665 }
693
<a name="l00666"></a>00666 <span class="comment"></span>
694
<a name="l00667"></a>00667 <span class="comment">/*!</span>
695
<a name="l00668"></a>00668 <span class="comment"> \brief Distance computing template function.</span>
696
<a name="l00669"></a>00669 <span class="comment"></span>
697
<a name="l00670"></a>00670 <span class="comment"> Function receives two bitvectors and an array of distance metrics</span>
698
<a name="l00671"></a>00671 <span class="comment"> (metrics pipeline). Function computes all metrics saves result into</span>
699
<a name="l00672"></a>00672 <span class="comment"> corresponding pipeline results (distance_metric_descriptor::result)</span>
700
<a name="l00673"></a>00673 <span class="comment"> An important detail is that function reuses metric descriptors, </span>
701
<a name="l00674"></a>00674 <span class="comment"> incrementing received values. It allows you to accumulate results </span>
702
<a name="l00675"></a>00675 <span class="comment"> from different calls in the pipeline.</span>
703
<a name="l00676"></a>00676 <span class="comment"> </span>
704
<a name="l00677"></a>00677 <span class="comment"> \param bv1 - argument bitvector 1 (A)</span>
705
<a name="l00678"></a>00678 <span class="comment"> \param bv2 - argument bitvector 2 (B)</span>
706
<a name="l00679"></a>00679 <span class="comment"> \param dmit - pointer to first element of metric descriptors array</span>
707
<a name="l00680"></a>00680 <span class="comment"> Input-Output parameter, receives metric code as input,</span>
708
<a name="l00681"></a>00681 <span class="comment"> computation is added to "result" field</span>
709
<a name="l00682"></a>00682 <span class="comment"> \param dmit_end - pointer to (last+1) element of metric descriptors array</span>
710
<a name="l00683"></a>00683 <span class="comment"> \ingroup distance</span>
711
<a name="l00684"></a>00684 <span class="comment"> </span>
712
<a name="l00685"></a>00685 <span class="comment">*/</span>
713
<a name="l00686"></a>00686
714
<a name="l00687"></a>00687 <span class="keyword">template</span><<span class="keyword">class</span> BV>
715
<a name="l00688"></a><a class="code" href="a00126.html#ga815fef76f02576ab9ab58de0a45d8a4b">00688</a> <span class="keywordtype">void</span> <a class="code" href="a00126.html#ga815fef76f02576ab9ab58de0a45d8a4b" title="Distance computing template function.">distance_operation</a>(<span class="keyword">const</span> BV& bv1,
716
<a name="l00689"></a>00689 <span class="keyword">const</span> BV& bv2,
717
<a name="l00690"></a>00690 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* dmit,
718
<a name="l00691"></a>00691 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* dmit_end)
719
<a name="l00692"></a>00692 {
720
<a name="l00693"></a>00693 <span class="keyword">const</span> <span class="keyword">typename</span> BV::blocks_manager_type& bman1 = bv1.get_blocks_manager();
721
<a name="l00694"></a>00694 <span class="keyword">const</span> <span class="keyword">typename</span> BV::blocks_manager_type& bman2 = bv2.get_blocks_manager();
722
<a name="l00695"></a>00695
723
<a name="l00696"></a>00696 <span class="keywordtype">bool</span> is_all_and = <span class="keyword">true</span>; <span class="comment">// flag is distance operation is just COUNT_AND</span>
724
<a name="l00697"></a>00697 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_blk = <a class="code" href="a00116.html#ad47cf2dce876dcbc25aef4c7a222c66f" title="Staging function for distance operation.">distance_stage</a>(bv1, dmit, dmit_end, &is_all_and);
725
<a name="l00698"></a>00698
726
<a name="l00699"></a>00699 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*** blk_root = bman1.get_rootblock();
727
<a name="l00700"></a>00700 <span class="keywordtype">unsigned</span> block_idx = 0;
728
<a name="l00701"></a>00701 <span class="keywordtype">unsigned</span> i, j;
729
<a name="l00702"></a>00702
730
<a name="l00703"></a>00703 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk;
731
<a name="l00704"></a>00704 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* arg_blk;
732
<a name="l00705"></a>00705 <span class="keywordtype">bool</span> blk_gap;
733
<a name="l00706"></a>00706 <span class="keywordtype">bool</span> arg_gap;
734
<a name="l00707"></a>00707
735
<a name="l00708"></a>00708 <a class="code" href="a00093.html#a7e6f87ba3230dece2125af5c32e84b05">BM_SET_MMX_GUARD</a>
736
<a name="l00709"></a>00709
737
<a name="l00710"></a>00710 <span class="keywordtype">unsigned</span> effective_top_block_size = bman1.effective_top_block_size();
738
<a name="l00711"></a>00711 <span class="keywordtype">unsigned</span> ebs2 = bman2.effective_top_block_size();
739
<a name="l00712"></a>00712 <span class="keywordflow">if</span> (ebs2 > effective_top_block_size)
740
<a name="l00713"></a>00713 effective_top_block_size = ebs2;
741
<a name="l00714"></a>00714
742
<a name="l00715"></a>00715 <span class="keywordflow">for</span> (i = 0; i < effective_top_block_size; ++i)
743
<a name="l00716"></a>00716 {
744
<a name="l00717"></a>00717 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>** blk_blk = blk_root[i];
745
<a name="l00718"></a>00718
746
<a name="l00719"></a>00719 <span class="keywordflow">if</span> (blk_blk == 0) <span class="comment">// not allocated</span>
747
<a name="l00720"></a>00720 {
748
<a name="l00721"></a>00721 <span class="comment">// AND operation requested - we can skip this portion here </span>
749
<a name="l00722"></a>00722 <span class="keywordflow">if</span> (is_all_and)
750
<a name="l00723"></a>00723 {
751
<a name="l00724"></a>00724 block_idx += <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>;
752
<a name="l00725"></a>00725 <span class="keywordflow">continue</span>;
753
<a name="l00726"></a>00726 }
754
<a name="l00727"></a>00727 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <span class="keyword">const</span>* bvbb = bman2.get_topblock(i);
755
<a name="l00728"></a>00728 <span class="keywordflow">if</span> (bvbb == 0)
756
<a name="l00729"></a>00729 {
757
<a name="l00730"></a>00730 block_idx += <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>;
758
<a name="l00731"></a>00731 <span class="keywordflow">continue</span>;
759
<a name="l00732"></a>00732 }
760
<a name="l00733"></a>00733
761
<a name="l00734"></a>00734 blk = 0;
762
<a name="l00735"></a>00735 blk_gap = <span class="keyword">false</span>;
763
<a name="l00736"></a>00736
764
<a name="l00737"></a>00737 <span class="keywordflow">for</span> (j = 0; j < <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>; ++j,++block_idx)
765
<a name="l00738"></a>00738 {
766
<a name="l00739"></a>00739 arg_blk = bman2.get_block(i, j);
767
<a name="l00740"></a>00740 arg_gap = <a class="code" href="a00093.html#a862d6f92b4de3ddb94fd367a800512eb">BM_IS_GAP</a>(bman2, arg_blk, block_idx);
768
<a name="l00741"></a>00741
769
<a name="l00742"></a>00742 <span class="keywordflow">if</span> (!arg_blk)
770
<a name="l00743"></a>00743 <span class="keywordflow">continue</span>;
771
<a name="l00744"></a>00744 <a class="code" href="a00116.html#abecd5b24d5e394fd46a9db514cfa659a" title="Internal function computes different distance metrics.">combine_count_operation_with_block</a>(blk, blk_gap,
772
<a name="l00745"></a>00745 arg_blk, arg_gap,
773
<a name="l00746"></a>00746 temp_blk,
774
<a name="l00747"></a>00747 dmit, dmit_end);
775
<a name="l00748"></a>00748 } <span class="comment">// for j</span>
776
<a name="l00749"></a>00749 <span class="keywordflow">continue</span>;
777
<a name="l00750"></a>00750 }
778
<a name="l00751"></a>00751
779
<a name="l00752"></a>00752 <span class="keywordflow">for</span> (j = 0; j < <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>; ++j, ++block_idx)
780
<a name="l00753"></a>00753 {
781
<a name="l00754"></a>00754 blk = blk_blk[j];
782
<a name="l00755"></a>00755 <span class="keywordflow">if</span> (blk == 0 && is_all_and)
783
<a name="l00756"></a>00756 <span class="keywordflow">continue</span>;
784
<a name="l00757"></a>00757
785
<a name="l00758"></a>00758 arg_blk = bman2.get_block(i, j);
786
<a name="l00759"></a>00759
787
<a name="l00760"></a>00760 <span class="keywordflow">if</span> (blk == 0 && arg_blk == 0)
788
<a name="l00761"></a>00761 <span class="keywordflow">continue</span>;
789
<a name="l00762"></a>00762
790
<a name="l00763"></a>00763 arg_gap = <a class="code" href="a00093.html#a862d6f92b4de3ddb94fd367a800512eb">BM_IS_GAP</a>(bman2, arg_blk, block_idx);
791
<a name="l00764"></a>00764 blk_gap = <a class="code" href="a00093.html#a862d6f92b4de3ddb94fd367a800512eb">BM_IS_GAP</a>(bman1, blk, block_idx);
792
<a name="l00765"></a>00765
793
<a name="l00766"></a>00766 <a class="code" href="a00116.html#abecd5b24d5e394fd46a9db514cfa659a" title="Internal function computes different distance metrics.">combine_count_operation_with_block</a>(blk, blk_gap,
794
<a name="l00767"></a>00767 arg_blk, arg_gap,
795
<a name="l00768"></a>00768 temp_blk,
796
<a name="l00769"></a>00769 dmit, dmit_end);
797
<a name="l00770"></a>00770
798
<a name="l00771"></a>00771
799
<a name="l00772"></a>00772 } <span class="comment">// for j</span>
800
<a name="l00773"></a>00773
801
<a name="l00774"></a>00774 } <span class="comment">// for i</span>
802
<a name="l00775"></a>00775
803
<a name="l00776"></a>00776 <span class="keywordflow">if</span> (temp_blk)
804
<a name="l00777"></a>00777 {
805
<a name="l00778"></a>00778 bv1.free_tempblock(temp_blk);
806
<a name="l00779"></a>00779 }
807
<a name="l00780"></a>00780
808
<a name="l00781"></a>00781 }
809
<a name="l00782"></a>00782
810
<a name="l00783"></a>00783
811
<a name="l00784"></a>00784 <span class="comment"></span>
812
<a name="l00785"></a>00785 <span class="comment">/*!</span>
813
<a name="l00786"></a>00786 <span class="comment"> \brief Distance screening template function.</span>
814
<a name="l00787"></a>00787 <span class="comment"></span>
815
<a name="l00788"></a>00788 <span class="comment"> Function receives two bitvectors and an array of distance metrics</span>
816
<a name="l00789"></a>00789 <span class="comment"> (metrics pipeline). Function computes possybility of a metric(any bit) </span>
817
<a name="l00790"></a>00790 <span class="comment"> saves result into corresponding pipeline results </span>
818
<a name="l00791"></a>00791 <span class="comment"> (distance_metric_descriptor::result)</span>
819
<a name="l00792"></a>00792 <span class="comment"> An important detail is that function reuses metric descriptors, </span>
820
<a name="l00793"></a>00793 <span class="comment"> incrementing received values. It allows you to accumulate results </span>
821
<a name="l00794"></a>00794 <span class="comment"> from different calls in the pipeline.</span>
822
<a name="l00795"></a>00795 <span class="comment"> </span>
823
<a name="l00796"></a>00796 <span class="comment"> \param bv1 - argument bitvector 1 (A)</span>
824
<a name="l00797"></a>00797 <span class="comment"> \param bv2 - argument bitvector 2 (B)</span>
825
<a name="l00798"></a>00798 <span class="comment"> \param dmit - pointer to first element of metric descriptors array</span>
826
<a name="l00799"></a>00799 <span class="comment"> Input-Output parameter, receives metric code as input,</span>
827
<a name="l00800"></a>00800 <span class="comment"> computation is added to "result" field</span>
828
<a name="l00801"></a>00801 <span class="comment"> \param dmit_end - pointer to (last+1) element of metric descriptors array</span>
829
<a name="l00802"></a>00802 <span class="comment"> \ingroup distance</span>
830
<a name="l00803"></a>00803 <span class="comment"> </span>
831
<a name="l00804"></a>00804 <span class="comment">*/</span>
832
<a name="l00805"></a>00805
833
<a name="l00806"></a>00806 <span class="keyword">template</span><<span class="keyword">class</span> BV>
834
<a name="l00807"></a><a class="code" href="a00126.html#gaa66525fd7a3f823d73678252a235982e">00807</a> <span class="keywordtype">void</span> <a class="code" href="a00126.html#gaa66525fd7a3f823d73678252a235982e" title="Distance screening template function.">distance_operation_any</a>(<span class="keyword">const</span> BV& bv1,
835
<a name="l00808"></a>00808 <span class="keyword">const</span> BV& bv2,
836
<a name="l00809"></a>00809 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* dmit,
837
<a name="l00810"></a>00810 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* dmit_end)
838
<a name="l00811"></a>00811 {
839
<a name="l00812"></a>00812 <span class="keyword">const</span> <span class="keyword">typename</span> BV::blocks_manager_type& bman1 = bv1.get_blocks_manager();
840
<a name="l00813"></a>00813 <span class="keyword">const</span> <span class="keyword">typename</span> BV::blocks_manager_type& bman2 = bv2.get_blocks_manager();
841
<a name="l00814"></a>00814
842
<a name="l00815"></a>00815 <span class="keywordtype">bool</span> is_all_and = <span class="keyword">true</span>; <span class="comment">// flag is distance operation is just COUNT_AND</span>
843
<a name="l00816"></a>00816 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* temp_blk = <a class="code" href="a00116.html#ad47cf2dce876dcbc25aef4c7a222c66f" title="Staging function for distance operation.">distance_stage</a>(bv1, dmit, dmit_end, &is_all_and);
844
<a name="l00817"></a>00817
845
<a name="l00818"></a>00818 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*** blk_root = bman1.get_rootblock();
846
<a name="l00819"></a>00819 <span class="keywordtype">unsigned</span> block_idx = 0;
847
<a name="l00820"></a>00820 <span class="keywordtype">unsigned</span> i, j;
848
<a name="l00821"></a>00821
849
<a name="l00822"></a>00822 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk;
850
<a name="l00823"></a>00823 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* arg_blk;
851
<a name="l00824"></a>00824 <span class="keywordtype">bool</span> blk_gap;
852
<a name="l00825"></a>00825 <span class="keywordtype">bool</span> arg_gap;
853
<a name="l00826"></a>00826
854
<a name="l00827"></a>00827 <a class="code" href="a00093.html#a7e6f87ba3230dece2125af5c32e84b05">BM_SET_MMX_GUARD</a>
855
<a name="l00828"></a>00828
856
<a name="l00829"></a>00829 <span class="keywordtype">unsigned</span> effective_top_block_size = bman1.effective_top_block_size();
857
<a name="l00830"></a>00830 <span class="keywordtype">unsigned</span> ebs2 = bman2.effective_top_block_size();
858
<a name="l00831"></a>00831 <span class="keywordflow">if</span> (ebs2 > effective_top_block_size)
859
<a name="l00832"></a>00832 effective_top_block_size = ebs2;
860
<a name="l00833"></a>00833
861
<a name="l00834"></a>00834 <span class="keywordflow">for</span> (i = 0; i < effective_top_block_size; ++i)
862
<a name="l00835"></a>00835 {
863
<a name="l00836"></a>00836 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>** blk_blk = blk_root[i];
864
<a name="l00837"></a>00837
865
<a name="l00838"></a>00838 <span class="keywordflow">if</span> (blk_blk == 0) <span class="comment">// not allocated</span>
866
<a name="l00839"></a>00839 {
867
<a name="l00840"></a>00840 <span class="comment">// AND operation requested - we can skip this portion here </span>
868
<a name="l00841"></a>00841 <span class="keywordflow">if</span> (is_all_and)
869
<a name="l00842"></a>00842 {
870
<a name="l00843"></a>00843 block_idx += <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>;
871
<a name="l00844"></a>00844 <span class="keywordflow">continue</span>;
872
<a name="l00845"></a>00845 }
873
<a name="l00846"></a>00846
874
<a name="l00847"></a>00847 <span class="keyword">const</span> <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <span class="keyword">const</span>* bvbb = bman2.get_topblock(i);
875
<a name="l00848"></a>00848 <span class="keywordflow">if</span> (bvbb == 0)
876
<a name="l00849"></a>00849 {
877
<a name="l00850"></a>00850 block_idx += <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>;
878
<a name="l00851"></a>00851 <span class="keywordflow">continue</span>;
879
<a name="l00852"></a>00852 }
880
<a name="l00853"></a>00853
881
<a name="l00854"></a>00854 blk = 0;
882
<a name="l00855"></a>00855 blk_gap = <span class="keyword">false</span>;
883
<a name="l00856"></a>00856
884
<a name="l00857"></a>00857 <span class="keywordflow">for</span> (j = 0; j < <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>; ++j,++block_idx)
885
<a name="l00858"></a>00858 {
886
<a name="l00859"></a>00859 arg_blk = bman2.get_block(i, j);
887
<a name="l00860"></a>00860 arg_gap = <a class="code" href="a00093.html#a862d6f92b4de3ddb94fd367a800512eb">BM_IS_GAP</a>(bman2, arg_blk, block_idx);
888
<a name="l00861"></a>00861
889
<a name="l00862"></a>00862 <span class="keywordflow">if</span> (!arg_blk)
890
<a name="l00863"></a>00863 <span class="keywordflow">continue</span>;
891
<a name="l00864"></a>00864 <a class="code" href="a00116.html#a24069ced9ea689034ff51246ae707ecc" title="Internal function computes different existense of distance metric.">combine_any_operation_with_block</a>(blk, blk_gap,
892
<a name="l00865"></a>00865 arg_blk, arg_gap,
893
<a name="l00866"></a>00866 temp_blk,
894
<a name="l00867"></a>00867 dmit, dmit_end);
895
<a name="l00868"></a>00868
896
<a name="l00869"></a>00869 <span class="comment">// check if all distance requests alredy resolved</span>
897
<a name="l00870"></a>00870 <span class="keywordtype">bool</span> all_resolved = <span class="keyword">false</span>;
898
<a name="l00871"></a>00871 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* it=dmit;
899
<a name="l00872"></a>00872 <span class="keywordflow">do</span>
900
<a name="l00873"></a>00873 {
901
<a name="l00874"></a>00874 <span class="keywordflow">if</span> (!it-><a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>)
902
<a name="l00875"></a>00875 {
903
<a name="l00876"></a>00876 all_resolved = <span class="keyword">false</span>;
904
<a name="l00877"></a>00877 <span class="keywordflow">break</span>;
905
<a name="l00878"></a>00878 }
906
<a name="l00879"></a>00879 ++it;
907
<a name="l00880"></a>00880 } <span class="keywordflow">while</span> (it < dmit_end);
908
<a name="l00881"></a>00881 <span class="keywordflow">if</span> (all_resolved)
909
<a name="l00882"></a>00882 <span class="keywordflow">goto</span> return_proc;
910
<a name="l00883"></a>00883 } <span class="comment">// for j</span>
911
<a name="l00884"></a>00884
912
<a name="l00885"></a>00885 <span class="keywordflow">continue</span>;
913
<a name="l00886"></a>00886 }
914
<a name="l00887"></a>00887
915
<a name="l00888"></a>00888 <span class="keywordflow">for</span> (j = 0; j < <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>; ++j, ++block_idx)
916
<a name="l00889"></a>00889 {
917
<a name="l00890"></a>00890 blk = blk_blk[j];
918
<a name="l00891"></a>00891 <span class="keywordflow">if</span> (blk == 0 && is_all_and)
919
<a name="l00892"></a>00892 <span class="keywordflow">continue</span>;
920
<a name="l00893"></a>00893
921
<a name="l00894"></a>00894 arg_blk = bman2.get_block(i, j);
922
<a name="l00895"></a>00895
923
<a name="l00896"></a>00896 <span class="keywordflow">if</span> (blk == 0 && arg_blk == 0)
924
<a name="l00897"></a>00897 <span class="keywordflow">continue</span>;
925
<a name="l00898"></a>00898
926
<a name="l00899"></a>00899 arg_gap = <a class="code" href="a00093.html#a862d6f92b4de3ddb94fd367a800512eb">BM_IS_GAP</a>(bman2, arg_blk, block_idx);
927
<a name="l00900"></a>00900 blk_gap = <a class="code" href="a00093.html#a862d6f92b4de3ddb94fd367a800512eb">BM_IS_GAP</a>(bman1, blk, block_idx);
928
<a name="l00901"></a>00901
929
<a name="l00902"></a>00902 <a class="code" href="a00116.html#a24069ced9ea689034ff51246ae707ecc" title="Internal function computes different existense of distance metric.">combine_any_operation_with_block</a>(blk, blk_gap,
930
<a name="l00903"></a>00903 arg_blk, arg_gap,
931
<a name="l00904"></a>00904 temp_blk,
932
<a name="l00905"></a>00905 dmit, dmit_end);
933
<a name="l00906"></a>00906
934
<a name="l00907"></a>00907 <span class="comment">// check if all distance requests alredy resolved</span>
935
<a name="l00908"></a>00908 <span class="keywordtype">bool</span> all_resolved = <span class="keyword">false</span>;
936
<a name="l00909"></a>00909 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a>* it=dmit;
937
<a name="l00910"></a>00910 <span class="keywordflow">do</span>
938
<a name="l00911"></a>00911 {
939
<a name="l00912"></a>00912 <span class="keywordflow">if</span> (!it-><a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>)
940
<a name="l00913"></a>00913 {
941
<a name="l00914"></a>00914 all_resolved = <span class="keyword">false</span>;
942
<a name="l00915"></a>00915 <span class="keywordflow">break</span>;
943
<a name="l00916"></a>00916 }
944
<a name="l00917"></a>00917 ++it;
945
<a name="l00918"></a>00918 } <span class="keywordflow">while</span> (it < dmit_end);
946
<a name="l00919"></a>00919 <span class="keywordflow">if</span> (all_resolved)
947
<a name="l00920"></a>00920 <span class="keywordflow">goto</span> return_proc;
948
<a name="l00921"></a>00921
949
<a name="l00922"></a>00922 } <span class="comment">// for j</span>
950
<a name="l00923"></a>00923
951
<a name="l00924"></a>00924 } <span class="comment">// for i</span>
952
<a name="l00925"></a>00925 return_proc:
953
<a name="l00926"></a>00926 <span class="keywordflow">if</span> (temp_blk)
954
<a name="l00927"></a>00927 {
955
<a name="l00928"></a>00928 bv1.free_tempblock(temp_blk);
956
<a name="l00929"></a>00929 }
957
<a name="l00930"></a>00930
958
<a name="l00931"></a>00931 }
959
<a name="l00932"></a>00932
960
<a name="l00933"></a>00933
961
<a name="l00934"></a>00934 <span class="comment"></span>
962
<a name="l00935"></a>00935 <span class="comment">/*!</span>
963
<a name="l00936"></a>00936 <span class="comment"> \brief Computes bitcount of AND operation of two bitsets</span>
964
<a name="l00937"></a>00937 <span class="comment"> \param bv1 - Argument bit-vector.</span>
965
<a name="l00938"></a>00938 <span class="comment"> \param bv2 - Argument bit-vector.</span>
966
<a name="l00939"></a>00939 <span class="comment"> \return bitcount of the result</span>
967
<a name="l00940"></a>00940 <span class="comment"> \ingroup distance</span>
968
<a name="l00941"></a>00941 <span class="comment">*/</span>
969
<a name="l00942"></a>00942 <span class="keyword">template</span><<span class="keyword">class</span> BV>
970
<a name="l00943"></a><a class="code" href="a00126.html#gae451cb4b87e8c0859b0614d2ffb99737">00943</a> <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00126.html#gae451cb4b87e8c0859b0614d2ffb99737" title="Computes bitcount of AND operation of two bitsets.">count_and</a>(<span class="keyword">const</span> BV& bv1, <span class="keyword">const</span> BV& bv2)
971
<a name="l00944"></a>00944 {
972
<a name="l00945"></a>00945 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a> dmd(<a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce" title="(A &amp; B).count()">bm::COUNT_AND</a>);
973
<a name="l00946"></a>00946
974
<a name="l00947"></a>00947 <a class="code" href="a00126.html#ga815fef76f02576ab9ab58de0a45d8a4b" title="Distance computing template function.">distance_operation</a>(bv1, bv2, &dmd, &dmd+1);
975
<a name="l00948"></a>00948 <span class="keywordflow">return</span> dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>;
976
<a name="l00949"></a>00949 }
977
<a name="l00950"></a>00950 <span class="comment"></span>
978
<a name="l00951"></a>00951 <span class="comment">/*!</span>
979
<a name="l00952"></a>00952 <span class="comment"> \brief Computes if there is any bit in AND operation of two bitsets</span>
980
<a name="l00953"></a>00953 <span class="comment"> \param bv1 - Argument bit-vector.</span>
981
<a name="l00954"></a>00954 <span class="comment"> \param bv2 - Argument bit-vector.</span>
982
<a name="l00955"></a>00955 <span class="comment"> \return non zero value if there is any bit</span>
983
<a name="l00956"></a>00956 <span class="comment"> \ingroup distance</span>
984
<a name="l00957"></a>00957 <span class="comment">*/</span>
985
<a name="l00958"></a>00958 <span class="keyword">template</span><<span class="keyword">class</span> BV>
986
<a name="l00959"></a><a class="code" href="a00126.html#ga2d5393e05bcfc540840a4cee67fb771f">00959</a> <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00126.html#ga2d5393e05bcfc540840a4cee67fb771f" title="Computes if there is any bit in AND operation of two bitsets.">any_and</a>(<span class="keyword">const</span> BV& bv1, <span class="keyword">const</span> BV& bv2)
987
<a name="l00960"></a>00960 {
988
<a name="l00961"></a>00961 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a> dmd(<a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce" title="(A &amp; B).count()">bm::COUNT_AND</a>);
989
<a name="l00962"></a>00962
990
<a name="l00963"></a>00963 <a class="code" href="a00126.html#gaa66525fd7a3f823d73678252a235982e" title="Distance screening template function.">distance_operation_any</a>(bv1, bv2, &dmd, &dmd+1);
991
<a name="l00964"></a>00964 <span class="keywordflow">return</span> dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>;
992
<a name="l00965"></a>00965 }
993
<a name="l00966"></a>00966
994
<a name="l00967"></a>00967
995
<a name="l00968"></a>00968 <span class="comment"></span>
996
<a name="l00969"></a>00969 <span class="comment">/*!</span>
997
<a name="l00970"></a>00970 <span class="comment"> \brief Computes bitcount of XOR operation of two bitsets</span>
998
<a name="l00971"></a>00971 <span class="comment"> \param bv1 - Argument bit-vector.</span>
999
<a name="l00972"></a>00972 <span class="comment"> \param bv2 - Argument bit-vector.</span>
1000
<a name="l00973"></a>00973 <span class="comment"> \return bitcount of the result</span>
1001
<a name="l00974"></a>00974 <span class="comment"> \ingroup distance</span>
1002
<a name="l00975"></a>00975 <span class="comment">*/</span>
1003
<a name="l00976"></a>00976 <span class="keyword">template</span><<span class="keyword">class</span> BV>
1004
<a name="l00977"></a><a class="code" href="a00126.html#gafc64a082dcaee07f70f7faf3e24f844e">00977</a> <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00126.html#gafc64a082dcaee07f70f7faf3e24f844e" title="Computes bitcount of XOR operation of two bitsets.">count_xor</a>(<span class="keyword">const</span> BV& bv1, <span class="keyword">const</span> BV& bv2)
1005
<a name="l00978"></a>00978 {
1006
<a name="l00979"></a>00979 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a> dmd(<a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">bm::COUNT_XOR</a>);
1007
<a name="l00980"></a>00980
1008
<a name="l00981"></a>00981 <a class="code" href="a00126.html#ga815fef76f02576ab9ab58de0a45d8a4b" title="Distance computing template function.">distance_operation</a>(bv1, bv2, &dmd, &dmd+1);
1009
<a name="l00982"></a>00982 <span class="keywordflow">return</span> dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>;
1010
<a name="l00983"></a>00983 }
1011
<a name="l00984"></a>00984 <span class="comment"></span>
1012
<a name="l00985"></a>00985 <span class="comment">/*!</span>
1013
<a name="l00986"></a>00986 <span class="comment"> \brief Computes if there is any bit in XOR operation of two bitsets</span>
1014
<a name="l00987"></a>00987 <span class="comment"> \param bv1 - Argument bit-vector.</span>
1015
<a name="l00988"></a>00988 <span class="comment"> \param bv2 - Argument bit-vector.</span>
1016
<a name="l00989"></a>00989 <span class="comment"> \return non zero value if there is any bit</span>
1017
<a name="l00990"></a>00990 <span class="comment"> \ingroup distance</span>
1018
<a name="l00991"></a>00991 <span class="comment">*/</span>
1019
<a name="l00992"></a>00992 <span class="keyword">template</span><<span class="keyword">class</span> BV>
1020
<a name="l00993"></a><a class="code" href="a00126.html#ga2d63f41244b82d233acb53d88b326b82">00993</a> <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00126.html#ga2d63f41244b82d233acb53d88b326b82" title="Computes if there is any bit in XOR operation of two bitsets.">any_xor</a>(<span class="keyword">const</span> BV& bv1, <span class="keyword">const</span> BV& bv2)
1021
<a name="l00994"></a>00994 {
1022
<a name="l00995"></a>00995 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a> dmd(<a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061" title="(A ^ B).count()">bm::COUNT_XOR</a>);
1023
<a name="l00996"></a>00996
1024
<a name="l00997"></a>00997 <a class="code" href="a00126.html#gaa66525fd7a3f823d73678252a235982e" title="Distance screening template function.">distance_operation_any</a>(bv1, bv2, &dmd, &dmd+1);
1025
<a name="l00998"></a>00998 <span class="keywordflow">return</span> dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>;
1026
<a name="l00999"></a>00999 }
1027
<a name="l01000"></a>01000
1028
<a name="l01001"></a>01001
1029
<a name="l01002"></a>01002 <span class="comment"></span>
1030
<a name="l01003"></a>01003 <span class="comment">/*!</span>
1031
<a name="l01004"></a>01004 <span class="comment"> \brief Computes bitcount of SUB operation of two bitsets</span>
1032
<a name="l01005"></a>01005 <span class="comment"> \param bv1 - Argument bit-vector.</span>
1033
<a name="l01006"></a>01006 <span class="comment"> \param bv2 - Argument bit-vector.</span>
1034
<a name="l01007"></a>01007 <span class="comment"> \return bitcount of the result</span>
1035
<a name="l01008"></a>01008 <span class="comment"> \ingroup distance</span>
1036
<a name="l01009"></a>01009 <span class="comment">*/</span>
1037
<a name="l01010"></a>01010 <span class="keyword">template</span><<span class="keyword">class</span> BV>
1038
<a name="l01011"></a><a class="code" href="a00126.html#ga902d8c1cd1f8a2538cd47d47f5d8d605">01011</a> <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00126.html#ga902d8c1cd1f8a2538cd47d47f5d8d605" title="Computes bitcount of SUB operation of two bitsets.">count_sub</a>(<span class="keyword">const</span> BV& bv1, <span class="keyword">const</span> BV& bv2)
1039
<a name="l01012"></a>01012 {
1040
<a name="l01013"></a>01013 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a> dmd(<a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>);
1041
<a name="l01014"></a>01014
1042
<a name="l01015"></a>01015 <a class="code" href="a00126.html#ga815fef76f02576ab9ab58de0a45d8a4b" title="Distance computing template function.">distance_operation</a>(bv1, bv2, &dmd, &dmd+1);
1043
<a name="l01016"></a>01016 <span class="keywordflow">return</span> dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>;
1044
<a name="l01017"></a>01017 }
1045
<a name="l01018"></a>01018
1046
<a name="l01019"></a>01019 <span class="comment"></span>
1047
<a name="l01020"></a>01020 <span class="comment">/*!</span>
1048
<a name="l01021"></a>01021 <span class="comment"> \brief Computes if there is any bit in SUB operation of two bitsets</span>
1049
<a name="l01022"></a>01022 <span class="comment"> \param bv1 - Argument bit-vector.</span>
1050
<a name="l01023"></a>01023 <span class="comment"> \param bv2 - Argument bit-vector.</span>
1051
<a name="l01024"></a>01024 <span class="comment"> \return non zero value if there is any bit</span>
1052
<a name="l01025"></a>01025 <span class="comment"> \ingroup distance</span>
1053
<a name="l01026"></a>01026 <span class="comment">*/</span>
1054
<a name="l01027"></a>01027 <span class="keyword">template</span><<span class="keyword">class</span> BV>
1055
<a name="l01028"></a><a class="code" href="a00126.html#gabde2e210b9b1edd190e1f5a9ff22344c">01028</a> <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00126.html#gabde2e210b9b1edd190e1f5a9ff22344c" title="Computes if there is any bit in SUB operation of two bitsets.">any_sub</a>(<span class="keyword">const</span> BV& bv1, <span class="keyword">const</span> BV& bv2)
1056
<a name="l01029"></a>01029 {
1057
<a name="l01030"></a>01030 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a> dmd(<a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62" title="(A - B).count()">bm::COUNT_SUB_AB</a>);
1058
<a name="l01031"></a>01031
1059
<a name="l01032"></a>01032 <a class="code" href="a00126.html#gaa66525fd7a3f823d73678252a235982e" title="Distance screening template function.">distance_operation_any</a>(bv1, bv2, &dmd, &dmd+1);
1060
<a name="l01033"></a>01033 <span class="keywordflow">return</span> dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>;
1061
<a name="l01034"></a>01034 }
1062
<a name="l01035"></a>01035
1063
<a name="l01036"></a>01036 <span class="comment"></span>
1064
<a name="l01037"></a>01037 <span class="comment">/*! </span>
1065
<a name="l01038"></a>01038 <span class="comment"> \brief Computes bitcount of OR operation of two bitsets</span>
1066
<a name="l01039"></a>01039 <span class="comment"> \param bv1 - Argument bit-vector.</span>
1067
<a name="l01040"></a>01040 <span class="comment"> \param bv2 - Argument bit-vector.</span>
1068
<a name="l01041"></a>01041 <span class="comment"> \return bitcount of the result</span>
1069
<a name="l01042"></a>01042 <span class="comment"> \ingroup distance</span>
1070
<a name="l01043"></a>01043 <span class="comment">*/</span>
1071
<a name="l01044"></a>01044 <span class="keyword">template</span><<span class="keyword">class</span> BV>
1072
<a name="l01045"></a><a class="code" href="a00126.html#ga803c564668703fc3bf80067570c2c905">01045</a> <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00126.html#ga803c564668703fc3bf80067570c2c905" title="Computes bitcount of OR operation of two bitsets.">count_or</a>(<span class="keyword">const</span> BV& bv1, <span class="keyword">const</span> BV& bv2)
1073
<a name="l01046"></a>01046 {
1074
<a name="l01047"></a>01047 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a> dmd(<a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb" title="(A | B).count()">bm::COUNT_OR</a>);
1075
<a name="l01048"></a>01048
1076
<a name="l01049"></a>01049 <a class="code" href="a00126.html#ga815fef76f02576ab9ab58de0a45d8a4b" title="Distance computing template function.">distance_operation</a>(bv1, bv2, &dmd, &dmd+1);
1077
<a name="l01050"></a>01050 <span class="keywordflow">return</span> dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>;
1078
<a name="l01051"></a>01051 }
1079
<a name="l01052"></a>01052 <span class="comment"></span>
1080
<a name="l01053"></a>01053 <span class="comment">/*!</span>
1081
<a name="l01054"></a>01054 <span class="comment"> \brief Computes if there is any bit in OR operation of two bitsets</span>
1082
<a name="l01055"></a>01055 <span class="comment"> \param bv1 - Argument bit-vector.</span>
1083
<a name="l01056"></a>01056 <span class="comment"> \param bv2 - Argument bit-vector.</span>
1084
<a name="l01057"></a>01057 <span class="comment"> \return non zero value if there is any bit</span>
1085
<a name="l01058"></a>01058 <span class="comment"> \ingroup distance</span>
1086
<a name="l01059"></a>01059 <span class="comment">*/</span>
1087
<a name="l01060"></a>01060 <span class="keyword">template</span><<span class="keyword">class</span> BV>
1088
<a name="l01061"></a><a class="code" href="a00126.html#gaeda4f0cf54aa464cec09e740100caa79">01061</a> <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00126.html#gaeda4f0cf54aa464cec09e740100caa79" title="Computes if there is any bit in OR operation of two bitsets.">any_or</a>(<span class="keyword">const</span> BV& bv1, <span class="keyword">const</span> BV& bv2)
1089
<a name="l01062"></a>01062 {
1090
<a name="l01063"></a>01063 <a class="code" href="a00061.html" title="Distance metric descriptor, holds metric code and result.">distance_metric_descriptor</a> dmd(<a class="code" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb" title="(A | B).count()">bm::COUNT_OR</a>);
1091
<a name="l01064"></a>01064
1092
<a name="l01065"></a>01065 <a class="code" href="a00126.html#gaa66525fd7a3f823d73678252a235982e" title="Distance screening template function.">distance_operation_any</a>(bv1, bv2, &dmd, &dmd+1);
1093
<a name="l01066"></a>01066 <span class="keywordflow">return</span> dmd.<a class="code" href="a00061.html#a94c955fe1ac46589d6edc8df7fd35cf6">result</a>;
1094
<a name="l01067"></a>01067 }
1095
<a name="l01068"></a>01068
1096
<a name="l01069"></a>01069 <span class="comment"></span>
1097
<a name="l01070"></a>01070 <span class="comment">/**</span>
1098
<a name="l01071"></a>01071 <span class="comment"> \brief Internal algorithms scans the input for the block range limit</span>
1099
<a name="l01072"></a>01072 <span class="comment"> \internal</span>
1100
<a name="l01073"></a>01073 <span class="comment">*/</span>
1101
<a name="l01074"></a>01074 <span class="keyword">template</span><<span class="keyword">class</span> It>
1102
<a name="l01075"></a><a class="code" href="a00116.html#a86d5d5ccdb79d2b2ad552bd1caf34b2f">01075</a> It <a class="code" href="a00116.html#a86d5d5ccdb79d2b2ad552bd1caf34b2f" title="Internal algorithms scans the input for the block range limit.">block_range_scan</a>(It first, It last, <span class="keywordtype">unsigned</span> nblock, <span class="keywordtype">unsigned</span>* max_id)
1103
<a name="l01076"></a>01076 {
1104
<a name="l01077"></a>01077 It right;
1105
<a name="l01078"></a>01078 <span class="keywordflow">for</span> (right = first; right != last; ++right)
1106
<a name="l01079"></a>01079 {
1107
<a name="l01080"></a>01080 <span class="keywordtype">unsigned</span> v = unsigned(*right);
1108
<a name="l01081"></a>01081 <a class="code" href="a00093.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(v < <a class="code" href="a00116.html#a104b924a1df81542db2a6296fbf26a65">bm::id_max</a>);
1109
<a name="l01082"></a>01082 <span class="keywordflow">if</span> (v >= *max_id)
1110
<a name="l01083"></a>01083 *max_id = v;
1111
<a name="l01084"></a>01084 <span class="keywordtype">unsigned</span> nb = v >> <a class="code" href="a00116.html#ad8723fbeea6290d3daa8917ea7ce9bb2">bm::set_block_shift</a>;
1112
<a name="l01085"></a>01085 <span class="keywordflow">if</span> (nb != nblock)
1113
<a name="l01086"></a>01086 <span class="keywordflow">break</span>;
1114
<a name="l01087"></a>01087 }
1115
<a name="l01088"></a>01088 <span class="keywordflow">return</span> right;
1116
<a name="l01089"></a>01089 }
1117
<a name="l01090"></a>01090 <span class="comment"></span>
1118
<a name="l01091"></a>01091 <span class="comment">/**</span>
1119
<a name="l01092"></a>01092 <span class="comment"> \brief OR Combine bitvector and the iterable sequence </span>
1120
<a name="l01093"></a>01093 <span class="comment"></span>
1121
<a name="l01094"></a>01094 <span class="comment"> Algorithm combines bvector with sequence of integers </span>
1122
<a name="l01095"></a>01095 <span class="comment"> (represents another set). When the agrument set is sorted </span>
1123
<a name="l01096"></a>01096 <span class="comment"> this method can give serious increase in performance.</span>
1124
<a name="l01097"></a>01097 <span class="comment"> </span>
1125
<a name="l01098"></a>01098 <span class="comment"> \param bv - destination bitvector</span>
1126
<a name="l01099"></a>01099 <span class="comment"> \param first - first element of the iterated sequence</span>
1127
<a name="l01100"></a>01100 <span class="comment"> \param last - last element of the iterated sequence</span>
1128
<a name="l01101"></a>01101 <span class="comment"> </span>
1129
<a name="l01102"></a>01102 <span class="comment"> \ingroup setalgo</span>
1130
<a name="l01103"></a>01103 <span class="comment">*/</span>
1131
<a name="l01104"></a>01104 <span class="keyword">template</span><<span class="keyword">class</span> BV, <span class="keyword">class</span> It>
1132
<a name="l01105"></a><a class="code" href="a00125.html#ga54ff78528c99ae3ca443eb99ba44785b">01105</a> <span class="keywordtype">void</span> <a class="code" href="a00125.html#ga54ff78528c99ae3ca443eb99ba44785b" title="OR Combine bitvector and the iterable sequence.">combine_or</a>(BV& bv, It first, It last)
1133
<a name="l01106"></a>01106 {
1134
<a name="l01107"></a>01107 <span class="keyword">typename</span> BV::blocks_manager_type& bman = bv.get_blocks_manager();
1135
<a name="l01108"></a>01108 <span class="keywordtype">unsigned</span> max_id = 0;
1136
<a name="l01109"></a>01109
1137
<a name="l01110"></a>01110 <span class="keywordflow">while</span> (first < last)
1138
<a name="l01111"></a>01111 {
1139
<a name="l01112"></a>01112 <span class="keywordtype">unsigned</span> nblock = unsigned((*first) >> <a class="code" href="a00116.html#ad8723fbeea6290d3daa8917ea7ce9bb2">bm::set_block_shift</a>);
1140
<a name="l01113"></a>01113 It right = <a class="code" href="a00116.html#a86d5d5ccdb79d2b2ad552bd1caf34b2f" title="Internal algorithms scans the input for the block range limit.">block_range_scan</a>(first, last, nblock, &max_id);
1141
<a name="l01114"></a>01114
1142
<a name="l01115"></a>01115 <span class="keywordflow">if</span> (max_id >= bv.size())
1143
<a name="l01116"></a>01116 {
1144
<a name="l01117"></a>01117 <a class="code" href="a00093.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(max_id < <a class="code" href="a00116.html#a104b924a1df81542db2a6296fbf26a65">bm::id_max</a>);
1145
<a name="l01118"></a>01118 bv.resize(max_id + 1);
1146
<a name="l01119"></a>01119 }
1147
<a name="l01120"></a>01120
1148
<a name="l01121"></a>01121 <span class="comment">// now we have one in-block array of bits to set</span>
1149
<a name="l01122"></a>01122
1150
<a name="l01123"></a>01123 label1:
1151
<a name="l01124"></a>01124
1152
<a name="l01125"></a>01125 <span class="keywordtype">int</span> block_type;
1153
<a name="l01126"></a>01126 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk =
1154
<a name="l01127"></a>01127 bman.check_allocate_block(nblock,
1155
<a name="l01128"></a>01128 <span class="keyword">true</span>,
1156
<a name="l01129"></a>01129 bv.get_new_blocks_strat(),
1157
<a name="l01130"></a>01130 &block_type);
1158
<a name="l01131"></a>01131 <span class="keywordflow">if</span> (!blk)
1159
<a name="l01132"></a>01132 <span class="keywordflow">continue</span>;
1160
<a name="l01133"></a>01133
1161
<a name="l01134"></a>01134 <span class="keywordflow">if</span> (block_type == 1) <span class="comment">// gap</span>
1162
<a name="l01135"></a>01135 {
1163
<a name="l01136"></a>01136 <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* gap_blk = <a class="code" href="a00093.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(blk);
1164
<a name="l01137"></a>01137 <span class="keywordtype">unsigned</span> threshold = <a class="code" href="a00120.html#ga94a5371b5dc6a1560d95d7c2dde88815" title="Returs GAP block capacity limit.">bm::gap_limit</a>(gap_blk, bman.glen());
1165
<a name="l01138"></a>01138
1166
<a name="l01139"></a>01139 <span class="keywordflow">for</span> (; first < right; ++first)
1167
<a name="l01140"></a>01140 {
1168
<a name="l01141"></a>01141 <span class="keywordtype">unsigned</span> is_set;
1169
<a name="l01142"></a>01142 <span class="keywordtype">unsigned</span> nbit = (*first) & <a class="code" href="a00116.html#a201fb8b1f81b7487f1c1c129fc3d6557">bm::set_block_mask</a>;
1170
<a name="l01143"></a>01143
1171
<a name="l01144"></a>01144 <span class="keywordtype">unsigned</span> new_block_len =
1172
<a name="l01145"></a>01145 <a class="code" href="a00120.html#ga69186bd13bda27e04b3e33683ff884c2" title="Abstract distance(similarity) operation for GAP buffers. Receives functor F as a...">gap_set_value</a>(<span class="keyword">true</span>, gap_blk, nbit, &is_set);
1173
<a name="l01146"></a>01146 <span class="keywordflow">if</span> (new_block_len > threshold)
1174
<a name="l01147"></a>01147 {
1175
<a name="l01148"></a>01148 bman.extend_gap_block(nblock, gap_blk);
1176
<a name="l01149"></a>01149 ++first;
1177
<a name="l01150"></a>01150 <span class="keywordflow">goto</span> label1; <span class="comment">// block pointer changed - goto reset</span>
1178
<a name="l01151"></a>01151 }
1179
<a name="l01152"></a>01152 }
1180
<a name="l01153"></a>01153 }
1181
<a name="l01154"></a>01154 <span class="keywordflow">else</span> <span class="comment">// bit block</span>
1182
<a name="l01155"></a>01155 {
1183
<a name="l01156"></a>01156 <span class="keywordflow">for</span> (; first < right; ++first)
1184
<a name="l01157"></a>01157 {
1185
<a name="l01158"></a>01158 <span class="keywordtype">unsigned</span> nbit = unsigned(*first & <a class="code" href="a00116.html#a201fb8b1f81b7487f1c1c129fc3d6557">bm::set_block_mask</a>);
1186
<a name="l01159"></a>01159 <span class="keywordtype">unsigned</span> nword = unsigned(nbit >> <a class="code" href="a00116.html#a83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>);
1187
<a name="l01160"></a>01160 nbit &= <a class="code" href="a00116.html#addbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>;
1188
<a name="l01161"></a>01161 blk[nword] |= (<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>)1 << nbit;
1189
<a name="l01162"></a>01162 } <span class="comment">// for</span>
1190
<a name="l01163"></a>01163 }
1191
<a name="l01164"></a>01164 } <span class="comment">// while</span>
1192
<a name="l01165"></a>01165
1193
<a name="l01166"></a>01166 bv.forget_count();
1194
<a name="l01167"></a>01167 }
1195
<a name="l01168"></a>01168
1196
<a name="l01169"></a>01169 <span class="comment"></span>
1197
<a name="l01170"></a>01170 <span class="comment">/**</span>
1198
<a name="l01171"></a>01171 <span class="comment"> \brief XOR Combine bitvector and the iterable sequence </span>
1199
<a name="l01172"></a>01172 <span class="comment"></span>
1200
<a name="l01173"></a>01173 <span class="comment"> Algorithm combines bvector with sequence of integers </span>
1201
<a name="l01174"></a>01174 <span class="comment"> (represents another set). When the agrument set is sorted </span>
1202
<a name="l01175"></a>01175 <span class="comment"> this method can give serious increase in performance.</span>
1203
<a name="l01176"></a>01176 <span class="comment"> </span>
1204
<a name="l01177"></a>01177 <span class="comment"> \param bv - destination bitvector</span>
1205
<a name="l01178"></a>01178 <span class="comment"> \param first - first element of the iterated sequence</span>
1206
<a name="l01179"></a>01179 <span class="comment"> \param last - last element of the iterated sequence</span>
1207
<a name="l01180"></a>01180 <span class="comment"> </span>
1208
<a name="l01181"></a>01181 <span class="comment"> \ingroup setalgo</span>
1209
<a name="l01182"></a>01182 <span class="comment">*/</span>
1210
<a name="l01183"></a>01183 <span class="keyword">template</span><<span class="keyword">class</span> BV, <span class="keyword">class</span> It>
1211
<a name="l01184"></a><a class="code" href="a00125.html#ga3cb362aee03de6a321495100ae5c8375">01184</a> <span class="keywordtype">void</span> <a class="code" href="a00125.html#ga3cb362aee03de6a321495100ae5c8375" title="XOR Combine bitvector and the iterable sequence.">combine_xor</a>(BV& bv, It first, It last)
1212
<a name="l01185"></a>01185 {
1213
<a name="l01186"></a>01186 <span class="keyword">typename</span> BV::blocks_manager_type& bman = bv.get_blocks_manager();
1214
<a name="l01187"></a>01187 <span class="keywordtype">unsigned</span> max_id = 0;
1215
<a name="l01188"></a>01188
1216
<a name="l01189"></a>01189 <span class="keywordflow">while</span> (first < last)
1217
<a name="l01190"></a>01190 {
1218
<a name="l01191"></a>01191 <span class="keywordtype">unsigned</span> nblock = unsigned((*first) >> <a class="code" href="a00116.html#ad8723fbeea6290d3daa8917ea7ce9bb2">bm::set_block_shift</a>);
1219
<a name="l01192"></a>01192 It right = <a class="code" href="a00116.html#a86d5d5ccdb79d2b2ad552bd1caf34b2f" title="Internal algorithms scans the input for the block range limit.">block_range_scan</a>(first, last, nblock, &max_id);
1220
<a name="l01193"></a>01193
1221
<a name="l01194"></a>01194 <span class="keywordflow">if</span> (max_id >= bv.size())
1222
<a name="l01195"></a>01195 {
1223
<a name="l01196"></a>01196 <a class="code" href="a00093.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(max_id < <a class="code" href="a00116.html#a104b924a1df81542db2a6296fbf26a65">bm::id_max</a>);
1224
<a name="l01197"></a>01197 bv.resize(max_id + 1);
1225
<a name="l01198"></a>01198 }
1226
<a name="l01199"></a>01199
1227
<a name="l01200"></a>01200 <span class="comment">// now we have one in-block array of bits to set</span>
1228
<a name="l01201"></a>01201
1229
<a name="l01202"></a>01202 label1:
1230
<a name="l01203"></a>01203
1231
<a name="l01204"></a>01204 <span class="keywordtype">int</span> block_type;
1232
<a name="l01205"></a>01205 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk =
1233
<a name="l01206"></a>01206 bman.check_allocate_block(nblock,
1234
<a name="l01207"></a>01207 <span class="keyword">true</span>,
1235
<a name="l01208"></a>01208 bv.get_new_blocks_strat(),
1236
<a name="l01209"></a>01209 &block_type,
1237
<a name="l01210"></a>01210 <span class="keyword">false</span> <span class="comment">/* no null return */</span>);
1238
<a name="l01211"></a>01211 <a class="code" href="a00093.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(blk);
1239
<a name="l01212"></a>01212
1240
<a name="l01213"></a>01213 <span class="keywordflow">if</span> (block_type == 1) <span class="comment">// gap</span>
1241
<a name="l01214"></a>01214 {
1242
<a name="l01215"></a>01215 <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* gap_blk = <a class="code" href="a00093.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(blk);
1243
<a name="l01216"></a>01216 <span class="keywordtype">unsigned</span> threshold = <a class="code" href="a00120.html#ga94a5371b5dc6a1560d95d7c2dde88815" title="Returs GAP block capacity limit.">bm::gap_limit</a>(gap_blk, bman.glen());
1244
<a name="l01217"></a>01217
1245
<a name="l01218"></a>01218 <span class="keywordflow">for</span> (; first < right; ++first)
1246
<a name="l01219"></a>01219 {
1247
<a name="l01220"></a>01220 <span class="keywordtype">unsigned</span> is_set;
1248
<a name="l01221"></a>01221 <span class="keywordtype">unsigned</span> nbit = (*first) & <a class="code" href="a00116.html#a201fb8b1f81b7487f1c1c129fc3d6557">bm::set_block_mask</a>;
1249
<a name="l01222"></a>01222
1250
<a name="l01223"></a>01223 is_set = <a class="code" href="a00120.html#ga866352ef5986a7d2b709795d127b666b" title="Tests if bit = pos is true.">gap_test</a>(gap_blk, nbit);
1251
<a name="l01224"></a>01224 <a class="code" href="a00093.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(is_set <= 1);
1252
<a name="l01225"></a>01225 is_set ^= 1;
1253
<a name="l01226"></a>01226
1254
<a name="l01227"></a>01227 <span class="keywordtype">unsigned</span> new_block_len =
1255
<a name="l01228"></a>01228 <a class="code" href="a00120.html#ga69186bd13bda27e04b3e33683ff884c2" title="Abstract distance(similarity) operation for GAP buffers. Receives functor F as a...">gap_set_value</a>(is_set, gap_blk, nbit, &is_set);
1256
<a name="l01229"></a>01229 <span class="keywordflow">if</span> (new_block_len > threshold)
1257
<a name="l01230"></a>01230 {
1258
<a name="l01231"></a>01231 bman.extend_gap_block(nblock, gap_blk);
1259
<a name="l01232"></a>01232 ++first;
1260
<a name="l01233"></a>01233 <span class="keywordflow">goto</span> label1; <span class="comment">// block pointer changed - goto reset</span>
1261
<a name="l01234"></a>01234 }
1262
<a name="l01235"></a>01235 }
1263
<a name="l01236"></a>01236 }
1264
<a name="l01237"></a>01237 <span class="keywordflow">else</span> <span class="comment">// bit block</span>
1265
<a name="l01238"></a>01238 {
1266
<a name="l01239"></a>01239 <span class="keywordflow">for</span> (; first < right; ++first)
1267
<a name="l01240"></a>01240 {
1268
<a name="l01241"></a>01241 <span class="keywordtype">unsigned</span> nbit = unsigned(*first & <a class="code" href="a00116.html#a201fb8b1f81b7487f1c1c129fc3d6557">bm::set_block_mask</a>);
1269
<a name="l01242"></a>01242 <span class="keywordtype">unsigned</span> nword = unsigned(nbit >> <a class="code" href="a00116.html#a83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>);
1270
<a name="l01243"></a>01243 nbit &= <a class="code" href="a00116.html#addbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>;
1271
<a name="l01244"></a>01244 blk[nword] ^= (<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>)1 << nbit;
1272
<a name="l01245"></a>01245 } <span class="comment">// for</span>
1273
<a name="l01246"></a>01246 }
1274
<a name="l01247"></a>01247 } <span class="comment">// while</span>
1275
<a name="l01248"></a>01248
1276
<a name="l01249"></a>01249 bv.forget_count();
1277
<a name="l01250"></a>01250 }
1278
<a name="l01251"></a>01251
1279
<a name="l01252"></a>01252
1280
<a name="l01253"></a>01253 <span class="comment"></span>
1281
<a name="l01254"></a>01254 <span class="comment">/**</span>
1282
<a name="l01255"></a>01255 <span class="comment"> \brief SUB Combine bitvector and the iterable sequence </span>
1283
<a name="l01256"></a>01256 <span class="comment"></span>
1284
<a name="l01257"></a>01257 <span class="comment"> Algorithm combines bvector with sequence of integers </span>
1285
<a name="l01258"></a>01258 <span class="comment"> (represents another set). When the agrument set is sorted </span>
1286
<a name="l01259"></a>01259 <span class="comment"> this method can give serious increase in performance.</span>
1287
<a name="l01260"></a>01260 <span class="comment"> </span>
1288
<a name="l01261"></a>01261 <span class="comment"> \param bv - destination bitvector</span>
1289
<a name="l01262"></a>01262 <span class="comment"> \param first - first element of the iterated sequence</span>
1290
<a name="l01263"></a>01263 <span class="comment"> \param last - last element of the iterated sequence</span>
1291
<a name="l01264"></a>01264 <span class="comment"> </span>
1292
<a name="l01265"></a>01265 <span class="comment"> \ingroup setalgo</span>
1293
<a name="l01266"></a>01266 <span class="comment">*/</span>
1294
<a name="l01267"></a>01267 <span class="keyword">template</span><<span class="keyword">class</span> BV, <span class="keyword">class</span> It>
1295
<a name="l01268"></a><a class="code" href="a00125.html#gab88c5bf51484323e0139aa789d7f0b98">01268</a> <span class="keywordtype">void</span> <a class="code" href="a00125.html#gab88c5bf51484323e0139aa789d7f0b98" title="SUB Combine bitvector and the iterable sequence.">combine_sub</a>(BV& bv, It first, It last)
1296
<a name="l01269"></a>01269 {
1297
<a name="l01270"></a>01270 <span class="keyword">typename</span> BV::blocks_manager_type& bman = bv.get_blocks_manager();
1298
<a name="l01271"></a>01271 <span class="keywordtype">unsigned</span> max_id = 0;
1299
<a name="l01272"></a>01272
1300
<a name="l01273"></a>01273 <span class="keywordflow">while</span> (first < last)
1301
<a name="l01274"></a>01274 {
1302
<a name="l01275"></a>01275 <span class="keywordtype">unsigned</span> nblock = unsigned((*first) >> <a class="code" href="a00116.html#ad8723fbeea6290d3daa8917ea7ce9bb2">bm::set_block_shift</a>);
1303
<a name="l01276"></a>01276 It right = <a class="code" href="a00116.html#a86d5d5ccdb79d2b2ad552bd1caf34b2f" title="Internal algorithms scans the input for the block range limit.">block_range_scan</a>(first, last, nblock, &max_id);
1304
<a name="l01277"></a>01277
1305
<a name="l01278"></a>01278 <span class="keywordflow">if</span> (max_id >= bv.size())
1306
<a name="l01279"></a>01279 {
1307
<a name="l01280"></a>01280 <a class="code" href="a00093.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(max_id < <a class="code" href="a00116.html#a104b924a1df81542db2a6296fbf26a65">bm::id_max</a>);
1308
<a name="l01281"></a>01281 bv.resize(max_id + 1);
1309
<a name="l01282"></a>01282 }
1310
<a name="l01283"></a>01283
1311
<a name="l01284"></a>01284 <span class="comment">// now we have one in-block array of bits to set</span>
1312
<a name="l01285"></a>01285
1313
<a name="l01286"></a>01286 label1:
1314
<a name="l01287"></a>01287
1315
<a name="l01288"></a>01288 <span class="keywordtype">int</span> block_type;
1316
<a name="l01289"></a>01289 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk =
1317
<a name="l01290"></a>01290 bman.check_allocate_block(nblock,
1318
<a name="l01291"></a>01291 <span class="keyword">false</span>,
1319
<a name="l01292"></a>01292 bv.get_new_blocks_strat(),
1320
<a name="l01293"></a>01293 &block_type);
1321
<a name="l01294"></a>01294
1322
<a name="l01295"></a>01295 <span class="keywordflow">if</span> (!blk)
1323
<a name="l01296"></a>01296 <span class="keywordflow">continue</span>;
1324
<a name="l01297"></a>01297
1325
<a name="l01298"></a>01298 <span class="keywordflow">if</span> (block_type == 1) <span class="comment">// gap</span>
1326
<a name="l01299"></a>01299 {
1327
<a name="l01300"></a>01300 <a class="code" href="a00116.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* gap_blk = <a class="code" href="a00093.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(blk);
1328
<a name="l01301"></a>01301 <span class="keywordtype">unsigned</span> threshold = <a class="code" href="a00120.html#ga94a5371b5dc6a1560d95d7c2dde88815" title="Returs GAP block capacity limit.">bm::gap_limit</a>(gap_blk, bman.glen());
1329
<a name="l01302"></a>01302
1330
<a name="l01303"></a>01303 <span class="keywordflow">for</span> (; first < right; ++first)
1331
<a name="l01304"></a>01304 {
1332
<a name="l01305"></a>01305 <span class="keywordtype">unsigned</span> is_set;
1333
<a name="l01306"></a>01306 <span class="keywordtype">unsigned</span> nbit = (*first) & <a class="code" href="a00116.html#a201fb8b1f81b7487f1c1c129fc3d6557">bm::set_block_mask</a>;
1334
<a name="l01307"></a>01307
1335
<a name="l01308"></a>01308 is_set = <a class="code" href="a00120.html#ga866352ef5986a7d2b709795d127b666b" title="Tests if bit = pos is true.">gap_test</a>(gap_blk, nbit);
1336
<a name="l01309"></a>01309 <span class="keywordflow">if</span> (!is_set)
1337
<a name="l01310"></a>01310 <span class="keywordflow">continue</span>;
1338
<a name="l01311"></a>01311
1339
<a name="l01312"></a>01312 <span class="keywordtype">unsigned</span> new_block_len =
1340
<a name="l01313"></a>01313 <a class="code" href="a00120.html#ga69186bd13bda27e04b3e33683ff884c2" title="Abstract distance(similarity) operation for GAP buffers. Receives functor F as a...">gap_set_value</a>(<span class="keyword">false</span>, gap_blk, nbit, &is_set);
1341
<a name="l01314"></a>01314 <span class="keywordflow">if</span> (new_block_len > threshold)
1342
<a name="l01315"></a>01315 {
1343
<a name="l01316"></a>01316 bman.extend_gap_block(nblock, gap_blk);
1344
<a name="l01317"></a>01317 ++first;
1345
<a name="l01318"></a>01318 <span class="keywordflow">goto</span> label1; <span class="comment">// block pointer changed - goto reset</span>
1346
<a name="l01319"></a>01319 }
1347
<a name="l01320"></a>01320 }
1348
<a name="l01321"></a>01321 }
1349
<a name="l01322"></a>01322 <span class="keywordflow">else</span> <span class="comment">// bit block</span>
1350
<a name="l01323"></a>01323 {
1351
<a name="l01324"></a>01324 <span class="keywordflow">for</span> (; first < right; ++first)
1352
<a name="l01325"></a>01325 {
1353
<a name="l01326"></a>01326 <span class="keywordtype">unsigned</span> nbit = unsigned(*first & <a class="code" href="a00116.html#a201fb8b1f81b7487f1c1c129fc3d6557">bm::set_block_mask</a>);
1354
<a name="l01327"></a>01327 <span class="keywordtype">unsigned</span> nword = unsigned(nbit >> <a class="code" href="a00116.html#a83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>);
1355
<a name="l01328"></a>01328 nbit &= <a class="code" href="a00116.html#addbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>;
1356
<a name="l01329"></a>01329 blk[nword] &= ~((<a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>)1 << nbit);
1357
<a name="l01330"></a>01330 } <span class="comment">// for</span>
1358
<a name="l01331"></a>01331 }
1359
<a name="l01332"></a>01332 } <span class="comment">// while</span>
1360
<a name="l01333"></a>01333
1361
<a name="l01334"></a>01334 bv.forget_count();
1362
<a name="l01335"></a>01335 }
1363
<a name="l01336"></a>01336 <span class="comment"></span>
1364
<a name="l01337"></a>01337 <span class="comment">/**</span>
1365
<a name="l01338"></a>01338 <span class="comment"> \brief AND Combine bitvector and the iterable sequence </span>
1366
<a name="l01339"></a>01339 <span class="comment"></span>
1367
<a name="l01340"></a>01340 <span class="comment"> Algorithm combines bvector with sorted sequence of integers </span>
1368
<a name="l01341"></a>01341 <span class="comment"> (represents another set).</span>
1369
<a name="l01342"></a>01342 <span class="comment"> </span>
1370
<a name="l01343"></a>01343 <span class="comment"> \param bv - destination bitvector</span>
1371
<a name="l01344"></a>01344 <span class="comment"> \param first - first element of the iterated sequence</span>
1372
<a name="l01345"></a>01345 <span class="comment"> \param last - last element of the iterated sequence</span>
1373
<a name="l01346"></a>01346 <span class="comment"> </span>
1374
<a name="l01347"></a>01347 <span class="comment"> \ingroup setalgo</span>
1375
<a name="l01348"></a>01348 <span class="comment">*/</span>
1376
<a name="l01349"></a>01349 <span class="keyword">template</span><<span class="keyword">class</span> BV, <span class="keyword">class</span> It>
1377
<a name="l01350"></a><a class="code" href="a00125.html#ga22922f71bd1eec8a5b663dc77b90cf6c">01350</a> <span class="keywordtype">void</span> <a class="code" href="a00125.html#ga22922f71bd1eec8a5b663dc77b90cf6c" title="AND Combine bitvector and the iterable sequence.">combine_and_sorted</a>(BV& bv, It first, It last)
1378
<a name="l01351"></a>01351 {
1379
<a name="l01352"></a>01352 <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> prev = 0;
1380
<a name="l01353"></a>01353 <span class="keywordflow">for</span> ( ;first < last; ++first)
1381
<a name="l01354"></a>01354 {
1382
<a name="l01355"></a>01355 <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <span class="keywordtype">id</span> = *first;
1383
<a name="l01356"></a>01356 <a class="code" href="a00093.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(<span class="keywordtype">id</span> >= prev); <span class="comment">// make sure it's sorted</span>
1384
<a name="l01357"></a>01357 bv.set_bit_and(<span class="keywordtype">id</span>, <span class="keyword">true</span>);
1385
<a name="l01358"></a>01358 <span class="keywordflow">if</span> (++prev < <span class="keywordtype">id</span>)
1386
<a name="l01359"></a>01359 {
1387
<a name="l01360"></a>01360 bv.set_range(prev, <span class="keywordtype">id</span>-1, <span class="keyword">false</span>);
1388
<a name="l01361"></a>01361 }
1389
<a name="l01362"></a>01362 prev = id;
1390
<a name="l01363"></a>01363 }
1391
<a name="l01364"></a>01364 }
1392
<a name="l01365"></a>01365
1393
<a name="l01366"></a>01366 <span class="comment"></span>
1394
<a name="l01367"></a>01367 <span class="comment">/**</span>
1395
<a name="l01368"></a>01368 <span class="comment"> \brief AND Combine bitvector and the iterable sequence </span>
1396
<a name="l01369"></a>01369 <span class="comment"></span>
1397
<a name="l01370"></a>01370 <span class="comment"> Algorithm combines bvector with sequence of integers </span>
1398
<a name="l01371"></a>01371 <span class="comment"> (represents another set). When the agrument set is sorted </span>
1399
<a name="l01372"></a>01372 <span class="comment"> this method can give serious increase in performance.</span>
1400
<a name="l01373"></a>01373 <span class="comment"> </span>
1401
<a name="l01374"></a>01374 <span class="comment"> \param bv - destination bitvector</span>
1402
<a name="l01375"></a>01375 <span class="comment"> \param first - first element of the iterated sequence</span>
1403
<a name="l01376"></a>01376 <span class="comment"> \param last - last element of the iterated sequence</span>
1404
<a name="l01377"></a>01377 <span class="comment"> </span>
1405
<a name="l01378"></a>01378 <span class="comment"> \ingroup setalgo</span>
1406
<a name="l01379"></a>01379 <span class="comment"> \sa combine_and_sorted</span>
1407
<a name="l01380"></a>01380 <span class="comment">*/</span>
1408
<a name="l01381"></a>01381 <span class="keyword">template</span><<span class="keyword">class</span> BV, <span class="keyword">class</span> It>
1409
<a name="l01382"></a><a class="code" href="a00125.html#ga819bdab57a624a08456ea79161b9c5d2">01382</a> <span class="keywordtype">void</span> <a class="code" href="a00125.html#ga819bdab57a624a08456ea79161b9c5d2" title="AND Combine bitvector and the iterable sequence.">combine_and</a>(BV& bv, It first, It last)
1410
<a name="l01383"></a>01383 {
1411
<a name="l01384"></a>01384 BV bv_tmp;
1412
<a name="l01385"></a>01385 <a class="code" href="a00125.html#ga54ff78528c99ae3ca443eb99ba44785b" title="OR Combine bitvector and the iterable sequence.">combine_or</a>(bv_tmp, first, last);
1413
<a name="l01386"></a>01386 bv &= bv_tmp;
1414
<a name="l01387"></a>01387 }
1415
<a name="l01388"></a>01388 <span class="comment"></span>
1416
<a name="l01389"></a>01389 <span class="comment">/*!</span>
1417
<a name="l01390"></a>01390 <span class="comment"> \brief Compute number of bit intervals (GAPs) in the bitvector</span>
1418
<a name="l01391"></a>01391 <span class="comment"> </span>
1419
<a name="l01392"></a>01392 <span class="comment"> Algorithm traverses bit vector and count number of uninterrupted</span>
1420
<a name="l01393"></a>01393 <span class="comment"> intervals of 1s and 0s.</span>
1421
<a name="l01394"></a>01394 <span class="comment"> <pre></span>
1422
<a name="l01395"></a>01395 <span class="comment"> For example: </span>
1423
<a name="l01396"></a>01396 <span class="comment"> 00001111100000 - gives us 3 intervals</span>
1424
<a name="l01397"></a>01397 <span class="comment"> 10001111100000 - 4 intervals</span>
1425
<a name="l01398"></a>01398 <span class="comment"> 00000000000000 - 1 interval</span>
1426
<a name="l01399"></a>01399 <span class="comment"> 11111111111111 - 1 interval</span>
1427
<a name="l01400"></a>01400 <span class="comment"> </pre></span>
1428
<a name="l01401"></a>01401 <span class="comment"> \return Number of intervals</span>
1429
<a name="l01402"></a>01402 <span class="comment"> \ingroup setalgo</span>
1430
<a name="l01403"></a>01403 <span class="comment">*/</span>
1431
<a name="l01404"></a>01404 <span class="keyword">template</span><<span class="keyword">class</span> BV>
1432
<a name="l01405"></a><a class="code" href="a00125.html#gac7a59d3bc266310ec127cb3efadb0d33">01405</a> <a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> <a class="code" href="a00125.html#gac7a59d3bc266310ec127cb3efadb0d33" title="Compute number of bit intervals (GAPs) in the bitvector.">count_intervals</a>(<span class="keyword">const</span> BV& bv)
1433
<a name="l01406"></a>01406 {
1434
<a name="l01407"></a>01407 <span class="keyword">const</span> <span class="keyword">typename</span> BV::blocks_manager_type& bman = bv.get_blocks_manager();
1435
<a name="l01408"></a>01408
1436
<a name="l01409"></a>01409 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*** blk_root = bman.get_rootblock();
1437
<a name="l01410"></a>01410 <span class="keyword">typename</span> BV::blocks_manager_type::block_count_change_func func(bman);
1438
<a name="l01411"></a>01411 <a class="code" href="a00116.html#a86742a3e17527be5a9743f26b36a7691">for_each_block</a>(blk_root, bman.top_block_size(), <a class="code" href="a00116.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>, func);
1439
<a name="l01412"></a>01412
1440
<a name="l01413"></a>01413 <span class="keywordflow">return</span> func.count();
1441
<a name="l01414"></a>01414 }
1442
<a name="l01415"></a>01415 <span class="comment"></span>
1443
<a name="l01416"></a>01416 <span class="comment">/*!</span>
1444
<a name="l01417"></a>01417 <span class="comment"> \brief Export bitset from an array of binary data representing</span>
1445
<a name="l01418"></a>01418 <span class="comment"> the bit vector. </span>
1446
<a name="l01419"></a>01419 <span class="comment"></span>
1447
<a name="l01420"></a>01420 <span class="comment"> Input array can be array of ints, chars or other native C types.</span>
1448
<a name="l01421"></a>01421 <span class="comment"> Method works with iterators, which makes it compatible with </span>
1449
<a name="l01422"></a>01422 <span class="comment"> STL containers and C arrays</span>
1450
<a name="l01423"></a>01423 <span class="comment"></span>
1451
<a name="l01424"></a>01424 <span class="comment"> \param bv - destination bitvector</span>
1452
<a name="l01425"></a>01425 <span class="comment"> \param first - first element of the iterated sequence</span>
1453
<a name="l01426"></a>01426 <span class="comment"> \param last - last element of the iterated sequence</span>
1454
<a name="l01427"></a>01427 <span class="comment"></span>
1455
<a name="l01428"></a>01428 <span class="comment"> \ingroup setalgo</span>
1456
<a name="l01429"></a>01429 <span class="comment">*/</span>
1457
<a name="l01430"></a>01430 <span class="keyword">template</span><<span class="keyword">class</span> BV, <span class="keyword">class</span> It>
1458
<a name="l01431"></a><a class="code" href="a00125.html#gacd88ed9539553dd93419b7029e8a4584">01431</a> <span class="keywordtype">void</span> <a class="code" href="a00125.html#gacd88ed9539553dd93419b7029e8a4584" title="Export bitset from an array of binary data representing the bit vector.">export_array</a>(BV& bv, It first, It last)
1459
<a name="l01432"></a>01432 {
1460
<a name="l01433"></a>01433 <span class="keyword">typename</span> BV::blocks_manager_type& bman = bv.get_blocks_manager();
1461
<a name="l01434"></a>01434 <span class="keywordtype">unsigned</span> inp_word_size = <span class="keyword">sizeof</span>(*first);
1462
<a name="l01435"></a>01435 <span class="keywordtype">size_t</span> array_size = last - first;
1463
<a name="l01436"></a>01436 <span class="keywordtype">size_t</span> bit_cnt = array_size * inp_word_size * 8;
1464
<a name="l01437"></a>01437 <span class="keywordtype">int</span> block_type;
1465
<a name="l01438"></a>01438 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> tmp;
1466
<a name="l01439"></a>01439 <span class="keywordtype">unsigned</span> b1, b2, b3, b4;
1467
<a name="l01440"></a>01440
1468
<a name="l01441"></a>01441 <span class="keywordflow">if</span> (bit_cnt >= bv.size())
1469
<a name="l01442"></a>01442 bv.resize((<a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a>)bit_cnt + 1);
1470
<a name="l01443"></a>01443 <span class="keywordflow">else</span>
1471
<a name="l01444"></a>01444 bv.set_range((<a class="code" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a>)bit_cnt, bv.size() - 1, <span class="keyword">false</span>);
1472
<a name="l01445"></a>01445
1473
<a name="l01446"></a>01446 <span class="keywordflow">switch</span> (inp_word_size)
1474
<a name="l01447"></a>01447 {
1475
<a name="l01448"></a>01448 <span class="keywordflow">case</span> 1:
1476
<a name="l01449"></a>01449 {
1477
<a name="l01450"></a>01450 <span class="keywordtype">size_t</span> word_cnt = array_size / 4;
1478
<a name="l01451"></a>01451 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < <a class="code" href="a00116.html#a505011007f54598794e0b9477c0b0b11">bm::set_total_blocks</a>; ++i)
1479
<a name="l01452"></a>01452 {
1480
<a name="l01453"></a>01453 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk =
1481
<a name="l01454"></a>01454 bman.check_allocate_block(i,
1482
<a name="l01455"></a>01455 <span class="keyword">false</span>,
1483
<a name="l01456"></a>01456 <a class="code" href="a00119.html#ggad0b87b3b7292383a864d27feaf1c9effa40920ae0ef7b4411d60463d8f576b5ba" title="No GAP compression strategy. All new blocks are bit blocks.">BM_BIT</a>,
1484
<a name="l01457"></a>01457 &block_type,
1485
<a name="l01458"></a>01458 <span class="keyword">false</span> <span class="comment">/*no NULL ret*/</span>);
1486
<a name="l01459"></a>01459 <span class="keywordflow">if</span> (block_type == 1) <span class="comment">// gap</span>
1487
<a name="l01460"></a>01460 {
1488
<a name="l01461"></a>01461 blk = bman.convert_gap2bitset(i, <a class="code" href="a00093.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(blk));
1489
<a name="l01462"></a>01462 }
1490
<a name="l01463"></a>01463
1491
<a name="l01464"></a>01464 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* wrd_ptr = blk;
1492
<a name="l01465"></a>01465 <span class="keywordflow">if</span> (word_cnt >= <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>) {
1493
<a name="l01466"></a>01466 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* wrd_end = blk + <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;
1494
<a name="l01467"></a>01467 <span class="keywordflow">do</span> {
1495
<a name="l01468"></a>01468 b1 = *first++; b2 = *first++;
1496
<a name="l01469"></a>01469 b3 = *first++; b4 = *first++;
1497
<a name="l01470"></a>01470 tmp = b1 | (b2 << 8) | (b3 << 16) | (b4 << 24);
1498
<a name="l01471"></a>01471 *wrd_ptr++ = tmp;
1499
<a name="l01472"></a>01472 } <span class="keywordflow">while</span> (wrd_ptr < wrd_end);
1500
<a name="l01473"></a>01473 word_cnt -= bm::set_block_size;
1501
<a name="l01474"></a>01474 }
1502
<a name="l01475"></a>01475 <span class="keywordflow">else</span>
1503
<a name="l01476"></a>01476 {
1504
<a name="l01477"></a>01477 <span class="keywordtype">size_t</span> to_convert = last - first;
1505
<a name="l01478"></a>01478 <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j < to_convert / 4; ++j)
1506
<a name="l01479"></a>01479 {
1507
<a name="l01480"></a>01480 b1 = *first++; b2 = *first++;
1508
<a name="l01481"></a>01481 b3 = *first++; b4 = *first++;
1509
<a name="l01482"></a>01482 tmp = b1 | (b2 << 8) | (b3 << 16) | (b4 << 24);
1510
<a name="l01483"></a>01483 *wrd_ptr++ = tmp;
1511
<a name="l01484"></a>01484 }
1512
<a name="l01485"></a>01485 <span class="keywordflow">while</span> (1)
1513
<a name="l01486"></a>01486 {
1514
<a name="l01487"></a>01487 <span class="keywordflow">if</span> (first == last) <span class="keywordflow">break</span>;
1515
<a name="l01488"></a>01488 *wrd_ptr = *first++;
1516
<a name="l01489"></a>01489 <span class="keywordflow">if</span> (first == last) <span class="keywordflow">break</span>;
1517
<a name="l01490"></a>01490 *wrd_ptr |= (*first++) << 8;
1518
<a name="l01491"></a>01491 <span class="keywordflow">if</span> (first == last) <span class="keywordflow">break</span>;
1519
<a name="l01492"></a>01492 *wrd_ptr |= (*first++) << 16;
1520
<a name="l01493"></a>01493 <span class="keywordflow">if</span> (first == last) <span class="keywordflow">break</span>;
1521
<a name="l01494"></a>01494 *wrd_ptr |= (*first++) << 24;
1522
<a name="l01495"></a>01495 ++wrd_ptr;
1523
<a name="l01496"></a>01496 }
1524
<a name="l01497"></a>01497 }
1525
<a name="l01498"></a>01498 <span class="keywordflow">if</span> (first == last) <span class="keywordflow">break</span>;
1526
<a name="l01499"></a>01499 } <span class="comment">// for</span>
1527
<a name="l01500"></a>01500 }
1528
<a name="l01501"></a>01501 <span class="keywordflow">break</span>;
1529
<a name="l01502"></a>01502 <span class="keywordflow">case</span> 2:
1530
<a name="l01503"></a>01503 {
1531
<a name="l01504"></a>01504 <span class="keywordtype">size_t</span> word_cnt = array_size / 2;
1532
<a name="l01505"></a>01505 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < <a class="code" href="a00116.html#a505011007f54598794e0b9477c0b0b11">bm::set_total_blocks</a>; ++i)
1533
<a name="l01506"></a>01506 {
1534
<a name="l01507"></a>01507 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk =
1535
<a name="l01508"></a>01508 bman.check_allocate_block(i,
1536
<a name="l01509"></a>01509 <span class="keyword">false</span>,
1537
<a name="l01510"></a>01510 <a class="code" href="a00119.html#ggad0b87b3b7292383a864d27feaf1c9effa40920ae0ef7b4411d60463d8f576b5ba" title="No GAP compression strategy. All new blocks are bit blocks.">BM_BIT</a>,
1538
<a name="l01511"></a>01511 &block_type,
1539
<a name="l01512"></a>01512 <span class="keyword">false</span> <span class="comment">/*no NULL ret*/</span>);
1540
<a name="l01513"></a>01513 <span class="keywordflow">if</span> (block_type == 1) <span class="comment">// gap</span>
1541
<a name="l01514"></a>01514 {
1542
<a name="l01515"></a>01515 blk = bman.convert_gap2bitset(i, <a class="code" href="a00093.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(blk));
1543
<a name="l01516"></a>01516 }
1544
<a name="l01517"></a>01517
1545
<a name="l01518"></a>01518 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* wrd_ptr = blk;
1546
<a name="l01519"></a>01519 <span class="keywordflow">if</span> (word_cnt >= <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>) {
1547
<a name="l01520"></a>01520 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* wrd_end = blk + <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;
1548
<a name="l01521"></a>01521 <span class="keywordflow">do</span> {
1549
<a name="l01522"></a>01522 b1 = *first++; b2 = *first++;
1550
<a name="l01523"></a>01523 tmp = b1 | (b2 << 16);
1551
<a name="l01524"></a>01524 *wrd_ptr++ = tmp;
1552
<a name="l01525"></a>01525 } <span class="keywordflow">while</span> (wrd_ptr < wrd_end);
1553
<a name="l01526"></a>01526 word_cnt -= bm::set_block_size;
1554
<a name="l01527"></a>01527 }
1555
<a name="l01528"></a>01528 <span class="keywordflow">else</span>
1556
<a name="l01529"></a>01529 {
1557
<a name="l01530"></a>01530 <span class="keywordtype">size_t</span> to_convert = last - first;
1558
<a name="l01531"></a>01531 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> j = 0; j < to_convert / 2; ++j)
1559
<a name="l01532"></a>01532 {
1560
<a name="l01533"></a>01533 b1 = *first++; b2 = *first++;
1561
<a name="l01534"></a>01534 tmp = b1 | (b2 << 16);
1562
<a name="l01535"></a>01535 *wrd_ptr++ = tmp;
1563
<a name="l01536"></a>01536 }
1564
<a name="l01537"></a>01537 <span class="keywordflow">while</span> (1)
1565
<a name="l01538"></a>01538 {
1566
<a name="l01539"></a>01539 <span class="keywordflow">if</span> (first == last) <span class="keywordflow">break</span>;
1567
<a name="l01540"></a>01540 *wrd_ptr = *first++;
1568
<a name="l01541"></a>01541 <span class="keywordflow">if</span> (first == last) <span class="keywordflow">break</span>;
1569
<a name="l01542"></a>01542 *wrd_ptr |= (*first++) << 16;
1570
<a name="l01543"></a>01543 ++wrd_ptr;
1571
<a name="l01544"></a>01544 }
1572
<a name="l01545"></a>01545 }
1573
<a name="l01546"></a>01546 <span class="keywordflow">if</span> (first == last) <span class="keywordflow">break</span>;
1574
<a name="l01547"></a>01547 } <span class="comment">// for</span>
1575
<a name="l01548"></a>01548 }
1576
<a name="l01549"></a>01549 <span class="keywordflow">break</span>;
1577
<a name="l01550"></a>01550 <span class="keywordflow">case</span> 4:
1578
<a name="l01551"></a>01551 {
1579
<a name="l01552"></a>01552 <span class="keywordtype">size_t</span> word_cnt = array_size;
1580
<a name="l01553"></a>01553 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < <a class="code" href="a00116.html#a505011007f54598794e0b9477c0b0b11">bm::set_total_blocks</a>; ++i)
1581
<a name="l01554"></a>01554 {
1582
<a name="l01555"></a>01555 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* blk =
1583
<a name="l01556"></a>01556 bman.check_allocate_block(i,
1584
<a name="l01557"></a>01557 <span class="keyword">false</span>,
1585
<a name="l01558"></a>01558 <a class="code" href="a00119.html#ggad0b87b3b7292383a864d27feaf1c9effa40920ae0ef7b4411d60463d8f576b5ba" title="No GAP compression strategy. All new blocks are bit blocks.">BM_BIT</a>,
1586
<a name="l01559"></a>01559 &block_type,
1587
<a name="l01560"></a>01560 <span class="keyword">false</span> <span class="comment">/*no NULL ret*/</span>);
1588
<a name="l01561"></a>01561 <span class="keywordflow">if</span> (block_type == 1) <span class="comment">// gap</span>
1589
<a name="l01562"></a>01562 {
1590
<a name="l01563"></a>01563 blk = bman.convert_gap2bitset(i, <a class="code" href="a00093.html#a6a7c8b8ee3f3b60ab907c1699acb7aa0">BMGAP_PTR</a>(blk));
1591
<a name="l01564"></a>01564 }
1592
<a name="l01565"></a>01565
1593
<a name="l01566"></a>01566 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* wrd_ptr = blk;
1594
<a name="l01567"></a>01567 <span class="keywordflow">if</span> (word_cnt >= <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>) {
1595
<a name="l01568"></a>01568 <a class="code" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* wrd_end = blk + <a class="code" href="a00116.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a>;
1596
<a name="l01569"></a>01569 <span class="keywordflow">do</span> {
1597
<a name="l01570"></a>01570 *wrd_ptr++ = *first++;
1598
<a name="l01571"></a>01571 } <span class="keywordflow">while</span> (wrd_ptr < wrd_end);
1599
<a name="l01572"></a>01572 word_cnt -= bm::set_block_size;
1600
<a name="l01573"></a>01573 }
1601
<a name="l01574"></a>01574 <span class="keywordflow">else</span>
1602
<a name="l01575"></a>01575 {
1603
<a name="l01576"></a>01576 <span class="keywordflow">while</span> (1)
1604
<a name="l01577"></a>01577 {
1605
<a name="l01578"></a>01578 <span class="keywordflow">if</span> (first == last) <span class="keywordflow">break</span>;
1606
<a name="l01579"></a>01579 *wrd_ptr = *first++;
1607
<a name="l01580"></a>01580 ++wrd_ptr;
1608
<a name="l01581"></a>01581 }
1609
<a name="l01582"></a>01582 }
1610
<a name="l01583"></a>01583 <span class="keywordflow">if</span> (first == last) <span class="keywordflow">break</span>;
1611
<a name="l01584"></a>01584 } <span class="comment">// for</span>
1612
<a name="l01585"></a>01585 }
1613
<a name="l01586"></a>01586 <span class="keywordflow">break</span>;
1614
<a name="l01587"></a>01587 <span class="keywordflow">default</span>:
1615
<a name="l01588"></a>01588 <a class="code" href="a00093.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(0);
1616
<a name="l01589"></a>01589 } <span class="comment">// switch</span>
1617
<a name="l01590"></a>01590
1618
<a name="l01591"></a>01591 }
1619
<a name="l01592"></a>01592
1620
<a name="l01593"></a>01593 } <span class="comment">// namespace bm</span>
1621
<a name="l01594"></a>01594
1622
<a name="l01595"></a>01595 <span class="preprocessor">#ifdef _MSC_VER</span>
1623
<a name="l01596"></a>01596 <span class="preprocessor"></span><span class="preprocessor">#pragma warning( default : 4311 4312)</span>
1624
<a name="l01597"></a>01597 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
1625
<a name="l01598"></a>01598 <span class="preprocessor"></span>
1626
<a name="l01599"></a>01599 <span class="preprocessor">#endif</span>
70
<a name="l00043"></a>00043 <span class="comment">/*! </span>
71
<a name="l00044"></a>00044 <span class="comment"> @brief Default malloc based bitblock allocator class.</span>
72
<a name="l00045"></a>00045 <span class="comment"></span>
73
<a name="l00046"></a>00046 <span class="comment"> Functions allocate and deallocate conform to STL allocator specs.</span>
74
<a name="l00047"></a>00047 <span class="comment"> @ingroup alloc</span>
75
<a name="l00048"></a>00048 <span class="comment">*/</span>
76
<a name="l00049"></a><a class="code" href="a00038.html">00049</a> <span class="keyword">class </span><a class="code" href="a00038.html" title="Default malloc based bitblock allocator class.">block_allocator</a>
77
<a name="l00050"></a>00050 {
78
<a name="l00051"></a>00051 <span class="keyword">public</span>:<span class="comment"></span>
79
<a name="l00052"></a>00052 <span class="comment"> /**</span>
80
<a name="l00053"></a>00053 <span class="comment"> The member function allocates storage for an array of n bm::word_t </span>
81
<a name="l00054"></a>00054 <span class="comment"> elements, by calling malloc. </span>
82
<a name="l00055"></a>00055 <span class="comment"> @return pointer to the allocated memory. </span>
83
<a name="l00056"></a>00056 <span class="comment"> */</span>
84
<a name="l00057"></a><a class="code" href="a00038.html#a1b90487ff442d774f3f9d888fb0e54ba">00057</a> <span class="keyword">static</span> <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00038.html#a1b90487ff442d774f3f9d888fb0e54ba" title="The member function allocates storage for an array of n bm::word_t elements, by calling...">allocate</a>(<span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">void</span> *)
85
<a name="l00058"></a>00058 {
86
<a name="l00059"></a>00059 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* ptr;
87
<a name="l00060"></a>00060 <span class="preprocessor">#if defined(BMSSE2OPT) || defined(BMSSE42OPT)</span>
88
<a name="l00061"></a>00061 <span class="preprocessor"></span><span class="preprocessor"># ifdef _MSC_VER</span>
89
<a name="l00062"></a>00062 <span class="preprocessor"></span> ptr = (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*) ::_aligned_malloc(n * <span class="keyword">sizeof</span>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>), 16);
90
<a name="l00063"></a>00063 <span class="preprocessor">#else</span>
91
<a name="l00064"></a>00064 <span class="preprocessor"></span> ptr = (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*) ::_mm_malloc(n * <span class="keyword">sizeof</span>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>), 16);
92
<a name="l00065"></a>00065 <span class="preprocessor"># endif</span>
93
<a name="l00066"></a>00066 <span class="preprocessor"></span>
94
<a name="l00067"></a>00067 <span class="preprocessor">#else </span>
95
<a name="l00068"></a>00068 <span class="preprocessor"></span> ptr = (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*) ::malloc(n * <span class="keyword">sizeof</span>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>));
96
<a name="l00069"></a>00069 <span class="preprocessor">#endif</span>
97
<a name="l00070"></a>00070 <span class="preprocessor"></span> <span class="keywordflow">if</span> (!ptr)
98
<a name="l00071"></a>00071 {
99
<a name="l00072"></a>00072 <span class="keywordflow">throw</span> std::bad_alloc();
100
<a name="l00073"></a>00073 }
101
<a name="l00074"></a>00074 <span class="keywordflow">return</span> ptr;
102
<a name="l00075"></a>00075 }
103
<a name="l00076"></a>00076 <span class="comment"></span>
104
<a name="l00077"></a>00077 <span class="comment"> /**</span>
105
<a name="l00078"></a>00078 <span class="comment"> The member function frees storage for an array of n bm::word_t </span>
106
<a name="l00079"></a>00079 <span class="comment"> elements, by calling free. </span>
107
<a name="l00080"></a>00080 <span class="comment"> */</span>
108
<a name="l00081"></a><a class="code" href="a00038.html#a68a3365e4decb87fef88c2fa9028c8e2">00081</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="a00038.html#a68a3365e4decb87fef88c2fa9028c8e2" title="The member function frees storage for an array of n bm::word_t elements, by calling...">deallocate</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* p, <span class="keywordtype">size_t</span>)
109
<a name="l00082"></a>00082 {
110
<a name="l00083"></a>00083 <span class="preprocessor">#if defined(BMSSE2OPT) || defined(BMSSE42OPT)</span>
111
<a name="l00084"></a>00084 <span class="preprocessor"></span><span class="preprocessor"># ifdef _MSC_VER</span>
112
<a name="l00085"></a>00085 <span class="preprocessor"></span> ::_aligned_free(p);
113
<a name="l00086"></a>00086 <span class="preprocessor">#else</span>
114
<a name="l00087"></a>00087 <span class="preprocessor"></span> ::_mm_free(p);
115
<a name="l00088"></a>00088 <span class="preprocessor"># endif</span>
116
<a name="l00089"></a>00089 <span class="preprocessor"></span>
117
<a name="l00090"></a>00090 <span class="preprocessor">#else </span>
118
<a name="l00091"></a>00091 <span class="preprocessor"></span> ::free(p);
119
<a name="l00092"></a>00092 <span class="preprocessor">#endif</span>
120
<a name="l00093"></a>00093 <span class="preprocessor"></span> }
121
<a name="l00094"></a>00094
122
<a name="l00095"></a>00095 };
123
<a name="l00096"></a>00096
124
<a name="l00097"></a>00097
125
<a name="l00098"></a>00098 <span class="comment">// -------------------------------------------------------------------------</span>
126
<a name="l00099"></a>00099 <span class="comment"></span>
127
<a name="l00100"></a>00100 <span class="comment">/*! @brief Default malloc based bitblock allocator class.</span>
128
<a name="l00101"></a>00101 <span class="comment"></span>
129
<a name="l00102"></a>00102 <span class="comment"> Functions allocate and deallocate conform to STL allocator specs.</span>
130
<a name="l00103"></a>00103 <span class="comment">*/</span>
131
<a name="l00104"></a><a class="code" href="a00077.html">00104</a> <span class="keyword">class </span><a class="code" href="a00077.html" title="Default malloc based bitblock allocator class.">ptr_allocator</a>
132
<a name="l00105"></a>00105 {
133
<a name="l00106"></a>00106 <span class="keyword">public</span>:<span class="comment"></span>
134
<a name="l00107"></a>00107 <span class="comment"> /**</span>
135
<a name="l00108"></a>00108 <span class="comment"> The member function allocates storage for an array of n void* </span>
136
<a name="l00109"></a>00109 <span class="comment"> elements, by calling malloc. </span>
137
<a name="l00110"></a>00110 <span class="comment"> @return pointer to the allocated memory. </span>
138
<a name="l00111"></a>00111 <span class="comment"> */</span>
139
<a name="l00112"></a><a class="code" href="a00077.html#a2ed8d55900bad5292e06be4af220aa38">00112</a> <span class="keyword">static</span> <span class="keywordtype">void</span>* <a class="code" href="a00077.html#a2ed8d55900bad5292e06be4af220aa38" title="The member function allocates storage for an array of n void* elements, by calling...">allocate</a>(<span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">void</span> *)
140
<a name="l00113"></a>00113 {
141
<a name="l00114"></a>00114 <span class="keywordtype">void</span>* ptr = ::malloc(n * <span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*));
142
<a name="l00115"></a>00115 <span class="keywordflow">if</span> (!ptr)
143
<a name="l00116"></a>00116 {
144
<a name="l00117"></a>00117 <span class="keywordflow">throw</span> std::bad_alloc();
145
<a name="l00118"></a>00118 }
146
<a name="l00119"></a>00119 <span class="keywordflow">return</span> ptr;
147
<a name="l00120"></a>00120 }
148
<a name="l00121"></a>00121 <span class="comment"></span>
149
<a name="l00122"></a>00122 <span class="comment"> /**</span>
150
<a name="l00123"></a>00123 <span class="comment"> The member function frees storage for an array of n bm::word_t </span>
151
<a name="l00124"></a>00124 <span class="comment"> elements, by calling free. </span>
152
<a name="l00125"></a>00125 <span class="comment"> */</span>
153
<a name="l00126"></a><a class="code" href="a00077.html#ad7636f410ac891c14621d7bc3784a00c">00126</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="a00077.html#ad7636f410ac891c14621d7bc3784a00c" title="The member function frees storage for an array of n bm::word_t elements, by calling...">deallocate</a>(<span class="keywordtype">void</span>* p, <span class="keywordtype">size_t</span>)
154
<a name="l00127"></a>00127 {
155
<a name="l00128"></a>00128 ::free(p);
156
<a name="l00129"></a>00129 }
157
<a name="l00130"></a>00130 };
158
<a name="l00131"></a>00131
159
<a name="l00132"></a>00132 <span class="comment">// -------------------------------------------------------------------------</span>
160
<a name="l00133"></a>00133 <span class="comment"></span>
161
<a name="l00134"></a>00134 <span class="comment">/*! @brief BM style allocator adapter. </span>
162
<a name="l00135"></a>00135 <span class="comment"></span>
163
<a name="l00136"></a>00136 <span class="comment"> Template takes two parameters BA - allocator object for bit blocks and</span>
164
<a name="l00137"></a>00137 <span class="comment"> PA - allocator object for pointer blocks.</span>
165
<a name="l00138"></a>00138 <span class="comment">*/</span>
166
<a name="l00139"></a><a class="code" href="a00073.html">00139</a> <span class="keyword">template</span><<span class="keyword">class</span> BA, <span class="keyword">class</span> PA> <span class="keyword">class </span><a class="code" href="a00073.html" title="BM style allocator adapter.">mem_alloc</a>
167
<a name="l00140"></a>00140 {
168
<a name="l00141"></a>00141 <span class="keyword">public</span>:
169
<a name="l00142"></a><a class="code" href="a00073.html#a911e642666fb01c95152f34a8eea9d60">00142</a> <span class="keyword">typedef</span> BA <a class="code" href="a00073.html#a911e642666fb01c95152f34a8eea9d60">block_allocator_type</a>;
170
<a name="l00143"></a><a class="code" href="a00073.html#a3585fb098e6798fe5aea1bd5dfaaa874">00143</a> <span class="keyword">typedef</span> PA <a class="code" href="a00073.html#a3585fb098e6798fe5aea1bd5dfaaa874">ptr_allocator_type</a>;
171
<a name="l00144"></a>00144
172
<a name="l00145"></a>00145 <span class="keyword">public</span>:
173
<a name="l00146"></a>00146
174
<a name="l00147"></a><a class="code" href="a00073.html#a0c83df2f625583b6958fb34d807b0014">00147</a> <a class="code" href="a00073.html#a0c83df2f625583b6958fb34d807b0014">mem_alloc</a>(<span class="keyword">const</span> BA& block_alloc = BA(), <span class="keyword">const</span> PA& ptr_alloc = PA())
175
<a name="l00148"></a>00148 : block_alloc_(block_alloc),
176
<a name="l00149"></a>00149 ptr_alloc_(ptr_alloc)
177
<a name="l00150"></a>00150 {}
178
<a name="l00151"></a>00151 <span class="comment"></span>
179
<a name="l00152"></a>00152 <span class="comment"> /*! @brief Returns copy of the block allocator object</span>
180
<a name="l00153"></a>00153 <span class="comment"> */</span>
181
<a name="l00154"></a><a class="code" href="a00073.html#af77ba616b20ffaa1a0589ed537697e71">00154</a> <a class="code" href="a00073.html#a911e642666fb01c95152f34a8eea9d60">block_allocator_type</a> <a class="code" href="a00073.html#af77ba616b20ffaa1a0589ed537697e71" title="Returns copy of the block allocator object.">get_block_allocator</a>()<span class="keyword"> const </span>
182
<a name="l00155"></a>00155 <span class="keyword"> </span>{
183
<a name="l00156"></a>00156 <span class="keywordflow">return</span> BA(block_alloc_);
184
<a name="l00157"></a>00157 }
185
<a name="l00158"></a>00158 <span class="comment"></span>
186
<a name="l00159"></a>00159 <span class="comment"> /*! @brief Returns copy of the ptr allocator object</span>
187
<a name="l00160"></a>00160 <span class="comment"> */</span>
188
<a name="l00161"></a><a class="code" href="a00073.html#a16191ffe1d864b2f4f1e72c290768c82">00161</a> <a class="code" href="a00073.html#a3585fb098e6798fe5aea1bd5dfaaa874">ptr_allocator_type</a> <a class="code" href="a00073.html#a16191ffe1d864b2f4f1e72c290768c82" title="Returns copy of the ptr allocator object.">get_ptr_allocator</a>()<span class="keyword"> const </span>
189
<a name="l00162"></a>00162 <span class="keyword"> </span>{
190
<a name="l00163"></a>00163 <span class="keywordflow">return</span> PA(block_alloc_);
191
<a name="l00164"></a>00164 }
192
<a name="l00165"></a>00165
193
<a name="l00166"></a>00166 <span class="comment"></span>
194
<a name="l00167"></a>00167 <span class="comment"> /*! @brief Allocates and returns bit block.</span>
195
<a name="l00168"></a>00168 <span class="comment"> @param alloc_factor </span>
196
<a name="l00169"></a>00169 <span class="comment"> indicated how many blocks we want to allocate in chunk</span>
197
<a name="l00170"></a>00170 <span class="comment"> total allocation is going to be bm::set_block_size * alloc_factor</span>
198
<a name="l00171"></a>00171 <span class="comment"> Default allocation factor is 1</span>
199
<a name="l00172"></a>00172 <span class="comment"> */</span>
200
<a name="l00173"></a><a class="code" href="a00073.html#a65147da5bed4cb6130a0a95d71a80e94">00173</a> <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00073.html#a65147da5bed4cb6130a0a95d71a80e94" title="Allocates and returns bit block.">alloc_bit_block</a>(<span class="keywordtype">unsigned</span> alloc_factor = 1)
201
<a name="l00174"></a>00174 {
202
<a name="l00175"></a>00175 <span class="keywordflow">return</span> block_alloc_.allocate(<a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a> * alloc_factor, 0);
203
<a name="l00176"></a>00176 }
204
<a name="l00177"></a>00177 <span class="comment"></span>
205
<a name="l00178"></a>00178 <span class="comment"> /*! @brief Frees bit block allocated by alloc_bit_block.</span>
206
<a name="l00179"></a>00179 <span class="comment"> */</span>
207
<a name="l00180"></a><a class="code" href="a00073.html#a348f8c8813e7765c7ceea5ba7a6342ca">00180</a> <span class="keywordtype">void</span> <a class="code" href="a00073.html#a348f8c8813e7765c7ceea5ba7a6342ca" title="Frees bit block allocated by alloc_bit_block.">free_bit_block</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* block, <span class="keywordtype">unsigned</span> alloc_factor = 1)
208
<a name="l00181"></a>00181 {
209
<a name="l00182"></a>00182 <span class="keywordflow">if</span> (<a class="code" href="a00092.html#a13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>(block))
210
<a name="l00183"></a>00183 block_alloc_.deallocate(block, <a class="code" href="a00115.html#a91319dbc0d0e1bf3a3efc4d92bac7972">bm::set_block_size</a> * alloc_factor);
211
<a name="l00184"></a>00184 }
212
<a name="l00185"></a>00185 <span class="comment"></span>
213
<a name="l00186"></a>00186 <span class="comment"> /*! @brief Allocates GAP block using bit block allocator (BA).</span>
214
<a name="l00187"></a>00187 <span class="comment"></span>
215
<a name="l00188"></a>00188 <span class="comment"> GAP blocks in BM library belong to levels. Each level has a </span>
216
<a name="l00189"></a>00189 <span class="comment"> correspondent length described in bm::gap_len_table<>.</span>
217
<a name="l00190"></a>00190 <span class="comment"> </span>
218
<a name="l00191"></a>00191 <span class="comment"> @param level GAP block level.</span>
219
<a name="l00192"></a>00192 <span class="comment"> */</span>
220
<a name="l00193"></a><a class="code" href="a00073.html#a6e5410e34efcc1e4af747b03795081dd">00193</a> <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* <a class="code" href="a00073.html#a6e5410e34efcc1e4af747b03795081dd" title="Allocates GAP block using bit block allocator (BA).">alloc_gap_block</a>(<span class="keywordtype">unsigned</span> level,
221
<a name="l00194"></a>00194 <span class="keyword">const</span> <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* glevel_len)
222
<a name="l00195"></a>00195 {
223
<a name="l00196"></a>00196 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(level < <a class="code" href="a00115.html#a773e9f5341919d58000bd54d50038733">bm::gap_levels</a>);
224
<a name="l00197"></a>00197 <span class="keywordtype">unsigned</span> len =
225
<a name="l00198"></a>00198 glevel_len[level] / (<span class="keyword">sizeof</span>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>) / <span class="keyword">sizeof</span>(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>));
226
<a name="l00199"></a>00199
227
<a name="l00200"></a>00200 <span class="keywordflow">return</span> (<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>*)block_alloc_.allocate(len, 0);
228
<a name="l00201"></a>00201 }
229
<a name="l00202"></a>00202 <span class="comment"></span>
230
<a name="l00203"></a>00203 <span class="comment"> /*! @brief Frees GAP block using bot block allocator (BA)</span>
231
<a name="l00204"></a>00204 <span class="comment"> */</span>
232
<a name="l00205"></a><a class="code" href="a00073.html#a0a54ad389bbfbb1bec04133b97c64d9b">00205</a> <span class="keywordtype">void</span> <a class="code" href="a00073.html#a0a54ad389bbfbb1bec04133b97c64d9b" title="Frees GAP block using bot block allocator (BA).">free_gap_block</a>(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>* block,
233
<a name="l00206"></a>00206 <span class="keyword">const</span> <a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">gap_word_t</a>* glevel_len)
234
<a name="l00207"></a>00207 {
235
<a name="l00208"></a>00208 <a class="code" href="a00092.html#aa44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(<a class="code" href="a00092.html#a13ba598909515339ceede09e3b9b0198">IS_VALID_ADDR</a>((<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)block));
236
<a name="l00209"></a>00209
237
<a name="l00210"></a>00210 <span class="keywordtype">unsigned</span> len = <a class="code" href="a00119.html#ga0419ed06e2f0b7891e7d721546f5fb45" title="Returs GAP block capacity.">gap_capacity</a>(block, glevel_len);
238
<a name="l00211"></a>00211 len /= <span class="keyword">sizeof</span>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>) / <span class="keyword">sizeof</span>(<a class="code" href="a00115.html#ac654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>);
239
<a name="l00212"></a>00212 block_alloc_.deallocate((<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*)block, len);
240
<a name="l00213"></a>00213 }
241
<a name="l00214"></a>00214 <span class="comment"></span>
242
<a name="l00215"></a>00215 <span class="comment"> /*! @brief Allocates block of pointers.</span>
243
<a name="l00216"></a>00216 <span class="comment"> */</span>
244
<a name="l00217"></a><a class="code" href="a00073.html#a512a255f1afe5f3f8319e4b2b9c1eb4d">00217</a> <span class="keywordtype">void</span>* <a class="code" href="a00073.html#a512a255f1afe5f3f8319e4b2b9c1eb4d" title="Allocates block of pointers.">alloc_ptr</a>(<span class="keywordtype">unsigned</span> size = <a class="code" href="a00115.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>)
245
<a name="l00218"></a>00218 {
246
<a name="l00219"></a>00219 <span class="keywordflow">return</span> ptr_alloc_.allocate(size, 0);
247
<a name="l00220"></a>00220 }
248
<a name="l00221"></a>00221 <span class="comment"></span>
249
<a name="l00222"></a>00222 <span class="comment"> /*! @brief Frees block of pointers.</span>
250
<a name="l00223"></a>00223 <span class="comment"> */</span>
251
<a name="l00224"></a><a class="code" href="a00073.html#a31bae2a441ae2d27724d2c938b45378c">00224</a> <span class="keywordtype">void</span> <a class="code" href="a00073.html#a31bae2a441ae2d27724d2c938b45378c" title="Frees block of pointers.">free_ptr</a>(<span class="keywordtype">void</span>* p, <span class="keywordtype">unsigned</span> size = <a class="code" href="a00115.html#a40ad34d6c46a2fb20ba2baa7f95d80b4">bm::set_array_size</a>)
252
<a name="l00225"></a>00225 {
253
<a name="l00226"></a>00226 <span class="keywordflow">if</span> (p)
254
<a name="l00227"></a>00227 ptr_alloc_.deallocate(p, size);
255
<a name="l00228"></a>00228 }
256
<a name="l00229"></a>00229 <span class="keyword">private</span>:
257
<a name="l00230"></a>00230 BA block_alloc_;
258
<a name="l00231"></a>00231 PA ptr_alloc_;
259
<a name="l00232"></a>00232 };
260
<a name="l00233"></a>00233
261
<a name="l00234"></a><a class="code" href="a00127.html#gab9059bfb40a6588cdbacfd93901593c1">00234</a> <span class="keyword">typedef</span> <a class="code" href="a00073.html" title="BM style allocator adapter.">mem_alloc<block_allocator, ptr_allocator></a> <a class="code" href="a00073.html" title="BM style allocator adapter.">standard_allocator</a>;
262
<a name="l00235"></a>00235 <span class="comment"></span>
263
<a name="l00236"></a>00236 <span class="comment">/** @} */</span>
264
<a name="l00237"></a>00237
265
<a name="l00238"></a>00238
266
<a name="l00239"></a>00239 } <span class="comment">// namespace bm</span>
267
<a name="l00240"></a>00240
268
<a name="l00241"></a>00241
269
<a name="l00242"></a>00242 <span class="preprocessor">#endif</span>
1627
270
</pre></div></div>
1628
<hr size="1"/><address style="text-align: right;"><small>Generated on Tue Mar 23 20:47:54 2010 for BitMagic by
271
<hr size="1"/><address style="text-align: right;"><small>Generated on Sun Apr 25 09:37:27 2010 for BitMagic by
1629
272
<a href="http://www.doxygen.org/index.html">
1630
273
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.1 </small></address>