1
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
2
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
3
<title>BitMagic: bmvmin.h Source File</title>
4
<link href="tabs.css" rel="stylesheet" type="text/css">
5
<link href="doxygen.css" rel="stylesheet" type="text/css">
7
<!-- Generated by Doxygen 1.5.9 -->
8
<div class="navigation" id="top">
11
<li><a href="index.html"><span>Main Page</span></a></li>
12
<li><a href="modules.html"><span>Modules</span></a></li>
13
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
14
<li><a href="annotated.html"><span>Data Structures</span></a></li>
15
<li class="current"><a href="files.html"><span>Files</span></a></li>
16
<li><a href="examples.html"><span>Examples</span></a></li>
21
<li><a href="files.html"><span>File List</span></a></li>
22
<li><a href="globals.html"><span>Globals</span></a></li>
25
<h1>bmvmin.h</h1><a href="a00077.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
26
<a name="l00002"></a>00002 <span class="comment">Copyright(c) 2002-2005 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)</span>
27
<a name="l00003"></a>00003 <span class="comment"></span>
28
<a name="l00004"></a>00004 <span class="comment">Permission is hereby granted, free of charge, to any person </span>
29
<a name="l00005"></a>00005 <span class="comment">obtaining a copy of this software and associated documentation </span>
30
<a name="l00006"></a>00006 <span class="comment">files (the "Software"), to deal in the Software without restriction, </span>
31
<a name="l00007"></a>00007 <span class="comment">including without limitation the rights to use, copy, modify, merge, </span>
32
<a name="l00008"></a>00008 <span class="comment">publish, distribute, sublicense, and/or sell copies of the Software, </span>
33
<a name="l00009"></a>00009 <span class="comment">and to permit persons to whom the Software is furnished to do so, </span>
34
<a name="l00010"></a>00010 <span class="comment">subject to the following conditions:</span>
35
<a name="l00011"></a>00011 <span class="comment"></span>
36
<a name="l00012"></a>00012 <span class="comment">The above copyright notice and this permission notice shall be included </span>
37
<a name="l00013"></a>00013 <span class="comment">in all copies or substantial portions of the Software.</span>
38
<a name="l00014"></a>00014 <span class="comment"></span>
39
<a name="l00015"></a>00015 <span class="comment">THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, </span>
40
<a name="l00016"></a>00016 <span class="comment">EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES </span>
41
<a name="l00017"></a>00017 <span class="comment">OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. </span>
42
<a name="l00018"></a>00018 <span class="comment">IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, </span>
43
<a name="l00019"></a>00019 <span class="comment">DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, </span>
44
<a name="l00020"></a>00020 <span class="comment">ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR </span>
45
<a name="l00021"></a>00021 <span class="comment">OTHER DEALINGS IN THE SOFTWARE.</span>
46
<a name="l00022"></a>00022 <span class="comment"></span>
47
<a name="l00023"></a>00023 <span class="comment">For more information please visit: http://bmagic.sourceforge.net</span>
48
<a name="l00024"></a>00024 <span class="comment"></span>
49
<a name="l00025"></a>00025 <span class="comment">*/</span>
50
<a name="l00026"></a>00026
51
<a name="l00027"></a>00027 <span class="preprocessor">#ifndef BMVMIN__H__INCLUDED__</span>
52
<a name="l00028"></a>00028 <span class="preprocessor"></span><span class="preprocessor">#define BMVMIN__H__INCLUDED__</span>
53
<a name="l00029"></a>00029 <span class="preprocessor"></span>
54
<a name="l00030"></a>00030 <span class="keyword">namespace </span>bm
55
<a name="l00031"></a>00031 {
56
<a name="l00032"></a>00032
57
<a name="l00033"></a>00033
58
<a name="l00034"></a><a class="code" href="a00077.html#e064a0440f9730f9661e51e6089dd853">00034</a> <span class="preprocessor">#define BM_MINISET_GAPLEN (bm::gap_len_table<true>::_len[0])</span>
59
<a name="l00035"></a><a class="code" href="a00077.html#4c52fe8ea11bf34fcaafb71253846fea">00035</a> <span class="preprocessor"></span><span class="preprocessor">#define BM_MINISET_ARRSIZE(x) ((x / 32) + ( (x % 32) && 1 ))</span>
60
<a name="l00036"></a>00036 <span class="preprocessor"></span><span class="comment"></span>
61
<a name="l00037"></a>00037 <span class="comment">/*! @defgroup mset Small sets functionality</span>
62
<a name="l00038"></a>00038 <span class="comment"> * Templates in this group are used to keep block types in BM library.</span>
63
<a name="l00039"></a>00039 <span class="comment"> * Classes of this group can tune bvector template (MS parameter)</span>
64
<a name="l00040"></a>00040 <span class="comment"> * for best performance or minimal memory usage.</span>
65
<a name="l00041"></a>00041 <span class="comment"> * @ingroup bmagic</span>
66
<a name="l00042"></a>00042 <span class="comment"> * @{</span>
67
<a name="l00043"></a>00043 <span class="comment"> */</span>
68
<a name="l00044"></a>00044
69
<a name="l00045"></a>00045 <span class="comment"></span>
70
<a name="l00046"></a>00046 <span class="comment">/*!</span>
71
<a name="l00047"></a>00047 <span class="comment"> @brief Template class implements memory saving set functionality</span>
72
<a name="l00048"></a>00048 <span class="comment"> </span>
73
<a name="l00049"></a>00049 <span class="comment"> Template can be used as template parameter for bvector if we </span>
74
<a name="l00050"></a>00050 <span class="comment"> want to tune bvector for minimal memory consumption.</span>
75
<a name="l00051"></a>00051 <span class="comment"></span>
76
<a name="l00052"></a>00052 <span class="comment"> @sa bvmini</span>
77
<a name="l00053"></a>00053 <span class="comment">*/</span>
78
<a name="l00054"></a><a class="code" href="a00060.html">00054</a> <span class="keyword">template</span> <<span class="keyword">class</span> A, <span class="keywordtype">size_t</span> N> <span class="keyword">class </span><a class="code" href="a00060.html" title="Template class implements memory saving set functionality.">miniset</a>
79
<a name="l00055"></a>00055 {
80
<a name="l00056"></a>00056 <span class="keyword">public</span>:
81
<a name="l00057"></a>00057
82
<a name="l00058"></a><a class="code" href="a00060.html#22e5b5c7d702203c5fa5b0480cd85c25">00058</a> <a class="code" href="a00060.html#22e5b5c7d702203c5fa5b0480cd85c25">miniset</a>()
83
<a name="l00059"></a>00059 : m_buf(0),
84
<a name="l00060"></a>00060 m_type(1)
85
<a name="l00061"></a>00061 {}
86
<a name="l00062"></a>00062
87
<a name="l00063"></a><a class="code" href="a00060.html#61e5961df48b9521392397a0863319ee">00063</a> <a class="code" href="a00060.html#22e5b5c7d702203c5fa5b0480cd85c25">miniset</a>(<span class="keyword">const</span> <a class="code" href="a00060.html" title="Template class implements memory saving set functionality.">miniset</a>& mset)
88
<a name="l00064"></a>00064 {
89
<a name="l00065"></a>00065 <span class="keywordflow">if</span> (mset.m_buf)
90
<a name="l00066"></a>00066 {
91
<a name="l00067"></a>00067 <span class="keywordflow">if</span> (mset.m_type)
92
<a name="l00068"></a>00068 init_gapbuf(mset.m_buf);
93
<a name="l00069"></a>00069 <span class="keywordflow">else</span>
94
<a name="l00070"></a>00070 init_bitbuf(mset.m_buf);
95
<a name="l00071"></a>00071 }
96
<a name="l00072"></a>00072 <span class="keywordflow">else</span>
97
<a name="l00073"></a>00073 {
98
<a name="l00074"></a>00074 m_type = mset.m_type;
99
<a name="l00075"></a>00075 m_buf = 0;
100
<a name="l00076"></a>00076 }
101
<a name="l00077"></a>00077 }
102
<a name="l00078"></a>00078
103
<a name="l00079"></a><a class="code" href="a00060.html#6e5569bf59dc0e96fd3637888f5e5fd1">00079</a> <a class="code" href="a00060.html#6e5569bf59dc0e96fd3637888f5e5fd1">~miniset</a>()
104
<a name="l00080"></a>00080 {
105
<a name="l00081"></a>00081 <span class="keywordflow">if</span> (m_buf)
106
<a name="l00082"></a>00082 {
107
<a name="l00083"></a>00083 A::deallocate(m_buf, m_type ?
108
<a name="l00084"></a>00084 (<a class="code" href="a00077.html#e064a0440f9730f9661e51e6089dd853">BM_MINISET_GAPLEN</a> / (<span class="keyword">sizeof</span>(<a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>) / <span class="keyword">sizeof</span>(<a class="code" href="a00088.html#c654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>)))
109
<a name="l00085"></a>00085 :
110
<a name="l00086"></a>00086 (<a class="code" href="a00077.html#4c52fe8ea11bf34fcaafb71253846fea">BM_MINISET_ARRSIZE</a>(N)));
111
<a name="l00087"></a>00087 }
112
<a name="l00088"></a>00088 }
113
<a name="l00089"></a>00089 <span class="comment"></span>
114
<a name="l00090"></a>00090 <span class="comment"> /// Checks if bit pos 1 or 0. Returns 0 if 0 and non zero otherwise.</span>
115
<a name="l00091"></a><a class="code" href="a00060.html#187012a7ef52ff62748c5b3937e4578c">00091</a> <span class="comment"></span> <span class="keywordtype">unsigned</span> <a class="code" href="a00060.html#187012a7ef52ff62748c5b3937e4578c" title="Checks if bit pos 1 or 0. Returns 0 if 0 and non zero otherwise.">test</a>(<a class="code" href="a00088.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> n)<span class="keyword"> const </span>
116
<a name="l00092"></a>00092 <span class="keyword"> </span>{
117
<a name="l00093"></a>00093 <span class="keywordflow">return</span>
118
<a name="l00094"></a>00094 !m_buf ? 0
119
<a name="l00095"></a>00095 :
120
<a name="l00096"></a>00096 m_type ?
121
<a name="l00097"></a>00097 <a class="code" href="a00092.html#g866352ef5986a7d2b709795d127b666b" title="Tests if bit = pos is true.">gap_test</a>((<a class="code" href="a00088.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>*)m_buf, n)
122
<a name="l00098"></a>00098 :
123
<a name="l00099"></a>00099 m_buf[n>><a class="code" href="a00088.html#83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>] & (1<<(n & <a class="code" href="a00088.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>));
124
<a name="l00100"></a>00100 }
125
<a name="l00101"></a>00101
126
<a name="l00102"></a><a class="code" href="a00060.html#34d569e459720cb037a01d74bc6cccac">00102</a> <span class="keywordtype">void</span> <span class="keyword">set</span>(<a class="code" href="a00088.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> n, <span class="keywordtype">bool</span> val=<span class="keyword">true</span>)
127
<a name="l00103"></a>00103 {
128
<a name="l00104"></a>00104 <span class="keywordflow">if</span> (m_type == 0)
129
<a name="l00105"></a>00105 {
130
<a name="l00106"></a>00106 <span class="keywordflow">if</span> (!m_buf)
131
<a name="l00107"></a>00107 {
132
<a name="l00108"></a>00108 <span class="keywordflow">if</span> (!val) <span class="keywordflow">return</span>;
133
<a name="l00109"></a>00109 init_bitbuf(0);
134
<a name="l00110"></a>00110 }
135
<a name="l00111"></a>00111
136
<a name="l00112"></a>00112 <span class="keywordtype">unsigned</span> nword = n >> <a class="code" href="a00088.html#83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>;
137
<a name="l00113"></a>00113 <span class="keywordtype">unsigned</span> mask = unsigned(1) << (n & <a class="code" href="a00088.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>);
138
<a name="l00114"></a>00114
139
<a name="l00115"></a>00115 val ? (m_buf[nword] |= mask) : (m_buf[nword] &= ~mask);
140
<a name="l00116"></a>00116 }
141
<a name="l00117"></a>00117 <span class="keywordflow">else</span>
142
<a name="l00118"></a>00118 {
143
<a name="l00119"></a>00119 <span class="keywordflow">if</span> (!m_buf)
144
<a name="l00120"></a>00120 {
145
<a name="l00121"></a>00121 <span class="keywordflow">if</span> (!val) <span class="keywordflow">return</span>;
146
<a name="l00122"></a>00122 init_gapbuf(0);
147
<a name="l00123"></a>00123 }
148
<a name="l00124"></a>00124
149
<a name="l00125"></a>00125 <span class="keywordtype">unsigned</span> is_set;
150
<a name="l00126"></a>00126 <span class="keywordtype">unsigned</span> new_block_len =
151
<a name="l00127"></a>00127 <a class="code" href="a00092.html#g69186bd13bda27e04b3e33683ff884c2" title="Abstract distance(similarity) operation for GAP buffers. Receives functor F as a...">gap_set_value</a>(val, (<a class="code" href="a00088.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>*)m_buf, n, &is_set);
152
<a name="l00128"></a>00128
153
<a name="l00129"></a>00129 <span class="keywordflow">if</span> (new_block_len > <span class="keywordtype">unsigned</span>(<a class="code" href="a00077.html#e064a0440f9730f9661e51e6089dd853">BM_MINISET_GAPLEN</a>-4))
154
<a name="l00130"></a>00130 {
155
<a name="l00131"></a>00131 convert_buf();
156
<a name="l00132"></a>00132 }
157
<a name="l00133"></a>00133 }
158
<a name="l00134"></a>00134 }
159
<a name="l00135"></a>00135
160
<a name="l00136"></a><a class="code" href="a00060.html#2b74fe02080d4d515893e749624e7797">00136</a> <span class="keywordtype">unsigned</span> <a class="code" href="a00060.html#2b74fe02080d4d515893e749624e7797">mem_used</a>()<span class="keyword"> const</span>
161
<a name="l00137"></a>00137 <span class="keyword"> </span>{
162
<a name="l00138"></a>00138 <span class="keywordflow">return</span> <span class="keyword">sizeof</span>(*this) +
163
<a name="l00139"></a>00139 m_buf ?
164
<a name="l00140"></a>00140 (m_type ? (<a class="code" href="a00077.html#e064a0440f9730f9661e51e6089dd853">BM_MINISET_GAPLEN</a> * <span class="keyword">sizeof</span>(<a class="code" href="a00088.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>))
165
<a name="l00141"></a>00141 : (<a class="code" href="a00077.html#4c52fe8ea11bf34fcaafb71253846fea">BM_MINISET_ARRSIZE</a>(N) * <span class="keyword">sizeof</span>(<a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>)))
166
<a name="l00142"></a>00142 : 0;
167
<a name="l00143"></a>00143 }
168
<a name="l00144"></a>00144
169
<a name="l00145"></a><a class="code" href="a00060.html#f94007643783b752eed263ac72ca8a5c">00145</a> <span class="keywordtype">void</span> <a class="code" href="a00060.html#f94007643783b752eed263ac72ca8a5c">swap</a>(<a class="code" href="a00060.html" title="Template class implements memory saving set functionality.">miniset</a>& mset)
170
<a name="l00146"></a>00146 {
171
<a name="l00147"></a>00147 <a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* buftmp = m_buf;
172
<a name="l00148"></a>00148 m_buf = mset.m_buf;
173
<a name="l00149"></a>00149 mset.m_buf = buftmp;
174
<a name="l00150"></a>00150 <span class="keywordtype">unsigned</span> typetmp = m_type;
175
<a name="l00151"></a>00151 m_type = mset.m_type;
176
<a name="l00152"></a>00152 mset.m_type = typetmp;
177
<a name="l00153"></a>00153 }
178
<a name="l00154"></a>00154
179
<a name="l00155"></a>00155
180
<a name="l00156"></a>00156 <span class="keyword">private</span>:
181
<a name="l00157"></a>00157
182
<a name="l00158"></a>00158 <span class="keywordtype">void</span> init_bitbuf(<a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* buf)
183
<a name="l00159"></a>00159 {
184
<a name="l00160"></a>00160 <span class="keywordtype">unsigned</span> arr_size = <a class="code" href="a00077.html#4c52fe8ea11bf34fcaafb71253846fea">BM_MINISET_ARRSIZE</a>(N);
185
<a name="l00161"></a>00161 m_buf = A::allocate(arr_size, 0);
186
<a name="l00162"></a>00162 <span class="keywordflow">if</span> (buf)
187
<a name="l00163"></a>00163 {
188
<a name="l00164"></a>00164 ::memcpy(m_buf, buf, arr_size * <span class="keyword">sizeof</span>(<a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>));
189
<a name="l00165"></a>00165 }
190
<a name="l00166"></a>00166 <span class="keywordflow">else</span>
191
<a name="l00167"></a>00167 {
192
<a name="l00168"></a>00168 ::memset(m_buf, 0, arr_size * <span class="keyword">sizeof</span>(<a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>));
193
<a name="l00169"></a>00169 }
194
<a name="l00170"></a>00170 m_type = 0;
195
<a name="l00171"></a>00171 }
196
<a name="l00172"></a>00172
197
<a name="l00173"></a>00173 <span class="keywordtype">void</span> init_gapbuf(<a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* buf)
198
<a name="l00174"></a>00174 {
199
<a name="l00175"></a>00175 <span class="keywordtype">unsigned</span> arr_size =
200
<a name="l00176"></a>00176 <a class="code" href="a00077.html#e064a0440f9730f9661e51e6089dd853">BM_MINISET_GAPLEN</a> / (<span class="keyword">sizeof</span>(<a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>) / <span class="keyword">sizeof</span>(<a class="code" href="a00088.html#c654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>));
201
<a name="l00177"></a>00177 m_buf = A::allocate(arr_size, 0);
202
<a name="l00178"></a>00178 <span class="keywordflow">if</span> (buf)
203
<a name="l00179"></a>00179 {
204
<a name="l00180"></a>00180 ::memcpy(m_buf, buf, arr_size * <span class="keyword">sizeof</span>(<a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>));
205
<a name="l00181"></a>00181 }
206
<a name="l00182"></a>00182 <span class="keywordflow">else</span>
207
<a name="l00183"></a>00183 {
208
<a name="l00184"></a>00184 *m_buf = 0;
209
<a name="l00185"></a>00185 <a class="code" href="a00092.html#gef53b2877ff369badd7bb25b26bb9029" title="Sets all bits to 0 or 1 (GAP).">gap_set_all</a>((<a class="code" href="a00088.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>*)m_buf, <a class="code" href="a00088.html#d0b8714080144ac70197840ff96752b7">bm::gap_max_bits</a>, 0);
210
<a name="l00186"></a>00186 }
211
<a name="l00187"></a>00187 m_type = 1;
212
<a name="l00188"></a>00188 }
213
<a name="l00189"></a>00189
214
<a name="l00190"></a>00190 <span class="keywordtype">void</span> convert_buf()
215
<a name="l00191"></a>00191 {
216
<a name="l00192"></a>00192 <span class="keywordtype">unsigned</span> arr_size = <a class="code" href="a00077.html#4c52fe8ea11bf34fcaafb71253846fea">BM_MINISET_ARRSIZE</a>(N);
217
<a name="l00193"></a>00193 <a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* buf = A::allocate(arr_size, 0);
218
<a name="l00194"></a>00194
219
<a name="l00195"></a>00195 <a class="code" href="a00092.html#g4862f4dcdcb7c0575e2e2db9e5f2a849" title="GAP block to bitblock conversion.">gap_convert_to_bitset</a>(buf, (<a class="code" href="a00088.html#c654d6319039a86546d235a236fc7cf6">gap_word_t</a>*) m_buf, arr_size);
220
<a name="l00196"></a>00196 arr_size =
221
<a name="l00197"></a>00197 <a class="code" href="a00077.html#e064a0440f9730f9661e51e6089dd853">BM_MINISET_GAPLEN</a> / (<span class="keyword">sizeof</span>(<a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>) / <span class="keyword">sizeof</span>(<a class="code" href="a00088.html#c654d6319039a86546d235a236fc7cf6">bm::gap_word_t</a>));
222
<a name="l00198"></a>00198 A::deallocate(m_buf, arr_size);
223
<a name="l00199"></a>00199 m_buf = buf;
224
<a name="l00200"></a>00200 m_type = 0;
225
<a name="l00201"></a>00201 }
226
<a name="l00202"></a>00202
227
<a name="l00203"></a>00203 <span class="keyword">private</span>:
228
<a name="l00204"></a>00204 <a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* m_buf; <span class="comment">//!< Buffer pointer</span>
229
<a name="l00205"></a>00205 <span class="comment"></span> <span class="keywordtype">unsigned</span> m_type; <span class="comment">//!< buffer type (0-bit, 1-gap)</span>
230
<a name="l00206"></a>00206 <span class="comment"></span>};
231
<a name="l00207"></a>00207
232
<a name="l00208"></a>00208 <span class="comment"></span>
233
<a name="l00209"></a>00209 <span class="comment">/*!</span>
234
<a name="l00210"></a>00210 <span class="comment"> @brief Mini bitvector used in bvector template to keep block type flags</span>
235
<a name="l00211"></a>00211 <span class="comment"> </span>
236
<a name="l00212"></a>00212 <span class="comment"> Template is used as a default template parameter MS for bvector </span>
237
<a name="l00213"></a>00213 <span class="comment"> Offers maximum performance comparing to miniset.</span>
238
<a name="l00214"></a>00214 <span class="comment"></span>
239
<a name="l00215"></a>00215 <span class="comment"> @sa miniset</span>
240
<a name="l00216"></a>00216 <span class="comment">*/</span>
241
<a name="l00217"></a><a class="code" href="a00038.html">00217</a> <span class="keyword">template</span><<span class="keywordtype">size_t</span> N> <span class="keyword">class </span><a class="code" href="a00038.html" title="Mini bitvector used in bvector template to keep block type flags.">bvmini</a>
242
<a name="l00218"></a>00218 {
243
<a name="l00219"></a>00219 <span class="keyword">public</span>:
244
<a name="l00220"></a>00220
245
<a name="l00221"></a><a class="code" href="a00038.html#06c2a8c6253e47e107acf75f3f9dfb38">00221</a> <a class="code" href="a00038.html#06c2a8c6253e47e107acf75f3f9dfb38">bvmini</a>(<span class="keywordtype">int</span> start_strategy = 0)
246
<a name="l00222"></a>00222 {
247
<a name="l00223"></a>00223 ::memset(m_buf, 0, <span class="keyword">sizeof</span>(m_buf));
248
<a name="l00224"></a>00224 }
249
<a name="l00225"></a>00225
250
<a name="l00226"></a><a class="code" href="a00038.html#aca8fc1df0be6bf5e0dbb78f399c793d">00226</a> <a class="code" href="a00038.html#06c2a8c6253e47e107acf75f3f9dfb38">bvmini</a>(<span class="keyword">const</span> <a class="code" href="a00038.html" title="Mini bitvector used in bvector template to keep block type flags.">bvmini</a>& mset)
251
<a name="l00227"></a>00227 {
252
<a name="l00228"></a>00228 ::memcpy(m_buf, mset.m_buf, <span class="keyword">sizeof</span>(m_buf));
253
<a name="l00229"></a>00229 }
254
<a name="l00230"></a>00230
255
<a name="l00231"></a>00231 <span class="comment"></span>
256
<a name="l00232"></a>00232 <span class="comment"> /// Checks if bit pos 1 or 0. Returns 0 if 0 and non zero otherwise.</span>
257
<a name="l00233"></a><a class="code" href="a00038.html#6c5950cd2043fe1de37aa7eeba2ad208">00233</a> <span class="comment"></span> <span class="keywordtype">unsigned</span> <a class="code" href="a00038.html#6c5950cd2043fe1de37aa7eeba2ad208" title="Checks if bit pos 1 or 0. Returns 0 if 0 and non zero otherwise.">test</a>(<a class="code" href="a00088.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> n)<span class="keyword"> const </span>
258
<a name="l00234"></a>00234 <span class="keyword"> </span>{
259
<a name="l00235"></a>00235 <span class="keywordflow">return</span> m_buf[n>><a class="code" href="a00088.html#83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>] & (1<<(n & <a class="code" href="a00088.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>));
260
<a name="l00236"></a>00236 }
261
<a name="l00237"></a>00237
262
<a name="l00238"></a><a class="code" href="a00038.html#74c7834f34f41e6042243cdbe2b7b93e">00238</a> <span class="keywordtype">void</span> <span class="keyword">set</span>(<a class="code" href="a00088.html#a3824d882a037396370b16f2f0a8bf37">bm::id_t</a> n, <span class="keywordtype">bool</span> val=<span class="keyword">true</span>)
263
<a name="l00239"></a>00239 {
264
<a name="l00240"></a>00240 <span class="keywordtype">unsigned</span> nword = n >> <a class="code" href="a00088.html#83d76bccf6fe3770f32d5ba11d2a37ad">bm::set_word_shift</a>;
265
<a name="l00241"></a>00241 <span class="keywordtype">unsigned</span> mask = unsigned(1) << (n & <a class="code" href="a00088.html#ddbf345be3733d5e4575d71733ed1da8">bm::set_word_mask</a>);
266
<a name="l00242"></a>00242
267
<a name="l00243"></a>00243 val ? (m_buf[nword] |= mask) : (m_buf[nword] &= ~mask);
268
<a name="l00244"></a>00244 }
269
<a name="l00245"></a>00245
270
<a name="l00246"></a><a class="code" href="a00038.html#3253569551b1ce6fb6b1e1d21f318f70">00246</a> <span class="keywordtype">unsigned</span> <a class="code" href="a00038.html#3253569551b1ce6fb6b1e1d21f318f70">mem_used</a>()<span class="keyword"> const</span>
271
<a name="l00247"></a>00247 <span class="keyword"> </span>{
272
<a name="l00248"></a>00248 <span class="keywordflow">return</span> <span class="keyword">sizeof</span>(*this);
273
<a name="l00249"></a>00249 }
274
<a name="l00250"></a>00250
275
<a name="l00251"></a><a class="code" href="a00038.html#f5f33b8936925bec92522af3c44dd677">00251</a> <span class="keywordtype">void</span> <a class="code" href="a00038.html#f5f33b8936925bec92522af3c44dd677">swap</a>(<a class="code" href="a00038.html" title="Mini bitvector used in bvector template to keep block type flags.">bvmini</a>& mset)
276
<a name="l00252"></a>00252 {
277
<a name="l00253"></a>00253 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < <a class="code" href="a00077.html#4c52fe8ea11bf34fcaafb71253846fea">BM_MINISET_ARRSIZE</a>(N); ++i)
278
<a name="l00254"></a>00254 {
279
<a name="l00255"></a>00255 <a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> tmp = m_buf[i];
280
<a name="l00256"></a>00256 m_buf[i] = mset.m_buf[i];
281
<a name="l00257"></a>00257 mset.m_buf[i] = tmp;
282
<a name="l00258"></a>00258 }
283
<a name="l00259"></a>00259 }
284
<a name="l00260"></a>00260
285
<a name="l00261"></a>00261 <span class="keyword">private</span>:
286
<a name="l00262"></a>00262 <a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> m_buf[<a class="code" href="a00077.html#4c52fe8ea11bf34fcaafb71253846fea">BM_MINISET_ARRSIZE</a>(N)];
287
<a name="l00263"></a>00263 };
288
<a name="l00264"></a>00264
289
<a name="l00265"></a>00265 <span class="comment"></span>
290
<a name="l00266"></a>00266 <span class="comment">/*!@} */</span>
291
<a name="l00267"></a>00267 <span class="comment"></span>
292
<a name="l00268"></a>00268 <span class="comment">/*!</span>
293
<a name="l00269"></a>00269 <span class="comment"> @brief Bitvector class with very limited functionality.</span>
294
<a name="l00270"></a>00270 <span class="comment"></span>
295
<a name="l00271"></a>00271 <span class="comment"> Class implements simple bitset and used for internal </span>
296
<a name="l00272"></a>00272 <span class="comment"> and testing purposes. </span>
297
<a name="l00273"></a>00273 <span class="comment">*/</span>
298
<a name="l00274"></a><a class="code" href="a00037.html">00274</a> <span class="keyword">template</span><<span class="keyword">class</span> A> <span class="keyword">class </span><a class="code" href="a00037.html" title="Bitvector class with very limited functionality.">bvector_mini</a>
299
<a name="l00275"></a>00275 {
300
<a name="l00276"></a>00276 <span class="keyword">public</span>:
301
<a name="l00277"></a><a class="code" href="a00037.html#6a19b7eb95001b59818314ab36af98f8">00277</a> <a class="code" href="a00037.html#6a19b7eb95001b59818314ab36af98f8">bvector_mini</a>(<span class="keywordtype">unsigned</span> size)
302
<a name="l00278"></a>00278 : m_buf(0),
303
<a name="l00279"></a>00279 m_size(size)
304
<a name="l00280"></a>00280 {
305
<a name="l00281"></a>00281 <span class="keywordtype">unsigned</span> arr_size = (size / 32) + 1;
306
<a name="l00282"></a>00282 m_buf = A::allocate(arr_size, 0);
307
<a name="l00283"></a>00283 ::memset(m_buf, 0, arr_size * <span class="keyword">sizeof</span>(unsigned));
308
<a name="l00284"></a>00284 }
309
<a name="l00285"></a><a class="code" href="a00037.html#df04b08db38bfd6445c26cdbbf9dc296">00285</a> <a class="code" href="a00037.html#6a19b7eb95001b59818314ab36af98f8">bvector_mini</a>(<span class="keyword">const</span> <a class="code" href="a00037.html" title="Bitvector class with very limited functionality.">bvector_mini</a>& <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bvect</a>)
310
<a name="l00286"></a>00286 : m_size(bvect.m_size)
311
<a name="l00287"></a>00287 {
312
<a name="l00288"></a>00288 <span class="keywordtype">unsigned</span> arr_size = (m_size / 32) + 1;
313
<a name="l00289"></a>00289 m_buf = A::allocate(arr_size, 0);
314
<a name="l00290"></a>00290 ::memcpy(m_buf, bvect.m_buf, arr_size * <span class="keyword">sizeof</span>(unsigned));
315
<a name="l00291"></a>00291 }
316
<a name="l00292"></a>00292
317
<a name="l00293"></a><a class="code" href="a00037.html#d8ab729a8aafd44e623bd251b9f9c1fa">00293</a> <a class="code" href="a00037.html#d8ab729a8aafd44e623bd251b9f9c1fa">~bvector_mini</a>()
318
<a name="l00294"></a>00294 {
319
<a name="l00295"></a>00295 A::deallocate(m_buf, (m_size / 32) + 1);
320
<a name="l00296"></a>00296 }
321
<a name="l00297"></a>00297 <span class="comment"></span>
322
<a name="l00298"></a>00298 <span class="comment"> /// Checks if bit pos 1 or 0. Returns 0 if 0 and non zero otherwise.</span>
323
<a name="l00299"></a><a class="code" href="a00037.html#6cfcb4606f6fbb52ae78943fcb85b97e">00299</a> <span class="comment"></span> <span class="keywordtype">int</span> <a class="code" href="a00037.html#6cfcb4606f6fbb52ae78943fcb85b97e" title="Checks if bit pos 1 or 0. Returns 0 if 0 and non zero otherwise.">is_bit_true</a>(<span class="keywordtype">unsigned</span> pos)<span class="keyword"> const</span>
324
<a name="l00300"></a>00300 <span class="keyword"> </span>{
325
<a name="l00301"></a>00301 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> mask = (<span class="keywordtype">unsigned</span> char)((<span class="keywordtype">char</span>)0x1 << (pos & 7));
326
<a name="l00302"></a>00302 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* offs = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*)m_buf + (pos >> 3); <span class="comment">// m_buf + (pos/8)</span>
327
<a name="l00303"></a>00303
328
<a name="l00304"></a>00304 <span class="keywordflow">return</span> (*offs) & mask;
329
<a name="l00305"></a>00305 }
330
<a name="l00306"></a>00306 <span class="comment"></span>
331
<a name="l00307"></a>00307 <span class="comment"> /// Sets bit number pos to 1</span>
332
<a name="l00308"></a><a class="code" href="a00037.html#e28f350dc925a9c8bef673fcffce9c8e">00308</a> <span class="comment"></span> <span class="keywordtype">void</span> <a class="code" href="a00037.html#e28f350dc925a9c8bef673fcffce9c8e" title="Sets bit number pos to 1.">set_bit</a>(<span class="keywordtype">unsigned</span> pos)
333
<a name="l00309"></a>00309 {
334
<a name="l00310"></a>00310 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> mask = (<span class="keywordtype">unsigned</span> char)(0x1 << (pos & 7));
335
<a name="l00311"></a>00311 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* offs = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*)m_buf + (pos >> 3);
336
<a name="l00312"></a>00312 *offs |= mask;
337
<a name="l00313"></a>00313 }
338
<a name="l00314"></a>00314
339
<a name="l00315"></a>00315 <span class="comment"></span>
340
<a name="l00316"></a>00316 <span class="comment"> /// Sets bit number pos to 0</span>
341
<a name="l00317"></a><a class="code" href="a00037.html#852767299516dacb6b27296d71ea60c0">00317</a> <span class="comment"></span> <span class="keywordtype">void</span> <a class="code" href="a00037.html#852767299516dacb6b27296d71ea60c0" title="Sets bit number pos to 0.">clear_bit</a>(<span class="keywordtype">unsigned</span> pos)
342
<a name="l00318"></a>00318 {
343
<a name="l00319"></a>00319 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> mask = (<span class="keywordtype">unsigned</span> char)(0x1 << (pos & 7));
344
<a name="l00320"></a>00320 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* offs = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*)m_buf + (pos >> 3);
345
<a name="l00321"></a>00321
346
<a name="l00322"></a>00322 *offs &= ~mask;
347
<a name="l00323"></a>00323 }
348
<a name="l00324"></a>00324 <span class="comment"></span>
349
<a name="l00325"></a>00325 <span class="comment"> /// Counts number of bits ON </span>
350
<a name="l00326"></a><a class="code" href="a00037.html#1becbe1fa1d767f6ea17801bd64b4bd5">00326</a> <span class="comment"></span> <span class="keywordtype">unsigned</span> <a class="code" href="a00037.html#1becbe1fa1d767f6ea17801bd64b4bd5" title="Counts number of bits ON.">bit_count</a>()<span class="keyword"> const</span>
351
<a name="l00327"></a>00327 <span class="keyword"> </span>{
352
<a name="l00328"></a>00328 <span class="keyword">register</span> <span class="keywordtype">unsigned</span> count = 0;
353
<a name="l00329"></a>00329 <span class="keyword">const</span> <span class="keywordtype">unsigned</span>* end = m_buf + (m_size / 32)+1;
354
<a name="l00330"></a>00330
355
<a name="l00331"></a>00331 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span>* start = m_buf; start < end; ++start)
356
<a name="l00332"></a>00332 {
357
<a name="l00333"></a>00333 <span class="keyword">register</span> <span class="keywordtype">unsigned</span> value = *start;
358
<a name="l00334"></a>00334 <span class="keywordflow">for</span> (count += (value!=0); value &= value - 1; ++count);
359
<a name="l00335"></a>00335 }
360
<a name="l00336"></a>00336 <span class="keywordflow">return</span> count;
361
<a name="l00337"></a>00337 }
362
<a name="l00338"></a>00338 <span class="comment"></span>
363
<a name="l00339"></a>00339 <span class="comment"> /// Comparison.</span>
364
<a name="l00340"></a><a class="code" href="a00037.html#c3b022f81e3eaafab851a23232053a93">00340</a> <span class="comment"></span> <span class="keywordtype">int</span> <a class="code" href="a00037.html#c3b022f81e3eaafab851a23232053a93" title="Comparison.">compare</a>(<span class="keyword">const</span> <a class="code" href="a00037.html" title="Bitvector class with very limited functionality.">bvector_mini</a>& <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bvect</a>)
365
<a name="l00341"></a>00341 {
366
<a name="l00342"></a>00342 <span class="keywordtype">unsigned</span> cnt1 = <a class="code" href="a00037.html#1becbe1fa1d767f6ea17801bd64b4bd5" title="Counts number of bits ON.">bit_count</a>();
367
<a name="l00343"></a>00343 <span class="keywordtype">unsigned</span> cnt2 = bvect.<a class="code" href="a00037.html#1becbe1fa1d767f6ea17801bd64b4bd5" title="Counts number of bits ON.">bit_count</a>();
368
<a name="l00344"></a>00344
369
<a name="l00345"></a>00345 <span class="keywordflow">if</span> (!cnt1 && !cnt2) <span class="keywordflow">return</span> 0;
370
<a name="l00346"></a>00346
371
<a name="l00347"></a>00347 <span class="keywordtype">unsigned</span> cnt_min = cnt1 < cnt2 ? cnt1 : cnt2;
372
<a name="l00348"></a>00348
373
<a name="l00349"></a>00349 <span class="keywordflow">if</span> (!cnt_min) <span class="keywordflow">return</span> cnt1 ? 1 : -1;
374
<a name="l00350"></a>00350
375
<a name="l00351"></a>00351 <span class="keywordtype">unsigned</span> idx1 = <a class="code" href="a00037.html#69391ac769601c2386ca87cfce255c6b" title="Returns index of the first ON bit.">get_first</a>();
376
<a name="l00352"></a>00352 <span class="keywordtype">unsigned</span> idx2 = bvect.<a class="code" href="a00037.html#69391ac769601c2386ca87cfce255c6b" title="Returns index of the first ON bit.">get_first</a>();
377
<a name="l00353"></a>00353
378
<a name="l00354"></a>00354 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < cnt_min; ++i)
379
<a name="l00355"></a>00355 {
380
<a name="l00356"></a>00356 <span class="keywordflow">if</span> (idx1 != idx2)
381
<a name="l00357"></a>00357 {
382
<a name="l00358"></a>00358 <span class="keywordflow">return</span> idx1 < idx2 ? 1 : -1;
383
<a name="l00359"></a>00359 }
384
<a name="l00360"></a>00360 idx1 = <a class="code" href="a00037.html#b43a59f4e322f5a270a7c9bb920b17a3" title="Returns index of next bit, which is ON.">get_next</a>(idx1);
385
<a name="l00361"></a>00361 idx2 = bvect.<a class="code" href="a00037.html#b43a59f4e322f5a270a7c9bb920b17a3" title="Returns index of next bit, which is ON.">get_next</a>(idx2);
386
<a name="l00362"></a>00362 }
387
<a name="l00363"></a>00363
388
<a name="l00364"></a>00364 <a class="code" href="a00072.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(idx1==0 || idx2==0);
389
<a name="l00365"></a>00365
390
<a name="l00366"></a>00366 <span class="keywordflow">if</span> (idx1 != idx2)
391
<a name="l00367"></a>00367 {
392
<a name="l00368"></a>00368 <span class="keywordflow">if</span> (!idx1) <span class="keywordflow">return</span> -1;
393
<a name="l00369"></a>00369 <span class="keywordflow">if</span> (!idx2) <span class="keywordflow">return</span> 1;
394
<a name="l00370"></a>00370 <span class="keywordflow">return</span> idx1 < idx2 ? 1 : -1;
395
<a name="l00371"></a>00371 }
396
<a name="l00372"></a>00372
397
<a name="l00373"></a>00373 <span class="keywordflow">return</span> 0;
398
<a name="l00374"></a>00374 }
399
<a name="l00375"></a>00375
400
<a name="l00376"></a>00376 <span class="comment"></span>
401
<a name="l00377"></a>00377 <span class="comment"> /// Returns index of the first ON bit</span>
402
<a name="l00378"></a><a class="code" href="a00037.html#69391ac769601c2386ca87cfce255c6b">00378</a> <span class="comment"></span> <span class="keywordtype">unsigned</span> <a class="code" href="a00037.html#69391ac769601c2386ca87cfce255c6b" title="Returns index of the first ON bit.">get_first</a>()<span class="keyword"> const</span>
403
<a name="l00379"></a>00379 <span class="keyword"> </span>{
404
<a name="l00380"></a>00380 <span class="keywordtype">unsigned</span> pos = 0;
405
<a name="l00381"></a>00381 <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* ptr = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*) m_buf;
406
<a name="l00382"></a>00382
407
<a name="l00383"></a>00383 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> i = 0; i < (m_size/8)+1; ++i)
408
<a name="l00384"></a>00384 {
409
<a name="l00385"></a>00385 <span class="keyword">register</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> w = ptr[i];
410
<a name="l00386"></a>00386
411
<a name="l00387"></a>00387
412
<a name="l00388"></a>00388 <span class="keywordflow">if</span> (w != 0)
413
<a name="l00389"></a>00389 {
414
<a name="l00390"></a>00390 <span class="keywordflow">while</span> ((w & 1) == 0)
415
<a name="l00391"></a>00391 {
416
<a name="l00392"></a>00392 w >>= 1;
417
<a name="l00393"></a>00393 ++pos;
418
<a name="l00394"></a>00394 }
419
<a name="l00395"></a>00395 <span class="keywordflow">return</span> pos;
420
<a name="l00396"></a>00396 }
421
<a name="l00397"></a>00397 pos += <span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> char) * 8;
422
<a name="l00398"></a>00398 }
423
<a name="l00399"></a>00399 <span class="keywordflow">return</span> 0;
424
<a name="l00400"></a>00400 }
425
<a name="l00401"></a>00401
426
<a name="l00402"></a>00402 <span class="comment"></span>
427
<a name="l00403"></a>00403 <span class="comment"> /// Returns index of next bit, which is ON</span>
428
<a name="l00404"></a><a class="code" href="a00037.html#b43a59f4e322f5a270a7c9bb920b17a3">00404</a> <span class="comment"></span> <span class="keywordtype">unsigned</span> <a class="code" href="a00037.html#b43a59f4e322f5a270a7c9bb920b17a3" title="Returns index of next bit, which is ON.">get_next</a>(<span class="keywordtype">unsigned</span> idx)<span class="keyword"> const</span>
429
<a name="l00405"></a>00405 <span class="keyword"> </span>{
430
<a name="l00406"></a>00406 <span class="keyword">register</span> <span class="keywordtype">unsigned</span> i;
431
<a name="l00407"></a>00407
432
<a name="l00408"></a>00408 <span class="keywordflow">for</span> (i = idx+1; i < m_size; ++i)
433
<a name="l00409"></a>00409 {
434
<a name="l00410"></a>00410 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>* offs = (<span class="keywordtype">unsigned</span> <span class="keywordtype">char</span>*)m_buf + (i >> 3);
435
<a name="l00411"></a>00411 <span class="keywordflow">if</span> (*offs)
436
<a name="l00412"></a>00412 {
437
<a name="l00413"></a>00413 <span class="keywordtype">unsigned</span> <span class="keywordtype">char</span> mask = (<span class="keywordtype">unsigned</span> char)((<span class="keywordtype">char</span>)0x1 << (i & 7));
438
<a name="l00414"></a>00414
439
<a name="l00415"></a>00415 <span class="keywordflow">if</span> (*offs & mask)
440
<a name="l00416"></a>00416 {
441
<a name="l00417"></a>00417 <span class="keywordflow">return</span> i;
442
<a name="l00418"></a>00418 }
443
<a name="l00419"></a>00419 }
444
<a name="l00420"></a>00420 <span class="keywordflow">else</span>
445
<a name="l00421"></a>00421 {
446
<a name="l00422"></a>00422 i += 7;
447
<a name="l00423"></a>00423 }
448
<a name="l00424"></a>00424 }
449
<a name="l00425"></a>00425 <span class="keywordflow">return</span> 0;
450
<a name="l00426"></a>00426 }
451
<a name="l00427"></a>00427
452
<a name="l00428"></a>00428
453
<a name="l00429"></a><a class="code" href="a00037.html#8a95d88b371e57e7f9f2636f535fde97">00429</a> <span class="keywordtype">void</span> <a class="code" href="a00037.html#8a95d88b371e57e7f9f2636f535fde97">combine_and</a>(<span class="keyword">const</span> <a class="code" href="a00037.html" title="Bitvector class with very limited functionality.">bvector_mini</a>& <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bvect</a>)
454
<a name="l00430"></a>00430 {
455
<a name="l00431"></a>00431 <span class="keyword">const</span> <span class="keywordtype">unsigned</span>* end = m_buf + (m_size / 32)+1;
456
<a name="l00432"></a>00432
457
<a name="l00433"></a>00433 <span class="keyword">const</span> <span class="keywordtype">unsigned</span>* src = bvect.<a class="code" href="a00037.html#44873b590c47bf1b52ea62a3384aea1a">get_buf</a>();
458
<a name="l00434"></a>00434
459
<a name="l00435"></a>00435 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span>* start = m_buf; start < end; ++start)
460
<a name="l00436"></a>00436 {
461
<a name="l00437"></a>00437 *start &= *src++;
462
<a name="l00438"></a>00438 }
463
<a name="l00439"></a>00439 }
464
<a name="l00440"></a>00440
465
<a name="l00441"></a><a class="code" href="a00037.html#b53f530e6be242a26491141a05d09982">00441</a> <span class="keywordtype">void</span> <a class="code" href="a00037.html#b53f530e6be242a26491141a05d09982">combine_xor</a>(<span class="keyword">const</span> <a class="code" href="a00037.html" title="Bitvector class with very limited functionality.">bvector_mini</a>& <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bvect</a>)
466
<a name="l00442"></a>00442 {
467
<a name="l00443"></a>00443 <span class="keyword">const</span> <span class="keywordtype">unsigned</span>* end = m_buf + (m_size / 32)+1;
468
<a name="l00444"></a>00444
469
<a name="l00445"></a>00445 <span class="keyword">const</span> <span class="keywordtype">unsigned</span>* src = bvect.<a class="code" href="a00037.html#44873b590c47bf1b52ea62a3384aea1a">get_buf</a>();
470
<a name="l00446"></a>00446
471
<a name="l00447"></a>00447 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span>* start = m_buf; start < end; ++start)
472
<a name="l00448"></a>00448 {
473
<a name="l00449"></a>00449 *start ^= *src++;
474
<a name="l00450"></a>00450 }
475
<a name="l00451"></a>00451 }
476
<a name="l00452"></a>00452
477
<a name="l00453"></a>00453
478
<a name="l00454"></a><a class="code" href="a00037.html#9b977e253866aafed72df9ae6be18965">00454</a> <span class="keywordtype">void</span> <a class="code" href="a00037.html#9b977e253866aafed72df9ae6be18965">combine_or</a>(<span class="keyword">const</span> <a class="code" href="a00037.html" title="Bitvector class with very limited functionality.">bvector_mini</a>& <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bvect</a>)
479
<a name="l00455"></a>00455 {
480
<a name="l00456"></a>00456 <span class="keyword">const</span> <span class="keywordtype">unsigned</span>* end = m_buf + (m_size / 32)+1;
481
<a name="l00457"></a>00457
482
<a name="l00458"></a>00458 <span class="keyword">const</span> <span class="keywordtype">unsigned</span>* src = bvect.<a class="code" href="a00037.html#44873b590c47bf1b52ea62a3384aea1a">get_buf</a>();
483
<a name="l00459"></a>00459
484
<a name="l00460"></a>00460 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span>* start = m_buf; start < end; ++start)
485
<a name="l00461"></a>00461 {
486
<a name="l00462"></a>00462 *start |= *src++;
487
<a name="l00463"></a>00463 }
488
<a name="l00464"></a>00464 }
489
<a name="l00465"></a>00465
490
<a name="l00466"></a><a class="code" href="a00037.html#606b3a5570dd2d1016c60d00118bf8d5">00466</a> <span class="keywordtype">void</span> <a class="code" href="a00037.html#606b3a5570dd2d1016c60d00118bf8d5">combine_sub</a>(<span class="keyword">const</span> <a class="code" href="a00037.html" title="Bitvector class with very limited functionality.">bvector_mini</a>& <a class="code" href="a00036.html" title="bitvector with runtime compression of bits.">bvect</a>)
491
<a name="l00467"></a>00467 {
492
<a name="l00468"></a>00468 <span class="keyword">const</span> <span class="keywordtype">unsigned</span>* end = m_buf + (m_size / 32)+1;
493
<a name="l00469"></a>00469
494
<a name="l00470"></a>00470 <span class="keyword">const</span> <span class="keywordtype">unsigned</span>* src = bvect.<a class="code" href="a00037.html#44873b590c47bf1b52ea62a3384aea1a">get_buf</a>();
495
<a name="l00471"></a>00471
496
<a name="l00472"></a>00472 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span>* start = m_buf; start < end; ++start)
497
<a name="l00473"></a>00473 {
498
<a name="l00474"></a>00474 *start &= ~(*src++);
499
<a name="l00475"></a>00475 }
500
<a name="l00476"></a>00476 }
501
<a name="l00477"></a>00477
502
<a name="l00478"></a><a class="code" href="a00037.html#44873b590c47bf1b52ea62a3384aea1a">00478</a> <span class="keyword">const</span> <span class="keywordtype">unsigned</span>* <a class="code" href="a00037.html#44873b590c47bf1b52ea62a3384aea1a">get_buf</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> m_buf; }
503
<a name="l00479"></a><a class="code" href="a00037.html#b94ed32db48e192c6bd6da15bfa9c486">00479</a> <span class="keywordtype">unsigned</span> <a class="code" href="a00037.html#b94ed32db48e192c6bd6da15bfa9c486">mem_used</a>()<span class="keyword"> const</span>
504
<a name="l00480"></a>00480 <span class="keyword"> </span>{
505
<a name="l00481"></a>00481 <span class="keywordflow">return</span> <span class="keyword">sizeof</span>(<a class="code" href="a00037.html" title="Bitvector class with very limited functionality.">bvector_mini</a>) + (m_size / 32) + 1;
506
<a name="l00482"></a>00482 }
507
<a name="l00483"></a>00483
508
<a name="l00484"></a><a class="code" href="a00037.html#6e51947affb26ce925b3a71c81105802">00484</a> <span class="keywordtype">void</span> <a class="code" href="a00037.html#6e51947affb26ce925b3a71c81105802">swap</a>(<a class="code" href="a00037.html" title="Bitvector class with very limited functionality.">bvector_mini</a>& bvm)
509
<a name="l00485"></a>00485 {
510
<a name="l00486"></a>00486 <a class="code" href="a00072.html#a44515fab0ace8928d1cb82009a95bf8">BM_ASSERT</a>(m_size == bvm.m_size);
511
<a name="l00487"></a>00487 <a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* buftmp = m_buf;
512
<a name="l00488"></a>00488 m_buf = bvm.m_buf;
513
<a name="l00489"></a>00489 bvm.m_buf = buftmp;
514
<a name="l00490"></a>00490 }
515
<a name="l00491"></a>00491
516
<a name="l00492"></a>00492 <span class="keyword">private</span>:
517
<a name="l00493"></a>00493 <a class="code" href="a00088.html#17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* m_buf;
518
<a name="l00494"></a>00494 <span class="keywordtype">unsigned</span> m_size;
519
<a name="l00495"></a>00495 };
520
<a name="l00496"></a>00496
521
<a name="l00497"></a>00497
522
<a name="l00498"></a>00498
523
<a name="l00499"></a>00499 } <span class="comment">// namespace bm</span>
524
<a name="l00500"></a>00500
525
<a name="l00501"></a>00501 <span class="preprocessor">#endif</span>
527
<hr size="1"><address style="text-align: right;"><small>Generated on Sat Aug 8 12:21:27 2009 for BitMagic by
528
<a href="http://www.doxygen.org/index.html">
529
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.9 </small></address>
added
removed
doc/html/a00077_source.html
