29
29
<div class="contents">
30
<h1>bmalloc.h File Reference</h1><code>#include <stdlib.h></code><br/>
31
<code>#include <new></code><br/>
30
<h1>bmalgo_impl.h File Reference</h1><code>#include "<a class="el" href="a00093_source.html">bmdef.h</a>"</code><br/>
32
31
<div class="dynheader">
33
Include dependency graph for bmalloc.h:</div>
32
Include dependency graph for bmalgo_impl.h:</div>
34
33
<div class="dynsection">
35
<div class="center"><img src="a00134.png" border="0" usemap="#bmalloc_8h_map" alt=""/></div>
34
<div class="center"><img src="a00133.png" border="0" usemap="#bmalgo__impl_8h_map" alt=""/></div>
35
<map name="bmalgo__impl_8h_map" id="bmalgo__impl_8h">
36
<area shape="rect" href="a00093.html" title="bmdef.h" alt="" coords="24,83,91,112"/></map>
37
38
<div class="dynheader">
38
39
This graph shows which files directly or indirectly include this file:</div>
39
40
<div class="dynsection">
40
<div class="center"><img src="a00135.png" border="0" usemap="#bmalloc_8hdep_map" alt=""/></div>
41
<map name="bmalloc_8hdep_map" id="bmalloc_8hdep">
42
<area shape="rect" href="a00087.html" title="bm.h" alt="" coords="500,83,551,112"/><area shape="rect" href="a00088.html" title="bmalgo.h" alt="" coords="5,160,80,189"/><area shape="rect" href="a00114.html" title="sample9.cpp" alt="" coords="11,237,107,267"/><area shape="rect" href="a00096.html" title="bmserial.h" alt="" coords="155,160,235,189"/><area shape="rect" href="a00109.html" title="sample4.cpp" alt="" coords="165,237,261,267"/><area shape="rect" href="a00095.html" title="bmrandom.h" alt="" coords="309,160,403,189"/><area shape="rect" href="a00106.html" title="sample10.cpp" alt="" coords="347,237,448,267"/><area shape="rect" href="a00105.html" title="sample1.cpp" alt="" coords="477,160,573,189"/><area shape="rect" href="a00107.html" title="sample2.cpp" alt="" coords="597,160,693,189"/><area shape="rect" href="a00108.html" title="sample3.cpp" alt="" coords="717,160,813,189"/><area shape="rect" href="a00110.html" title="sample5.cpp" alt="" coords="837,160,933,189"/><area shape="rect" href="a00111.html" title="sample6.cpp" alt="" coords="957,160,1053,189"/><area shape="rect" href="a00112.html" title="sample7.cpp" alt="" coords="1077,160,1173,189"/><area shape="rect" href="a00113.html" title="sample8.cpp" alt="" coords="1197,160,1293,189"/></map>
41
<div class="center"><img src="a00134.png" border="0" usemap="#bmalgo__impl_8hdep_map" alt=""/></div>
42
<map name="bmalgo__impl_8hdep_map" id="bmalgo__impl_8hdep">
43
<area shape="rect" href="a00089.html" title="bmalgo.h" alt="" coords="20,83,95,112"/><area shape="rect" href="a00097.html" title="bmserial.h" alt="" coords="128,83,208,112"/><area shape="rect" href="a00115.html" title="sample9.cpp" alt="" coords="5,160,101,189"/><area shape="rect" href="a00110.html" title="sample4.cpp" alt="" coords="125,160,221,189"/></map>
45
46
<p><a href="a00090_source.html">Go to the source code of this file.</a></p>
46
47
<table border="0" cellpadding="0" cellspacing="0">
47
48
<tr><td colspan="2"><h2>Data Structures</h2></td></tr>
48
<tr><td class="memItemLeft" align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00039.html">bm::block_allocator</a></td></tr>
49
<tr><td class="mdescLeft"> </td><td class="mdescRight">Default malloc based bitblock allocator class. <a href="a00039.html#_details">More...</a><br/></td></tr>
50
<tr><td class="memItemLeft" align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00078.html">bm::ptr_allocator</a></td></tr>
51
<tr><td class="mdescLeft"> </td><td class="mdescRight">Default malloc based bitblock allocator class. <a href="a00078.html#_details">More...</a><br/></td></tr>
52
<tr><td class="memItemLeft" align="right" valign="top">class </td><td class="memItemRight" valign="bottom"><a class="el" href="a00074.html">bm::mem_alloc< BA, PA ></a></td></tr>
53
<tr><td class="mdescLeft"> </td><td class="mdescRight">BM style allocator adapter. <a href="a00074.html#_details">More...</a><br/></td></tr>
49
<tr><td class="memItemLeft" align="right" valign="top">struct </td><td class="memItemRight" valign="bottom"><a class="el" href="a00061.html">bm::distance_metric_descriptor</a></td></tr>
50
<tr><td class="mdescLeft"> </td><td class="mdescRight">Distance metric descriptor, holds metric code and result. <a href="a00061.html#_details">More...</a><br/></td></tr>
54
51
<tr><td colspan="2"><h2>Namespaces</h2></td></tr>
55
<tr><td class="memItemLeft" align="right" valign="top">namespace </td><td class="memItemRight" valign="bottom"><a class="el" href="a00115.html">bm</a></td></tr>
56
<tr><td colspan="2"><h2>Typedefs</h2></td></tr>
57
<tr><td class="memItemLeft" align="right" valign="top">typedef mem_alloc<br class="typebreak"/>
58
< block_allocator, <br class="typebreak"/>
59
ptr_allocator > </td><td class="memItemRight" valign="bottom"><a class="el" href="a00127.html#gab9059bfb40a6588cdbacfd93901593c1">bm::standard_allocator</a></td></tr>
52
<tr><td class="memItemLeft" align="right" valign="top">namespace </td><td class="memItemRight" valign="bottom"><a class="el" href="a00116.html">bm</a></td></tr>
53
<tr><td colspan="2"><h2>Enumerations</h2></td></tr>
54
<tr><td class="memItemLeft" align="right" valign="top">enum </td><td class="memItemRight" valign="bottom"><a class="el" href="a00126.html#gac38d64c8b27b652413a664cddd4d40ab">bm::distance_metric</a> { <br/>
55
<a class="el" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abacb39376469ba778e9a9099ddbae5e7ce">bm::COUNT_AND</a> = set_COUNT_AND,
56
<a class="el" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba3e4861dde6e1179457ee0d3502ae8061">bm::COUNT_XOR</a> = set_COUNT_XOR,
57
<a class="el" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abad0bd2d56c8ebd03f55c01b3cc6faaaeb">bm::COUNT_OR</a> = set_COUNT_OR,
58
<a class="el" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40aba9c101dab8904c0432f72ccce0a207e62">bm::COUNT_SUB_AB</a> = set_COUNT_SUB_AB,
60
<a class="el" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abafa036fb9d54bc659ed3c9e4185ccf400">bm::COUNT_SUB_BA</a> = set_COUNT_SUB_BA,
61
<a class="el" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abaac7947d53eb3acf81251ee4130e6a4a2">bm::COUNT_A</a> = set_COUNT_A,
62
<a class="el" href="a00126.html#ggac38d64c8b27b652413a664cddd4d40abac6dbadf2ab9405daa47dc0f10d082516">bm::COUNT_B</a> = set_COUNT_B
65
<tr><td class="mdescLeft"> </td><td class="mdescRight"><p>Distance metrics codes defined for vectors A and B. </p>
66
<a href="a00126.html#gac38d64c8b27b652413a664cddd4d40ab">More...</a><br/></td></tr>
67
<tr><td colspan="2"><h2>Functions</h2></td></tr>
68
<tr><td class="memItemLeft" align="right" valign="top">distance_metric </td><td class="memItemRight" valign="bottom"><a class="el" href="a00126.html#ga158946ea41ca66c3e1bca62c92684788">bm::operation2metric</a> (set_operation op)</td></tr>
69
<tr><td class="mdescLeft"> </td><td class="mdescRight">Convert set operation into compatible distance metric. <a href="a00126.html#ga158946ea41ca66c3e1bca62c92684788"></a><br/></td></tr>
70
<tr><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00116.html#abecd5b24d5e394fd46a9db514cfa659a">bm::combine_count_operation_with_block</a> (const <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *blk, unsigned gap, const <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *arg_blk, int arg_gap, <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *temp_blk, distance_metric_descriptor *dmit, distance_metric_descriptor *dmit_end)</td></tr>
71
<tr><td class="mdescLeft"> </td><td class="mdescRight">Internal function computes different distance metrics. <a href="#abecd5b24d5e394fd46a9db514cfa659a"></a><br/></td></tr>
72
<tr><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00116.html#a24069ced9ea689034ff51246ae707ecc">bm::combine_any_operation_with_block</a> (const <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *blk, unsigned gap, const <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *arg_blk, int arg_gap, <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *temp_blk, distance_metric_descriptor *dmit, distance_metric_descriptor *dmit_end)</td></tr>
73
<tr><td class="mdescLeft"> </td><td class="mdescRight">Internal function computes different existense of distance metric. <a href="#a24069ced9ea689034ff51246ae707ecc"></a><br/></td></tr>
74
<tr><td class="memItemLeft" align="right" valign="top">unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="a00116.html#a2f81b8ce3d389973b4f867b0fcc98e7a">bm::combine_count_operation_with_block</a> (const <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *blk, unsigned gap, const <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *arg_blk, int arg_gap, <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *temp_blk, distance_metric metric)</td></tr>
75
<tr><td class="memItemLeft" align="right" valign="top">unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="a00116.html#a093f2dadce40f42a184928c9d1456592">bm::combine_any_operation_with_block</a> (const <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *blk, unsigned gap, const <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *arg_blk, int arg_gap, <a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> *temp_blk, distance_metric metric)</td></tr>
76
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
77
<tr><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00116.html#a17fd5ba52db3ddda05e6f8dd5000a1a4">bm::word_t</a> * </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00116.html#ad47cf2dce876dcbc25aef4c7a222c66f">bm::distance_stage</a> (const BV &bv1, const distance_metric_descriptor *dmit, const distance_metric_descriptor *dmit_end, bool *is_all_and)</td></tr>
78
<tr><td class="mdescLeft"> </td><td class="mdescRight">Staging function for distance operation. <a href="#ad47cf2dce876dcbc25aef4c7a222c66f"></a><br/></td></tr>
79
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
80
<tr><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00126.html#ga815fef76f02576ab9ab58de0a45d8a4b">bm::distance_operation</a> (const BV &bv1, const BV &bv2, distance_metric_descriptor *dmit, distance_metric_descriptor *dmit_end)</td></tr>
81
<tr><td class="mdescLeft"> </td><td class="mdescRight">Distance computing template function. <a href="a00126.html#ga815fef76f02576ab9ab58de0a45d8a4b"></a><br/></td></tr>
82
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
83
<tr><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00126.html#gaa66525fd7a3f823d73678252a235982e">bm::distance_operation_any</a> (const BV &bv1, const BV &bv2, distance_metric_descriptor *dmit, distance_metric_descriptor *dmit_end)</td></tr>
84
<tr><td class="mdescLeft"> </td><td class="mdescRight">Distance screening template function. <a href="a00126.html#gaa66525fd7a3f823d73678252a235982e"></a><br/></td></tr>
85
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
86
<tr><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00126.html#gae451cb4b87e8c0859b0614d2ffb99737">bm::count_and</a> (const BV &bv1, const BV &bv2)</td></tr>
87
<tr><td class="mdescLeft"> </td><td class="mdescRight">Computes bitcount of AND operation of two bitsets. <a href="a00126.html#gae451cb4b87e8c0859b0614d2ffb99737"></a><br/></td></tr>
88
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
89
<tr><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00126.html#ga2d5393e05bcfc540840a4cee67fb771f">bm::any_and</a> (const BV &bv1, const BV &bv2)</td></tr>
90
<tr><td class="mdescLeft"> </td><td class="mdescRight">Computes if there is any bit in AND operation of two bitsets. <a href="a00126.html#ga2d5393e05bcfc540840a4cee67fb771f"></a><br/></td></tr>
91
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
92
<tr><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00126.html#gafc64a082dcaee07f70f7faf3e24f844e">bm::count_xor</a> (const BV &bv1, const BV &bv2)</td></tr>
93
<tr><td class="mdescLeft"> </td><td class="mdescRight">Computes bitcount of XOR operation of two bitsets. <a href="a00126.html#gafc64a082dcaee07f70f7faf3e24f844e"></a><br/></td></tr>
94
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
95
<tr><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00126.html#ga2d63f41244b82d233acb53d88b326b82">bm::any_xor</a> (const BV &bv1, const BV &bv2)</td></tr>
96
<tr><td class="mdescLeft"> </td><td class="mdescRight">Computes if there is any bit in XOR operation of two bitsets. <a href="a00126.html#ga2d63f41244b82d233acb53d88b326b82"></a><br/></td></tr>
97
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
98
<tr><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00126.html#ga902d8c1cd1f8a2538cd47d47f5d8d605">bm::count_sub</a> (const BV &bv1, const BV &bv2)</td></tr>
99
<tr><td class="mdescLeft"> </td><td class="mdescRight">Computes bitcount of SUB operation of two bitsets. <a href="a00126.html#ga902d8c1cd1f8a2538cd47d47f5d8d605"></a><br/></td></tr>
100
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
101
<tr><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00126.html#gabde2e210b9b1edd190e1f5a9ff22344c">bm::any_sub</a> (const BV &bv1, const BV &bv2)</td></tr>
102
<tr><td class="mdescLeft"> </td><td class="mdescRight">Computes if there is any bit in SUB operation of two bitsets. <a href="a00126.html#gabde2e210b9b1edd190e1f5a9ff22344c"></a><br/></td></tr>
103
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
104
<tr><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00126.html#ga803c564668703fc3bf80067570c2c905">bm::count_or</a> (const BV &bv1, const BV &bv2)</td></tr>
105
<tr><td class="mdescLeft"> </td><td class="mdescRight">Computes bitcount of OR operation of two bitsets. <a href="a00126.html#ga803c564668703fc3bf80067570c2c905"></a><br/></td></tr>
106
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
107
<tr><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00126.html#gaeda4f0cf54aa464cec09e740100caa79">bm::any_or</a> (const BV &bv1, const BV &bv2)</td></tr>
108
<tr><td class="mdescLeft"> </td><td class="mdescRight">Computes if there is any bit in OR operation of two bitsets. <a href="a00126.html#gaeda4f0cf54aa464cec09e740100caa79"></a><br/></td></tr>
109
<tr><td class="memTemplParams" colspan="2">template<class It > </td></tr>
110
<tr><td class="memTemplItemLeft" align="right" valign="top">It </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00116.html#a86d5d5ccdb79d2b2ad552bd1caf34b2f">bm::block_range_scan</a> (It first, It last, unsigned nblock, unsigned *max_id)</td></tr>
111
<tr><td class="mdescLeft"> </td><td class="mdescRight">Internal algorithms scans the input for the block range limit. <a href="#a86d5d5ccdb79d2b2ad552bd1caf34b2f"></a><br/></td></tr>
112
<tr><td class="memTemplParams" colspan="2">template<class BV , class It > </td></tr>
113
<tr><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00125.html#ga54ff78528c99ae3ca443eb99ba44785b">bm::combine_or</a> (BV &bv, It first, It last)</td></tr>
114
<tr><td class="mdescLeft"> </td><td class="mdescRight">OR Combine bitvector and the iterable sequence. <a href="a00125.html#ga54ff78528c99ae3ca443eb99ba44785b"></a><br/></td></tr>
115
<tr><td class="memTemplParams" colspan="2">template<class BV , class It > </td></tr>
116
<tr><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00125.html#ga3cb362aee03de6a321495100ae5c8375">bm::combine_xor</a> (BV &bv, It first, It last)</td></tr>
117
<tr><td class="mdescLeft"> </td><td class="mdescRight">XOR Combine bitvector and the iterable sequence. <a href="a00125.html#ga3cb362aee03de6a321495100ae5c8375"></a><br/></td></tr>
118
<tr><td class="memTemplParams" colspan="2">template<class BV , class It > </td></tr>
119
<tr><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00125.html#gab88c5bf51484323e0139aa789d7f0b98">bm::combine_sub</a> (BV &bv, It first, It last)</td></tr>
120
<tr><td class="mdescLeft"> </td><td class="mdescRight">SUB Combine bitvector and the iterable sequence. <a href="a00125.html#gab88c5bf51484323e0139aa789d7f0b98"></a><br/></td></tr>
121
<tr><td class="memTemplParams" colspan="2">template<class BV , class It > </td></tr>
122
<tr><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00125.html#ga22922f71bd1eec8a5b663dc77b90cf6c">bm::combine_and_sorted</a> (BV &bv, It first, It last)</td></tr>
123
<tr><td class="mdescLeft"> </td><td class="mdescRight">AND Combine bitvector and the iterable sequence. <a href="a00125.html#ga22922f71bd1eec8a5b663dc77b90cf6c"></a><br/></td></tr>
124
<tr><td class="memTemplParams" colspan="2">template<class BV , class It > </td></tr>
125
<tr><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00125.html#ga819bdab57a624a08456ea79161b9c5d2">bm::combine_and</a> (BV &bv, It first, It last)</td></tr>
126
<tr><td class="mdescLeft"> </td><td class="mdescRight">AND Combine bitvector and the iterable sequence. <a href="a00125.html#ga819bdab57a624a08456ea79161b9c5d2"></a><br/></td></tr>
127
<tr><td class="memTemplParams" colspan="2">template<class BV > </td></tr>
128
<tr><td class="memTemplItemLeft" align="right" valign="top"><a class="el" href="a00116.html#aa3824d882a037396370b16f2f0a8bf37">bm::id_t</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00125.html#gac7a59d3bc266310ec127cb3efadb0d33">bm::count_intervals</a> (const BV &bv)</td></tr>
129
<tr><td class="mdescLeft"> </td><td class="mdescRight">Compute number of bit intervals (GAPs) in the bitvector. <a href="a00125.html#gac7a59d3bc266310ec127cb3efadb0d33"></a><br/></td></tr>
130
<tr><td class="memTemplParams" colspan="2">template<class BV , class It > </td></tr>
131
<tr><td class="memTemplItemLeft" align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00125.html#gacd88ed9539553dd93419b7029e8a4584">bm::export_array</a> (BV &bv, It first, It last)</td></tr>
132
<tr><td class="mdescLeft"> </td><td class="mdescRight">Export bitset from an array of binary data representing the bit vector. <a href="a00125.html#gacd88ed9539553dd93419b7029e8a4584"></a><br/></td></tr>
62
<hr size="1"/><address style="text-align: right;"><small>Generated on Fri Jan 8 20:09:19 2010 for BitMagic by
135
<hr size="1"/><address style="text-align: right;"><small>Generated on Tue Mar 23 20:47:57 2010 for BitMagic by
63
136
<a href="http://www.doxygen.org/index.html">
64
137
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.6.1 </small></address>