48
48
<a name="l00021"></a>00021 <span class="comment">OTHER DEALINGS IN THE SOFTWARE.</span>
49
49
<a name="l00022"></a>00022 <span class="comment">*/</span>
50
50
<a name="l00023"></a>00023 <span class="comment"></span>
51
<a name="l00024"></a>00024 <span class="comment">/** \example sample6.cpp</span>
52
<a name="l00025"></a>00025 <span class="comment"> This example demonstrates using of custom memory allocators.</span>
53
<a name="l00026"></a>00026 <span class="comment"> In this case allocator works as a memory checker, counts number of </span>
54
<a name="l00027"></a>00027 <span class="comment"> allocations and deallocations to make sure that there is no memory leaks. </span>
55
<a name="l00028"></a>00028 <span class="comment"></span>
56
<a name="l00029"></a>00029 <span class="comment">For more information please visit: http://bmagic.sourceforge.net</span>
57
<a name="l00030"></a>00030 <span class="comment">*/</span>
58
<a name="l00031"></a>00031
59
<a name="l00032"></a>00032 <span class="preprocessor">#include <iostream></span>
60
<a name="l00033"></a>00033 <span class="preprocessor">#include <assert.h></span>
61
<a name="l00034"></a>00034 <span class="preprocessor">#include "<a class="code" href="a00087.html">bm.h</a>"</span>
62
<a name="l00035"></a>00035
63
<a name="l00036"></a>00036 <span class="keyword">using namespace </span>std;
64
<a name="l00037"></a>00037
51
<a name="l00024"></a>00024 <span class="comment">/** \example sample5.cpp</span>
52
<a name="l00025"></a>00025 <span class="comment"> Example demonstrates using enumerators - the fastest way to retrieve </span>
53
<a name="l00026"></a>00026 <span class="comment"> indexes of 1 bits from the bitvector. This approach works faster than</span>
54
<a name="l00027"></a>00027 <span class="comment"> get_first/get_next functions.</span>
55
<a name="l00028"></a>00028 <span class="comment"> </span>
56
<a name="l00029"></a>00029 <span class="comment"> \sa bm::bvector<>::enumerator </span>
57
<a name="l00030"></a>00030 <span class="comment"></span>
58
<a name="l00031"></a>00031 <span class="comment">For more information please visit: http://bmagic.sourceforge.net</span>
59
<a name="l00032"></a>00032 <span class="comment"></span>
60
<a name="l00033"></a>00033 <span class="comment">*/</span>
61
<a name="l00034"></a>00034
62
<a name="l00035"></a>00035 <span class="preprocessor">#include <iostream></span>
63
<a name="l00036"></a>00036 <span class="preprocessor">#include <algorithm></span>
64
<a name="l00037"></a>00037 <span class="preprocessor">#include "<a class="code" href="a00088.html">bm.h</a>"</span>
65
65
<a name="l00038"></a>00038
66
<a name="l00039"></a>00039 <span class="comment">// Custom allocator keeps number of all alloc/free calls.</span>
67
<a name="l00040"></a>00040 <span class="comment">// It also reservs the front word of the allocated block and saves</span>
68
<a name="l00041"></a>00041 <span class="comment">// number of elements allocated. On deallocation it makes sure</span>
69
<a name="l00042"></a>00042 <span class="comment">// it deallocates the same size as allocated</span>
70
<a name="l00043"></a>00043
71
<a name="l00044"></a><a class="code" href="a00051.html">00044</a> <span class="keyword">class </span><a class="code" href="a00051.html">dbg_block_allocator</a>
72
<a name="l00045"></a>00045 {
73
<a name="l00046"></a>00046 <span class="keyword">public</span>:
74
<a name="l00047"></a><a class="code" href="a00051.html#a2e3f8148fefdb34093ebf3db55b6175b">00047</a> <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <a class="code" href="a00051.html#a2e3f8148fefdb34093ebf3db55b6175b">na_</a>;
75
<a name="l00048"></a><a class="code" href="a00051.html#aadb605865e1f0ea195000e51e90001e6">00048</a> <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <a class="code" href="a00051.html#aadb605865e1f0ea195000e51e90001e6">nf_</a>;
66
<a name="l00039"></a>00039 <span class="keyword">using namespace </span>std;
67
<a name="l00040"></a>00040
68
<a name="l00041"></a><a class="code" href="a00111.html#a80085d7c877f4c6f36d10c67dc163845">00041</a> <span class="keywordtype">void</span> <a class="code" href="a00111.html#a80085d7c877f4c6f36d10c67dc163845">Print</a>(<span class="keywordtype">unsigned</span> n)
69
<a name="l00042"></a>00042 {
70
<a name="l00043"></a>00043 cout << n << endl;;
71
<a name="l00044"></a>00044 }
72
<a name="l00045"></a>00045
73
<a name="l00046"></a><a class="code" href="a00111.html#a840291bc02cba5474a4cb46a9b9566fe">00046</a> <span class="keywordtype">int</span> <a class="code" href="a00106.html#a840291bc02cba5474a4cb46a9b9566fe">main</a>(<span class="keywordtype">void</span>)
74
<a name="l00047"></a>00047 {
75
<a name="l00048"></a>00048 <a class="code" href="a00044.html" title="bitvector with runtime compression of bits.">bm::bvector<></a> bv;
76
76
<a name="l00049"></a>00049
77
<a name="l00050"></a><a class="code" href="a00051.html#a93d82be8946cf5b72c9d7c6cb956e804">00050</a> <span class="keyword">static</span> <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* <a class="code" href="a00051.html#a93d82be8946cf5b72c9d7c6cb956e804">allocate</a>(<span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">void</span> *)
78
<a name="l00051"></a>00051 {
79
<a name="l00052"></a>00052 ++<a class="code" href="a00051.html#a2e3f8148fefdb34093ebf3db55b6175b">na_</a>;
80
<a name="l00053"></a>00053 assert(n);
81
<a name="l00054"></a>00054 <a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* p =
82
<a name="l00055"></a>00055 (<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>*) ::malloc((n+1) * <span class="keyword">sizeof</span>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>));
83
<a name="l00056"></a>00056 *p = n;
84
<a name="l00057"></a>00057 <span class="keywordflow">return</span> ++p;
85
<a name="l00058"></a>00058 }
86
<a name="l00059"></a>00059
87
<a name="l00060"></a><a class="code" href="a00051.html#a56d40f419ba5f9e54b61d8ab88f93866">00060</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="a00051.html#a56d40f419ba5f9e54b61d8ab88f93866">deallocate</a>(<a class="code" href="a00115.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a>* p, <span class="keywordtype">size_t</span> n)
88
<a name="l00061"></a>00061 {
89
<a name="l00062"></a>00062 ++<a class="code" href="a00051.html#aadb605865e1f0ea195000e51e90001e6">nf_</a>;
90
<a name="l00063"></a>00063 --p;
91
<a name="l00064"></a>00064 assert(*p == n);
92
<a name="l00065"></a>00065 ::free(p);
93
<a name="l00066"></a>00066 }
94
<a name="l00067"></a>00067
95
<a name="l00068"></a><a class="code" href="a00051.html#a316046faa0e5010b9d4b4881977dde49">00068</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="a00051.html#a316046faa0e5010b9d4b4881977dde49">balance</a>()
96
<a name="l00069"></a>00069 {
97
<a name="l00070"></a>00070 <span class="keywordflow">return</span> <a class="code" href="a00051.html#aadb605865e1f0ea195000e51e90001e6">nf_</a> - <a class="code" href="a00051.html#a2e3f8148fefdb34093ebf3db55b6175b">na_</a>;
98
<a name="l00071"></a>00071 }
99
<a name="l00072"></a>00072 };
100
<a name="l00073"></a>00073
101
<a name="l00074"></a>00074 <span class="keywordtype">unsigned</span> <a class="code" href="a00051.html#a2e3f8148fefdb34093ebf3db55b6175b">dbg_block_allocator::na_</a> = 0;
102
<a name="l00075"></a>00075 <span class="keywordtype">unsigned</span> <a class="code" href="a00051.html#aadb605865e1f0ea195000e51e90001e6">dbg_block_allocator::nf_</a> = 0;
103
<a name="l00076"></a>00076
104
<a name="l00077"></a><a class="code" href="a00052.html">00077</a> <span class="keyword">class </span><a class="code" href="a00052.html">dbg_ptr_allocator</a>
105
<a name="l00078"></a>00078 {
106
<a name="l00079"></a>00079 <span class="keyword">public</span>:
107
<a name="l00080"></a><a class="code" href="a00052.html#a1839c318b76fefce64ba0a0aba52e2b0">00080</a> <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <a class="code" href="a00052.html#a1839c318b76fefce64ba0a0aba52e2b0">na_</a>;
108
<a name="l00081"></a><a class="code" href="a00052.html#afbbe7e12818ba2c51358b66d00fc05f0">00081</a> <span class="keyword">static</span> <span class="keywordtype">unsigned</span> <a class="code" href="a00052.html#afbbe7e12818ba2c51358b66d00fc05f0">nf_</a>;
109
<a name="l00082"></a>00082
110
<a name="l00083"></a><a class="code" href="a00052.html#a15a6c29419ebabc9221051cdd63e9495">00083</a> <span class="keyword">static</span> <span class="keywordtype">void</span>* <a class="code" href="a00052.html#a15a6c29419ebabc9221051cdd63e9495">allocate</a>(<span class="keywordtype">size_t</span> n, <span class="keyword">const</span> <span class="keywordtype">void</span> *)
111
<a name="l00084"></a>00084 {
112
<a name="l00085"></a>00085 ++<a class="code" href="a00052.html#a1839c318b76fefce64ba0a0aba52e2b0">na_</a>;
113
<a name="l00086"></a>00086 assert(<span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>) == <span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*));
114
<a name="l00087"></a>00087 <span class="keywordtype">void</span>* p = ::malloc((n+1) * <span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*));
115
<a name="l00088"></a>00088 <span class="keywordtype">size_t</span>* s = (<span class="keywordtype">size_t</span>*) p;
116
<a name="l00089"></a>00089 *s = n;
117
<a name="l00090"></a>00090 <span class="keywordflow">return</span> (<span class="keywordtype">void</span>*)++s;
118
<a name="l00091"></a>00091 }
119
<a name="l00092"></a>00092
120
<a name="l00093"></a><a class="code" href="a00052.html#a89cd3e8e84ef4a4598446ba8fa8c10a3">00093</a> <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="a00052.html#a89cd3e8e84ef4a4598446ba8fa8c10a3">deallocate</a>(<span class="keywordtype">void</span>* p, <span class="keywordtype">size_t</span> n)
121
<a name="l00094"></a>00094 {
122
<a name="l00095"></a>00095 ++<a class="code" href="a00052.html#afbbe7e12818ba2c51358b66d00fc05f0">nf_</a>;
123
<a name="l00096"></a>00096 <span class="keywordtype">size_t</span>* s = (<span class="keywordtype">size_t</span>*) p;
124
<a name="l00097"></a>00097 --s;
125
<a name="l00098"></a>00098 assert(*s == n);
126
<a name="l00099"></a>00099 ::free(s);
127
<a name="l00100"></a>00100 }
128
<a name="l00101"></a>00101
129
<a name="l00102"></a><a class="code" href="a00052.html#a521bc1068c669de23dc20d582d229918">00102</a> <span class="keyword">static</span> <span class="keywordtype">int</span> <a class="code" href="a00052.html#a521bc1068c669de23dc20d582d229918">balance</a>()
130
<a name="l00103"></a>00103 {
131
<a name="l00104"></a>00104 <span class="keywordflow">return</span> <a class="code" href="a00052.html#afbbe7e12818ba2c51358b66d00fc05f0">nf_</a> - <a class="code" href="a00052.html#a1839c318b76fefce64ba0a0aba52e2b0">na_</a>;
132
<a name="l00105"></a>00105 }
133
<a name="l00106"></a>00106
134
<a name="l00107"></a>00107 };
135
<a name="l00108"></a>00108
136
<a name="l00109"></a>00109 <span class="keywordtype">unsigned</span> <a class="code" href="a00052.html#a1839c318b76fefce64ba0a0aba52e2b0">dbg_ptr_allocator::na_</a> = 0;
137
<a name="l00110"></a>00110 <span class="keywordtype">unsigned</span> <a class="code" href="a00052.html#afbbe7e12818ba2c51358b66d00fc05f0">dbg_ptr_allocator::nf_</a> = 0;
138
<a name="l00111"></a>00111
139
<a name="l00112"></a>00112
140
<a name="l00113"></a><a class="code" href="a00111.html#aa932e8e72ba07938f1a001b6cfcb614e">00113</a> <span class="keyword">typedef</span> <a class="code" href="a00074.html" title="BM style allocator adapter.">bm::mem_alloc<dbg_block_allocator, dbg_ptr_allocator></a> <a class="code" href="a00074.html" title="BM style allocator adapter.">dbg_alloc</a>;
141
<a name="l00114"></a>00114
142
<a name="l00115"></a><a class="code" href="a00111.html#ac07bb102df543a0c581493c5f35b2129">00115</a> <span class="keyword">typedef</span> <a class="code" href="a00044.html" title="bitvector with runtime compression of bits.">bm::bvector<dbg_alloc></a> <a class="code" href="a00044.html" title="bitvector with runtime compression of bits.">bvect</a>;
143
<a name="l00116"></a>00116
144
<a name="l00117"></a>00117
145
<a name="l00118"></a>00118
146
<a name="l00119"></a><a class="code" href="a00111.html#a840291bc02cba5474a4cb46a9b9566fe">00119</a> <span class="keywordtype">int</span> <a class="code" href="a00105.html#a840291bc02cba5474a4cb46a9b9566fe">main</a>(<span class="keywordtype">void</span>)
147
<a name="l00120"></a>00120 {
148
<a name="l00121"></a>00121 {
149
<a name="l00122"></a>00122 <a class="code" href="a00044.html" title="bitvector with runtime compression of bits.">bvect</a> bv;
150
<a name="l00123"></a>00123
151
<a name="l00124"></a>00124 bv[10] = <span class="keyword">true</span>;
152
<a name="l00125"></a>00125 bv[100000] = <span class="keyword">true</span>;
153
<a name="l00126"></a>00126 bv[10000000] = <span class="keyword">false</span>;
154
<a name="l00127"></a>00127 }
155
<a name="l00128"></a>00128
156
<a name="l00129"></a>00129 cout << <span class="stringliteral">"Number of BLOCK allocations = "</span> << <a class="code" href="a00051.html#a2e3f8148fefdb34093ebf3db55b6175b">dbg_block_allocator::na_</a> << endl;
157
<a name="l00130"></a>00130 cout << <span class="stringliteral">"Number of PTR allocations = "</span> << <a class="code" href="a00052.html#a1839c318b76fefce64ba0a0aba52e2b0">dbg_ptr_allocator::na_</a> << endl;
158
<a name="l00131"></a>00131
159
<a name="l00132"></a>00132 assert(<a class="code" href="a00051.html#a316046faa0e5010b9d4b4881977dde49">dbg_block_allocator::balance</a>() == 0);
160
<a name="l00133"></a>00133 assert(<a class="code" href="a00052.html#a521bc1068c669de23dc20d582d229918">dbg_ptr_allocator::balance</a>() == 0);
161
<a name="l00134"></a>00134
162
<a name="l00135"></a>00135 <span class="keywordflow">return</span> 0;
163
<a name="l00136"></a>00136 }
164
<a name="l00137"></a>00137
165
<a name="l00138"></a>00138
77
<a name="l00050"></a>00050 bv[10] = <span class="keyword">true</span>;
78
<a name="l00051"></a>00051 bv[100] = <span class="keyword">true</span>;
79
<a name="l00052"></a>00052 bv[10000] = <span class="keyword">true</span>;
80
<a name="l00053"></a>00053
81
<a name="l00054"></a>00054 <a class="code" href="a00063.html" title="Constant input iterator designed to enumerate &quot;ON&quot; bits.">bm::bvector<>::enumerator</a> en = bv.<a class="code" href="a00044.html#aad48c661f843e32c9893438a6f27a8f0" title="Returns enumerator pointing on the first non-zero bit.">first</a>();
82
<a name="l00055"></a>00055 <a class="code" href="a00063.html" title="Constant input iterator designed to enumerate &quot;ON&quot; bits.">bm::bvector<>::enumerator</a> en_end = bv.<a class="code" href="a00044.html#a2c6e522f858fdc466765d2c0f269f590" title="Returns enumerator pointing on the next bit after the last.">end</a>();
83
<a name="l00056"></a>00056
84
<a name="l00057"></a>00057 <span class="keywordflow">while</span> (en < en_end)
85
<a name="l00058"></a>00058 {
86
<a name="l00059"></a>00059 cout << *en << endl;
87
<a name="l00060"></a>00060 ++en; <span class="comment">// Fastest way to increment enumerator</span>
88
<a name="l00061"></a>00061 }
89
<a name="l00062"></a>00062
90
<a name="l00063"></a>00063 en = bv.<a class="code" href="a00044.html#aad48c661f843e32c9893438a6f27a8f0" title="Returns enumerator pointing on the first non-zero bit.">first</a>();
91
<a name="l00064"></a>00064
92
<a name="l00065"></a>00065 <span class="comment">// This is not the fastest way to do the job, because for_each </span>
93
<a name="l00066"></a>00066 <span class="comment">// often will try to calculate difference between iterators,</span>
94
<a name="l00067"></a>00067 <span class="comment">// which is expensive for enumerators.</span>
95
<a name="l00068"></a>00068 <span class="comment">// But it can be useful for some STL loyal applications. </span>
96
<a name="l00069"></a>00069
97
<a name="l00070"></a>00070 std::for_each(en, en_end, <a class="code" href="a00111.html#a80085d7c877f4c6f36d10c67dc163845">Print</a>);
98
<a name="l00071"></a>00071
99
<a name="l00072"></a>00072 <span class="keywordflow">return</span> 0;
100
<a name="l00073"></a>00073 }
166
101
</pre></div></div>
167
<hr size="1"/><address style="text-align: right;"><small>Generated on Fri Jan 8 20:09:19 2010 for BitMagic by
102
<hr size="1"/><address style="text-align: right;"><small>Generated on Tue Mar 23 20:47:55 2010 for BitMagic by
168
103
<a href="http://www.doxygen.org/index.html">
169
104
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.1 </small></address>
added
removed
doc/html/a00111_source.html
