1
1
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
2
2
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
3
<title>BitMagic: Set algorithms</title>
3
<title>BitMagic: bm::decoder_little_endian Class Reference</title>
4
4
<link href="doxygen.css" rel="stylesheet" type="text/css">
6
6
<!-- Generated by Doxygen 1.4.1 -->
7
7
<div class="qindex"><a class="qindex" href="index.html">Main Page</a> | <a class="qindex" href="modules.html">Modules</a> | <a class="qindex" href="namespaces.html">Namespace List</a> | <a class="qindex" href="hierarchy.html">Class Hierarchy</a> | <a class="qindex" href="classes.html">Alphabetical List</a> | <a class="qindex" href="annotated.html">Data Structures</a> | <a class="qindex" href="dirs.html">Directories</a> | <a class="qindex" href="files.html">File List</a> | <a class="qindex" href="namespacemembers.html">Namespace Members</a> | <a class="qindex" href="functions.html">Data Fields</a> | <a class="qindex" href="globals.html">Globals</a> | <a class="qindex" href="examples.html">Examples</a></div>
10
[<a class="el" href="a00094.html">BitMagic C++ Library</a>]</small>
13
Collaboration diagram for Set algorithms:<center><table><tr><td><img src="a00100.png" border="0" alt="" usemap="#a00161_map">
14
<map name="a00161_map">
15
<area href="a00094.html" shape="rect" coords="19,5,152,26" alt="">
16
<area href="a00101.html" shape="rect" coords="344,5,448,26" alt="">
17
</map></td></tr></table></center>
18
<table border="0" cellpadding="0" cellspacing="0">
9
<a class="el" href="a00129.html">bm</a>::<a class="el" href="a00100.html">decoder_little_endian</a></div>
10
<h1>bm::decoder_little_endian Class Reference</h1>Class for decoding data from memory buffer.
11
<a href="#_details">More...</a>
13
<code>#include <<a class="el" href="a00145.html">encoding.h</a>></code>
15
Inheritance diagram for bm::decoder_little_endian:<p><center><img src="a00229.png" border="0" usemap="#a00230" alt="Inheritance graph"></center>
17
<area href="a00099.html" shape="rect" coords="25,16,143,37" alt="">
19
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center>Collaboration diagram for bm::decoder_little_endian:<p><center><img src="a00231.png" border="0" usemap="#a00232" alt="Collaboration graph"></center>
21
<area href="a00099.html" shape="rect" coords="25,16,143,37" alt="">
23
<center><font size="2">[<a href="graph_legend.html">legend</a>]</font></center><table border="0" cellpadding="0" cellspacing="0">
20
<tr><td colspan="2"><br><h2>Modules</h2></td></tr>
21
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00101.html">Distance metrics</a></td></tr>
23
<tr><td colspan="2"><br><h2>Functions</h2></td></tr>
24
<tr><td class="memTemplParams" nowrap colspan="2">template<class BV, class It> </td></tr>
25
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00100.html#ga0">bm::combine_or</a> (BV &bv, It first, It last)</td></tr>
27
<tr><td class="mdescLeft"> </td><td class="mdescRight">OR Combine bitvector and the iterable sequence. <a href="#ga0"></a><br></td></tr>
28
<tr><td class="memTemplParams" nowrap colspan="2">template<class BV, class It> </td></tr>
29
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00100.html#ga1">bm::combine_xor</a> (BV &bv, It first, It last)</td></tr>
31
<tr><td class="mdescLeft"> </td><td class="mdescRight">XOR Combine bitvector and the iterable sequence. <a href="#ga1"></a><br></td></tr>
32
<tr><td class="memTemplParams" nowrap colspan="2">template<class BV, class It> </td></tr>
33
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00100.html#ga2">bm::combine_sub</a> (BV &bv, It first, It last)</td></tr>
35
<tr><td class="mdescLeft"> </td><td class="mdescRight">SUB Combine bitvector and the iterable sequence. <a href="#ga2"></a><br></td></tr>
36
<tr><td class="memTemplParams" nowrap colspan="2">template<class BV, class It> </td></tr>
37
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00100.html#ga3">bm::combine_and</a> (BV &bv, It first, It last)</td></tr>
39
<tr><td class="mdescLeft"> </td><td class="mdescRight">AND Combine bitvector and the iterable sequence. <a href="#ga3"></a><br></td></tr>
40
<tr><td class="memTemplParams" nowrap colspan="2">template<class BV> </td></tr>
41
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a9">bm::id_t</a> </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00100.html#ga4">bm::count_intervals</a> (const BV &bv)</td></tr>
43
<tr><td class="mdescLeft"> </td><td class="mdescRight">Compute number of bit intervals (GAPs) in the bitvector. <a href="#ga4"></a><br></td></tr>
44
<tr><td class="memTemplParams" nowrap colspan="2">template<class BV, class It> </td></tr>
45
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00100.html#ga5">bm::export_array</a> (BV &bv, It first, It last)</td></tr>
47
<tr><td class="mdescLeft"> </td><td class="mdescRight">Export bitset from an array of binary data representing the bit vector. <a href="#ga5"></a><br></td></tr>
25
<tr><td colspan="2"><br><h2>Public Member Functions</h2></td></tr>
26
<tr><td class="memItemLeft" nowrap align="right" valign="top"> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00100.html#a0">decoder_little_endian</a> (const unsigned char *buf)</td></tr>
28
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00129.html#a28">bm::short_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00100.html#a1">get_16</a> ()</td></tr>
30
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00129.html#a27">bm::word_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00100.html#a2">get_32</a> ()</td></tr>
32
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00100.html#a3">get_32</a> (<a class="el" href="a00129.html#a27">bm::word_t</a> *w, unsigned count)</td></tr>
34
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00100.html#a4">get_16</a> (<a class="el" href="a00129.html#a28">bm::short_t</a> *s, unsigned count)</td></tr>
49
37
<hr><a name="_details"></a><h2>Detailed Description</h2>
50
Set algorithms <hr><h2>Function Documentation</h2>
51
<a class="anchor" name="ga3" doxytag="bm::combine_and"></a><p>
52
<table class="mdTable" cellpadding="2" cellspacing="0">
55
<table cellpadding="0" cellspacing="0" border="0">
57
<td class="mdPrefix" colspan="4">
58
template<class BV, class It> </td>
61
<td class="md" nowrap valign="top">void combine_and </td>
62
<td class="md" valign="top">( </td>
63
<td class="md" nowrap valign="top">BV & </td>
64
<td class="mdname" nowrap> <em>bv</em>, </td>
67
<td class="md" nowrap align="right"></td>
69
<td class="md" nowrap>It </td>
70
<td class="mdname" nowrap> <em>first</em>, </td>
73
<td class="md" nowrap align="right"></td>
75
<td class="md" nowrap>It </td>
76
<td class="mdname" nowrap> <em>last</em></td>
80
<td class="md">) </td>
81
<td class="md" colspan="2"></td>
87
<table cellspacing="5" cellpadding="0" border="0">
95
AND Combine bitvector and the iterable sequence.
97
Algorithm combines bvector with sequence of integers (represents another set). When the agrument set is sorted this method can give serious increase in performance.<p>
98
<dl compact><dt><b>Parameters:</b></dt><dd>
99
<table border="0" cellspacing="2" cellpadding="0">
100
<tr><td valign="top"></td><td valign="top"><em>bv</em> </td><td>- destination bitvector </td></tr>
101
<tr><td valign="top"></td><td valign="top"><em>first</em> </td><td>- first element of the iterated sequence </td></tr>
102
<tr><td valign="top"></td><td valign="top"><em>last</em> </td><td>- last element of the iterated sequence </td></tr>
107
Definition at line <a class="el" href="a00103.html#l00787">787</a> of file <a class="el" href="a00103.html">bmalgo.h</a>.
109
References <a class="el" href="a00103.html#l00550">bm::combine_or()</a>. </td>
112
<a class="anchor" name="ga0" doxytag="bm::combine_or"></a><p>
113
<table class="mdTable" cellpadding="2" cellspacing="0">
116
<table cellpadding="0" cellspacing="0" border="0">
118
<td class="mdPrefix" colspan="4">
119
template<class BV, class It> </td>
122
<td class="md" nowrap valign="top">void combine_or </td>
123
<td class="md" valign="top">( </td>
124
<td class="md" nowrap valign="top">BV & </td>
125
<td class="mdname" nowrap> <em>bv</em>, </td>
128
<td class="md" nowrap align="right"></td>
130
<td class="md" nowrap>It </td>
131
<td class="mdname" nowrap> <em>first</em>, </td>
134
<td class="md" nowrap align="right"></td>
136
<td class="md" nowrap>It </td>
137
<td class="mdname" nowrap> <em>last</em></td>
141
<td class="md">) </td>
142
<td class="md" colspan="2"></td>
148
<table cellspacing="5" cellpadding="0" border="0">
156
OR Combine bitvector and the iterable sequence.
158
Algorithm combines bvector with sequence of integers (represents another set). When the agrument set is sorted this method can give serious increase in performance.<p>
159
<dl compact><dt><b>Parameters:</b></dt><dd>
160
<table border="0" cellspacing="2" cellpadding="0">
161
<tr><td valign="top"></td><td valign="top"><em>bv</em> </td><td>- destination bitvector </td></tr>
162
<tr><td valign="top"></td><td valign="top"><em>first</em> </td><td>- first element of the iterated sequence </td></tr>
163
<tr><td valign="top"></td><td valign="top"><em>last</em> </td><td>- last element of the iterated sequence </td></tr>
168
Definition at line <a class="el" href="a00103.html#l00550">550</a> of file <a class="el" href="a00103.html">bmalgo.h</a>.
170
References <a class="el" href="a00103.html#l00520">bm::block_range_scan()</a>, <a class="el" href="a00105.html#l00057">BMGAP_PTR</a>, <a class="el" href="a00106.html#l01704">bm::gap_limit()</a>, and <a class="el" href="a00106.html#l00843">bm::gap_set_value()</a>.
172
Referenced by <a class="el" href="a00103.html#l00787">bm::combine_and()</a>. </td>
175
<a class="anchor" name="ga2" doxytag="bm::combine_sub"></a><p>
176
<table class="mdTable" cellpadding="2" cellspacing="0">
179
<table cellpadding="0" cellspacing="0" border="0">
181
<td class="mdPrefix" colspan="4">
182
template<class BV, class It> </td>
185
<td class="md" nowrap valign="top">void combine_sub </td>
186
<td class="md" valign="top">( </td>
187
<td class="md" nowrap valign="top">BV & </td>
188
<td class="mdname" nowrap> <em>bv</em>, </td>
191
<td class="md" nowrap align="right"></td>
193
<td class="md" nowrap>It </td>
194
<td class="mdname" nowrap> <em>first</em>, </td>
197
<td class="md" nowrap align="right"></td>
199
<td class="md" nowrap>It </td>
200
<td class="mdname" nowrap> <em>last</em></td>
204
<td class="md">) </td>
205
<td class="md" colspan="2"></td>
211
<table cellspacing="5" cellpadding="0" border="0">
219
SUB Combine bitvector and the iterable sequence.
221
Algorithm combines bvector with sequence of integers (represents another set). When the agrument set is sorted this method can give serious increase in performance.<p>
222
<dl compact><dt><b>Parameters:</b></dt><dd>
223
<table border="0" cellspacing="2" cellpadding="0">
224
<tr><td valign="top"></td><td valign="top"><em>bv</em> </td><td>- destination bitvector </td></tr>
225
<tr><td valign="top"></td><td valign="top"><em>first</em> </td><td>- first element of the iterated sequence </td></tr>
226
<tr><td valign="top"></td><td valign="top"><em>last</em> </td><td>- last element of the iterated sequence </td></tr>
231
Definition at line <a class="el" href="a00103.html#l00707">707</a> of file <a class="el" href="a00103.html">bmalgo.h</a>.
233
References <a class="el" href="a00103.html#l00520">bm::block_range_scan()</a>, <a class="el" href="a00105.html#l00057">BMGAP_PTR</a>, <a class="el" href="a00106.html#l01704">bm::gap_limit()</a>, <a class="el" href="a00106.html#l00843">bm::gap_set_value()</a>, and <a class="el" href="a00106.html#l00399">bm::gap_test()</a>. </td>
236
<a class="anchor" name="ga1" doxytag="bm::combine_xor"></a><p>
237
<table class="mdTable" cellpadding="2" cellspacing="0">
240
<table cellpadding="0" cellspacing="0" border="0">
242
<td class="mdPrefix" colspan="4">
243
template<class BV, class It> </td>
246
<td class="md" nowrap valign="top">void combine_xor </td>
247
<td class="md" valign="top">( </td>
248
<td class="md" nowrap valign="top">BV & </td>
249
<td class="mdname" nowrap> <em>bv</em>, </td>
252
<td class="md" nowrap align="right"></td>
254
<td class="md" nowrap>It </td>
255
<td class="mdname" nowrap> <em>first</em>, </td>
258
<td class="md" nowrap align="right"></td>
260
<td class="md" nowrap>It </td>
261
<td class="mdname" nowrap> <em>last</em></td>
265
<td class="md">) </td>
266
<td class="md" colspan="2"></td>
272
<table cellspacing="5" cellpadding="0" border="0">
280
XOR Combine bitvector and the iterable sequence.
282
Algorithm combines bvector with sequence of integers (represents another set). When the agrument set is sorted this method can give serious increase in performance.<p>
283
<dl compact><dt><b>Parameters:</b></dt><dd>
284
<table border="0" cellspacing="2" cellpadding="0">
285
<tr><td valign="top"></td><td valign="top"><em>bv</em> </td><td>- destination bitvector </td></tr>
286
<tr><td valign="top"></td><td valign="top"><em>first</em> </td><td>- first element of the iterated sequence </td></tr>
287
<tr><td valign="top"></td><td valign="top"><em>last</em> </td><td>- last element of the iterated sequence </td></tr>
292
Definition at line <a class="el" href="a00103.html#l00626">626</a> of file <a class="el" href="a00103.html">bmalgo.h</a>.
294
References <a class="el" href="a00103.html#l00520">bm::block_range_scan()</a>, <a class="el" href="a00105.html#l00014">BM_ASSERT</a>, <a class="el" href="a00105.html#l00057">BMGAP_PTR</a>, <a class="el" href="a00106.html#l01704">bm::gap_limit()</a>, <a class="el" href="a00106.html#l00843">bm::gap_set_value()</a>, and <a class="el" href="a00106.html#l00399">bm::gap_test()</a>. </td>
297
<a class="anchor" name="ga4" doxytag="bm::count_intervals"></a><p>
298
<table class="mdTable" cellpadding="2" cellspacing="0">
301
<table cellpadding="0" cellspacing="0" border="0">
303
<td class="mdPrefix" colspan="4">
304
template<class BV> </td>
307
<td class="md" nowrap valign="top"><a class="el" href="a00092.html#a9">bm::id_t</a> count_intervals </td>
308
<td class="md" valign="top">( </td>
309
<td class="md" nowrap valign="top">const BV & </td>
310
<td class="mdname1" valign="top" nowrap> <em>bv</em> </td>
311
<td class="md" valign="top"> ) </td>
312
<td class="md" nowrap></td>
318
<table cellspacing="5" cellpadding="0" border="0">
326
Compute number of bit intervals (GAPs) in the bitvector.
328
Algorithm traverses bit vector and count number of uninterrupted intervals of 1s and 0s. <pre>
330
00001111100000 - gives us 3 intervals
331
10001111100000 - 4 intervals
332
00000000000000 - 1 interval
333
11111111111111 - 1 interval
334
</pre> <dl compact><dt><b>Returns:</b></dt><dd>Number of intervals </dd></dl>
337
Definition at line <a class="el" href="a00103.html#l00810">810</a> of file <a class="el" href="a00103.html">bmalgo.h</a>.
339
References <a class="el" href="a00106.html#l00488">bm::for_each_block()</a>. </td>
342
<a class="anchor" name="ga5" doxytag="bm::export_array"></a><p>
343
<table class="mdTable" cellpadding="2" cellspacing="0">
346
<table cellpadding="0" cellspacing="0" border="0">
348
<td class="mdPrefix" colspan="4">
349
template<class BV, class It> </td>
352
<td class="md" nowrap valign="top">void export_array </td>
353
<td class="md" valign="top">( </td>
354
<td class="md" nowrap valign="top">BV & </td>
355
<td class="mdname" nowrap> <em>bv</em>, </td>
358
<td class="md" nowrap align="right"></td>
360
<td class="md" nowrap>It </td>
361
<td class="mdname" nowrap> <em>first</em>, </td>
364
<td class="md" nowrap align="right"></td>
366
<td class="md" nowrap>It </td>
367
<td class="mdname" nowrap> <em>last</em></td>
371
<td class="md">) </td>
372
<td class="md" colspan="2"></td>
378
<table cellspacing="5" cellpadding="0" border="0">
386
Export bitset from an array of binary data representing the bit vector.
388
Input array can be array of ints, chars or other native C types. Method works with iterators, which makes it compatible with STL containers and C arrays<p>
389
<dl compact><dt><b>Parameters:</b></dt><dd>
390
<table border="0" cellspacing="2" cellpadding="0">
391
<tr><td valign="top"></td><td valign="top"><em>bv</em> </td><td>- destination bitvector </td></tr>
392
<tr><td valign="top"></td><td valign="top"><em>first</em> </td><td>- first element of the iterated sequence </td></tr>
393
<tr><td valign="top"></td><td valign="top"><em>last</em> </td><td>- last element of the iterated sequence </td></tr>
398
Definition at line <a class="el" href="a00103.html#l00836">836</a> of file <a class="el" href="a00103.html">bmalgo.h</a>.
400
References <a class="el" href="a00105.html#l00014">BM_ASSERT</a>, and <a class="el" href="a00105.html#l00057">BMGAP_PTR</a>. </td>
403
<hr size="1"><address style="align: right;"><small>Generated on Thu Apr 20 13:29:10 2006 for BitMagic by
38
Class for decoding data from memory buffer.
40
Properly handles aligment issues with integer data types. Converts data to little endian architecture (presumed it was encoded as big endian)
44
Definition at line <a class="el" href="a00145.html#l00114">114</a> of file <a class="el" href="a00145.html">encoding.h</a>.<hr><h2>Constructor & Destructor Documentation</h2>
45
<a class="anchor" name="a0" doxytag="bm::decoder_little_endian::decoder_little_endian"></a><p>
46
<table class="mdTable" cellpadding="2" cellspacing="0">
49
<table cellpadding="0" cellspacing="0" border="0">
51
<td class="md" nowrap valign="top">bm::decoder_little_endian::decoder_little_endian </td>
52
<td class="md" valign="top">( </td>
53
<td class="md" nowrap valign="top">const unsigned char * </td>
54
<td class="mdname1" valign="top" nowrap> <em>buf</em> </td>
55
<td class="md" valign="top"> ) </td>
56
<td class="md" nowrap><code> [inline]</code></td>
62
<table cellspacing="5" cellpadding="0" border="0">
72
Definition at line <a class="el" href="a00145.html#l00323">323</a> of file <a class="el" href="a00145.html">encoding.h</a>. </td>
75
<hr><h2>Member Function Documentation</h2>
76
<a class="anchor" name="a4" doxytag="bm::decoder_little_endian::get_16"></a><p>
77
<table class="mdTable" cellpadding="2" cellspacing="0">
80
<table cellpadding="0" cellspacing="0" border="0">
82
<td class="md" nowrap valign="top">void bm::decoder_little_endian::get_16 </td>
83
<td class="md" valign="top">( </td>
84
<td class="md" nowrap valign="top"><a class="el" href="a00129.html#a28">bm::short_t</a> * </td>
85
<td class="mdname" nowrap> <em>s</em>, </td>
88
<td class="md" nowrap align="right"></td>
90
<td class="md" nowrap>unsigned </td>
91
<td class="mdname" nowrap> <em>count</em></td>
95
<td class="md">) </td>
96
<td class="md" colspan="2"><code> [inline]</code></td>
102
<table cellspacing="5" cellpadding="0" border="0">
112
Definition at line <a class="el" href="a00145.html#l00363">363</a> of file <a class="el" href="a00145.html">encoding.h</a>.
114
References <a class="el" href="a00145.html#l00075">bm::decoder_base::seek()</a>. </td>
117
<a class="anchor" name="a1" doxytag="bm::decoder_little_endian::get_16"></a><p>
118
<table class="mdTable" cellpadding="2" cellspacing="0">
121
<table cellpadding="0" cellspacing="0" border="0">
123
<td class="md" nowrap valign="top">BMFORCEINLINE <a class="el" href="a00129.html#a28">bm::short_t</a> bm::decoder_little_endian::get_16 </td>
124
<td class="md" valign="top">( </td>
125
<td class="mdname1" valign="top" nowrap> </td>
126
<td class="md" valign="top"> ) </td>
127
<td class="md" nowrap></td>
133
<table cellspacing="5" cellpadding="0" border="0">
143
Definition at line <a class="el" href="a00145.html#l00328">328</a> of file <a class="el" href="a00145.html">encoding.h</a>.
145
References <a class="el" href="a00140.html#l00079">BMFORCEINLINE</a>. </td>
148
<a class="anchor" name="a3" doxytag="bm::decoder_little_endian::get_32"></a><p>
149
<table class="mdTable" cellpadding="2" cellspacing="0">
152
<table cellpadding="0" cellspacing="0" border="0">
154
<td class="md" nowrap valign="top">void bm::decoder_little_endian::get_32 </td>
155
<td class="md" valign="top">( </td>
156
<td class="md" nowrap valign="top"><a class="el" href="a00129.html#a27">bm::word_t</a> * </td>
157
<td class="mdname" nowrap> <em>w</em>, </td>
160
<td class="md" nowrap align="right"></td>
162
<td class="md" nowrap>unsigned </td>
163
<td class="mdname" nowrap> <em>count</em></td>
167
<td class="md">) </td>
168
<td class="md" colspan="2"><code> [inline]</code></td>
174
<table cellspacing="5" cellpadding="0" border="0">
184
Definition at line <a class="el" href="a00145.html#l00343">343</a> of file <a class="el" href="a00145.html">encoding.h</a>.
186
References <a class="el" href="a00145.html#l00075">bm::decoder_base::seek()</a>. </td>
189
<a class="anchor" name="a2" doxytag="bm::decoder_little_endian::get_32"></a><p>
190
<table class="mdTable" cellpadding="2" cellspacing="0">
193
<table cellpadding="0" cellspacing="0" border="0">
195
<td class="md" nowrap valign="top">BMFORCEINLINE <a class="el" href="a00129.html#a27">bm::word_t</a> bm::decoder_little_endian::get_32 </td>
196
<td class="md" valign="top">( </td>
197
<td class="mdname1" valign="top" nowrap> </td>
198
<td class="md" valign="top"> ) </td>
199
<td class="md" nowrap></td>
205
<table cellspacing="5" cellpadding="0" border="0">
215
Definition at line <a class="el" href="a00145.html#l00335">335</a> of file <a class="el" href="a00145.html">encoding.h</a>.
217
References <a class="el" href="a00140.html#l00079">BMFORCEINLINE</a>. </td>
220
<hr>The documentation for this class was generated from the following file:<ul>
221
<li><a class="el" href="a00145.html">encoding.h</a></ul>
222
<hr size="1"><address style="align: right;"><small>Generated on Sun Aug 5 14:12:41 2007 for BitMagic by
404
223
<a href="http://www.doxygen.org/index.html">
405
224
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.1 </small></address>