1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>BitMagic: bmfunc.h File Reference</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.4.1 -->
<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>
<div class="nav">
<a class="el" href="dir_000000.html">src</a></div>
<h1>bmfunc.h File Reference</h1><code>#include <memory.h></code><br>
<p>
Include dependency graph for bmfunc.h:<p><center><img src="a00136.png" border="0" usemap="#bmfunc.h_map" alt=""></center>
<p>
This graph shows which files directly or indirectly include this file:<p><center><img src="a00137.png" border="0" usemap="#bmfunc.hdep_map" alt=""></center>
<map name="bmfunc.hdep_map">
<area href="a00074.html" shape="rect" coords="132,192,172,214" alt="">
<area href="a00075.html" shape="rect" coords="232,6,296,27" alt="">
<area href="a00091.html" shape="rect" coords="356,30,444,51" alt="">
<area href="a00083.html" shape="rect" coords="221,102,307,123" alt="">
<area href="a00084.html" shape="rect" coords="221,147,307,168" alt="">
<area href="a00085.html" shape="rect" coords="220,192,308,214" alt="">
<area href="a00086.html" shape="rect" coords="221,238,307,259" alt="">
<area href="a00087.html" shape="rect" coords="220,283,308,304" alt="">
<area href="a00088.html" shape="rect" coords="221,328,307,350" alt="">
<area href="a00089.html" shape="rect" coords="221,374,307,395" alt="">
<area href="a00090.html" shape="rect" coords="220,419,308,440" alt="">
</map>
<p>
<a href="a00106.html">Go to the source code of this file.</a><table border="0" cellpadding="0" cellspacing="0">
<tr><td></td></tr>
<tr><td colspan="2"><br><h2>Namespaces</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">namespace </td><td class="memItemRight" valign="bottom"><a class="el" href="a00092.html">bm</a></td></tr>
<tr><td colspan="2"><br><h2>Defines</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">#define </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga40">BM_INCWORD_BITCOUNT</a>(cnt, w)</td></tr>
<tr><td colspan="2"><br><h2>Enumerations</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">enum </td><td class="memItemRight" valign="bottom"><a class="el" href="a00092.html#a159">operation</a> { <a class="el" href="a00092.html#a159a1">BM_AND</a> = 0,
<a class="el" href="a00092.html#a159a2">BM_OR</a>,
<a class="el" href="a00092.html#a159a3">BM_SUB</a>,
<a class="el" href="a00092.html#a159a4">BM_XOR</a>
}</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Bit operations enumeration. <a href="a00092.html#a159">More...</a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">enum </td><td class="memItemRight" valign="bottom"><a class="el" href="a00092.html#a160">ByteOrder</a> { <a class="el" href="a00092.html#a160a5">BigEndian</a> = 0,
<a class="el" href="a00092.html#a160a6">LittleEndian</a> = 1
}</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Byte orders recognized by the library. <a href="a00092.html#a160">More...</a><br></td></tr>
<tr><td colspan="2"><br><h2>Functions</h2></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a9">bm::id_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga0">word_bitcount64</a> (<a class="el" href="a00092.html#a8">bm::id64_t</a> w)</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename W> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00092.html#a48">xor_swap</a> (W &x, W &y)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">XOR swap two scalar variables. <a href="#a48"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00097.html#ga1">wordcmp0</a> (T w1, T w2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Lexicographical comparison of two words as bit strings. Auxiliary implementation for testing and reference purposes. <a href="a00097.html#ga1"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00097.html#ga2">wordcmp</a> (T a, T b)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Lexicographical comparison of two words as bit strings. Auxiliary implementation for testing and reference purposes. <a href="a00097.html#ga2"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00092.html#a51">gap_bfind</a> (const T *buf, unsigned pos, unsigned *is_set)</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga0">gap_test</a> (const T *buf, unsigned pos)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Tests if bit = pos is true. <a href="a00096.html#ga0"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<class T, class F> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00092.html#a53">for_each_nzblock</a> (T ***root, unsigned size1, unsigned size2, F &f)</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<class T, class F> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00092.html#a54">for_each_nzblock_if</a> (T ***root, unsigned size1, unsigned size2, F &f)</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<class T, class F> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00092.html#a55">for_each_block</a> (T ***root, unsigned size1, unsigned size2, F &f)</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<class T, class F> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">F </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00092.html#a56">bmfor_each</a> (T first, T last, F f)</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<class T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">T </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00092.html#a57">sum_arr</a> (T *first, T *last)</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga1">gap_bit_count</a> (const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Calculates number of bits ON in GAP buffer. <a href="a00096.html#ga1"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00092.html#a59">gap_bit_count_range</a> (const T *buf, T left, T right)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Counts 1 bits in GAP buffer in the closed [left, right] diapason. <a href="#a59"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga2">gapcmp</a> (const T *buf1, const T *buf2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Lexicographical comparison of GAP buffers. <a href="a00096.html#ga2"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T, class F> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga3">gap_buff_op</a> (T *BMRESTRICT dest, const T *BMRESTRICT vect1, unsigned vect1_mask, const T *BMRESTRICT vect2, unsigned vect2_mask, F f)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Abstract operation for GAP buffers. Receives functor F as a template argument. <a href="a00096.html#ga3"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga4">gap_set_value</a> (unsigned val, T *BMRESTRICT buf, unsigned pos, unsigned *BMRESTRICT is_set)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Abstract distance(similarity) operation for GAP buffers. Receives functor F as a template argument Sets or clears bit in the GAP buffer. <a href="a00096.html#ga4"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga5">gap_find_in_block</a> (const T *buf, unsigned nbit, <a class="el" href="a00092.html#a9">bm::id_t</a> *prev)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Searches for the next 1 bit in the GAP block. <a href="a00096.html#ga5"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga3">or_bit_block</a> (unsigned *dest, unsigned bitpos, unsigned bitcount)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sets bits to 1 in the bitblock. <a href="a00097.html#ga3"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga4">sub_bit_block</a> (unsigned *dest, unsigned bitpos, unsigned bitcount)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">SUB (AND NOT) bit interval to 1 in the bitblock. <a href="a00097.html#ga4"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga5">xor_bit_block</a> (unsigned *dest, unsigned bitpos, unsigned bitcount)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">XOR bit interval to 1 in the bitblock. <a href="a00097.html#ga5"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga6">gap_sub_to_bitset</a> (unsigned *dest, const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">SUB (AND NOT) GAP block to bitblock. <a href="a00096.html#ga6"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga7">gap_xor_to_bitset</a> (unsigned *dest, const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">XOR GAP block to bitblock. <a href="a00096.html#ga7"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga8">gap_add_to_bitset</a> (unsigned *dest, const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Adds(OR) GAP block to bitblock. <a href="a00096.html#ga8"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga9">gap_and_to_bitset</a> (unsigned *dest, const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">ANDs GAP block to bitblock. <a href="a00096.html#ga9"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<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="a00097.html#ga6">gap_bitset_and_count</a> (const unsigned *block, const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Compute bitcount of bit block AND masked by GAP block. <a href="a00097.html#ga6"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<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="a00097.html#ga7">gap_bitset_sub_count</a> (const unsigned *block, const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Compute bitcount of bit block SUB masked by GAP block. <a href="a00097.html#ga7"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<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="a00097.html#ga8">gap_bitset_xor_count</a> (const unsigned *block, const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Compute bitcount of bit block XOR masked by GAP block. <a href="a00097.html#ga8"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<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="a00097.html#ga9">gap_bitset_or_count</a> (const unsigned *block, const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Compute bitcount of bit block OR masked by GAP block. <a href="a00097.html#ga9"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga10">bit_block_set</a> (<a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT dst, <a class="el" href="a00092.html#a10">bm::word_t</a> value)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Bitblock memset operation. <a href="a00097.html#ga10"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga10">gap_convert_to_bitset</a> (unsigned *dest, const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">GAP block to bitblock conversion. <a href="a00096.html#ga10"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga11">gap_convert_to_bitset</a> (unsigned *dest, const T *buf, unsigned dest_len)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">GAP block to bitblock conversion. <a href="a00096.html#ga11"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned * </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga12">gap_convert_to_bitset_smart</a> (unsigned *dest, const T *buf, <a class="el" href="a00092.html#a9">id_t</a> set_max)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Smart GAP block to bitblock conversion. <a href="a00096.html#ga12"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga13">gap_control_sum</a> (const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Calculates sum of all words in GAP block. (For debugging purposes). <a href="a00096.html#ga13"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<class T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga14">gap_set_all</a> (T *buf, unsigned set_max, unsigned value)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sets all bits to 0 or 1 (GAP). <a href="a00096.html#ga14"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<class T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga15">gap_init_range_block</a> (T *buf, unsigned from, unsigned to, unsigned value, unsigned set_max)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Init gap block so it has block in it (can be whole block). <a href="a00096.html#ga15"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga16">gap_invert</a> (T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Inverts all bits in the GAP buffer. <a href="a00096.html#ga16"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga17">gap_is_all_zero</a> (const T *buf, unsigned set_max)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Temporary inverts all bits in the GAP buffer. Checks if GAP block is all-zero. <a href="a00096.html#ga17"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga18">gap_is_all_one</a> (const T *buf, unsigned set_max)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Checks if GAP block is all-one. <a href="a00096.html#ga18"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga19">gap_length</a> (const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returs GAP block length. <a href="a00096.html#ga19"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga20">gap_capacity</a> (const T *buf, const T *glevel_len)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returs GAP block capacity. <a href="a00096.html#ga20"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga21">gap_limit</a> (const T *buf, const T *glevel_len)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returs GAP block capacity limit. <a href="a00096.html#ga21"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga22">gap_level</a> (const T *buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returs GAP blocks capacity level. <a href="a00096.html#ga22"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga23">set_gap_level</a> (T *buf, unsigned level)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Sets GAP block capacity level. <a href="a00096.html#ga23"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga24">gap_calc_level</a> (int len, const T *glevel_len)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Calculates GAP block capacity level. <a href="a00096.html#ga24"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga25">gap_free_elements</a> (const T *buf, const T *glevel_len)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returns number of free elements in GAP block array. Difference between GAP block capacity on this level and actual GAP length. <a href="a00096.html#ga25"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">int </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00097.html#ga11">bitcmp</a> (const T *buf1, const T *buf2, unsigned len)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Lexicographical comparison of BIT buffers. <a href="a00097.html#ga11"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga26">bit_convert_to_gap</a> (T *BMRESTRICT dest, const unsigned *BMRESTRICT src, <a class="el" href="a00092.html#a9">bm::id_t</a> bits, unsigned dest_len)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Converts bit block to GAP. <a href="a00096.html#ga26"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename D, typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">D </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga27">gap_convert_to_arr</a> (D *BMRESTRICT dest, const T *BMRESTRICT buf, unsigned dest_len)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Convert gap block into array of ints corresponding to 1 bits. <a href="a00096.html#ga27"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">T </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00097.html#ga12">bit_convert_to_arr</a> (T *BMRESTRICT dest, const unsigned *BMRESTRICT src, <a class="el" href="a00092.html#a9">bm::id_t</a> bits, unsigned dest_len)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Convert bit block into an array of ints corresponding to 1 bits. <a href="a00097.html#ga12"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a9">bm::id_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga13">bit_block_calc_count</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *block, const <a class="el" href="a00092.html#a10">bm::word_t</a> *block_end)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Bitcount for bit string. <a href="a00097.html#ga13"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a9">bm::id_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga14">bit_count_change</a> (<a class="el" href="a00092.html#a10">bm::word_t</a> w)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a9">bm::id_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga15">bit_block_calc_count_change</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *block, const <a class="el" href="a00092.html#a10">bm::word_t</a> *block_end)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a9">bm::id_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga16">bit_block_calc_count_range</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *block, <a class="el" href="a00092.html#a10">bm::word_t</a> left, <a class="el" href="a00092.html#a10">bm::word_t</a> right)</td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">void </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00097.html#ga17">bit_invert</a> (T *start, T *end)</td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga18">is_bits_one</a> (const <a class="el" href="a00092.html#a31">bm::wordop_t</a> *start, const <a class="el" href="a00092.html#a31">bm::wordop_t</a> *end)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returns "true" if all bits in the block are 1. <a href="a00097.html#ga18"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga19">bit_is_all_zero</a> (const <a class="el" href="a00092.html#a31">bm::wordop_t</a> *start, const <a class="el" href="a00092.html#a31">bm::wordop_t</a> *end)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Returns "true" if all bits in the block are 0. <a href="a00097.html#ga19"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="a00092.html#a103">and_op</a> (unsigned v1, unsigned v2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">GAP and functor. <a href="#a103"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="a00092.html#a104">xor_op</a> (unsigned v1, unsigned v2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">GAP xor functor. <a href="#a104"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a19">gap_word_t</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00096.html#ga28">gap_operation_and</a> (const <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT vect1, const <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT vect2, <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT tmp_buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">GAP AND operation. <a href="a00096.html#ga28"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a19">gap_word_t</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00096.html#ga29">gap_operation_xor</a> (const <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT vect1, const <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT vect2, <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT tmp_buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">GAP XOR operation. <a href="a00096.html#ga29"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a19">gap_word_t</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00096.html#ga30">gap_operation_or</a> (const <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT vect1, const <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT vect2, <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT tmp_buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">GAP OR operation. <a href="a00096.html#ga30"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a19">gap_word_t</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00096.html#ga31">gap_operation_sub</a> (const <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT vect1, const <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT vect2, <a class="el" href="a00092.html#a19">gap_word_t</a> *BMRESTRICT tmp_buf)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">GAP SUB (AND NOT) operation. <a href="a00096.html#ga31"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga20">bit_block_copy</a> (<a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT dst, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Bitblock copy operation. <a href="a00097.html#ga20"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga21">bit_block_and</a> (<a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT dst, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Plain bitblock AND operation. Function does not analyse availability of source and destination blocks. <a href="a00097.html#ga21"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga22">bit_block_and_count</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *src1, const <a class="el" href="a00092.html#a10">bm::word_t</a> *src1_end, const <a class="el" href="a00092.html#a10">bm::word_t</a> *src2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Function ANDs two bitblocks and computes the bitcount. Function does not analyse availability of source blocks. <a href="a00097.html#ga22"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga23">bit_block_xor_count</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1_end, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Function XORs two bitblocks and computes the bitcount. Function does not analyse availability of source blocks. <a href="a00097.html#ga23"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga24">bit_block_sub_count</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1_end, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Function SUBs two bitblocks and computes the bitcount. Function does not analyse availability of source blocks. <a href="a00097.html#ga24"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga25">bit_block_or_count</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *src1, const <a class="el" href="a00092.html#a10">bm::word_t</a> *src1_end, const <a class="el" href="a00092.html#a10">bm::word_t</a> *src2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Function ORs two bitblocks and computes the bitcount. Function does not analyse availability of source blocks. <a href="a00097.html#ga25"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a10">bm::word_t</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga26">bit_operation_and</a> (<a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT dst, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">bitblock AND operation. <a href="a00097.html#ga26"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a9">bm::id_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga27">bit_operation_and_count</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1_end, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Performs bitblock AND operation and calculates bitcount of the result. <a href="a00097.html#ga27"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a9">bm::id_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga28">bit_operation_sub_count</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1_end, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Performs bitblock SUB operation and calculates bitcount of the result. <a href="a00097.html#ga28"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a9">bm::id_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga29">bit_operation_or_count</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1_end, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Performs bitblock OR operation and calculates bitcount of the result. <a href="a00097.html#ga29"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga30">bit_block_or</a> (<a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT dst, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Plain bitblock OR operation. Function does not analyse availability of source and destination blocks. <a href="a00097.html#ga30"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a10">bm::word_t</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga31">bit_operation_or</a> (<a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT dst, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Block OR operation. Makes analysis if block is 0 or FULL. <a href="a00097.html#ga31"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga32">bit_block_sub</a> (<a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT dst, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Plain bitblock SUB (AND NOT) operation. Function does not analyse availability of source and destination blocks. <a href="a00097.html#ga32"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a10">bm::word_t</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga33">bit_operation_sub</a> (<a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT dst, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">bitblock SUB operation. <a href="a00097.html#ga33"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga34">bit_block_xor</a> (<a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT dst, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Plain bitblock XOR operation. Function does not analyse availability of source and destination blocks. <a href="a00097.html#ga34"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a10">bm::word_t</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga35">bit_operation_xor</a> (<a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT dst, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">bitblock XOR operation. <a href="a00097.html#ga35"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="el" href="a00092.html#a9">bm::id_t</a> </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga36">bit_operation_xor_count</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src1_end, const <a class="el" href="a00092.html#a10">bm::word_t</a> *BMRESTRICT src2)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Performs bitblock XOR operation and calculates bitcount of the result. <a href="a00097.html#ga36"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga37">bit_find_head_tail</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *data, unsigned *head_idx, unsigned *tail_idx)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Inspects bit block for zero words at the head and at the end. <a href="a00097.html#ga37"></a><br></td></tr>
<tr><td class="memItemLeft" nowrap align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="a00097.html#ga38">bit_find_in_block</a> (const <a class="el" href="a00092.html#a10">bm::word_t</a> *data, unsigned nbit, <a class="el" href="a00092.html#a9">bm::id_t</a> *prev)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Searches for the next 1 bit in the BIT block. <a href="a00097.html#ga38"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T, typename B> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00097.html#ga39">bit_list</a> (T w, B *bits)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Unpacks word into list of ON bit indexes. <a href="a00097.html#ga39"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">unsigned </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga32">gap_overhead</a> (const T *length, const T *length_end, const T *glevel_len)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Calculates memory overhead for number of gap blocks sharing the same memory allocation table (level lengths table). <a href="a00096.html#ga32"></a><br></td></tr>
<tr><td class="memTemplParams" nowrap colspan="2">template<typename T> </td></tr>
<tr><td class="memTemplItemLeft" nowrap align="right" valign="top">bool </td><td class="memTemplItemRight" valign="bottom"><a class="el" href="a00096.html#ga33">improve_gap_levels</a> (const T *length, const T *length_end, T *glevel_len)</td></tr>
<tr><td class="mdescLeft"> </td><td class="mdescRight">Finds optimal gap blocks lengths. <a href="a00096.html#ga33"></a><br></td></tr>
</table>
<hr><h2>Enumeration Type Documentation</h2>
<a class="anchor" name="file_a160" doxytag="bmfunc.h::ByteOrder"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top">enum <a class="el" href="a00092.html#a160">bm::ByteOrder</a> </td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
Byte orders recognized by the library.
<p>
<dl compact><dt><b>Enumeration values: </b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"><em><a class="anchor" name="a160a5" doxytag="BigEndian"></a>BigEndian</em> </td><td>
</td></tr>
<tr><td valign="top"><em><a class="anchor" name="a160a6" doxytag="LittleEndian"></a>LittleEndian</em> </td><td>
</td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="a00106.html#l00307">307</a> of file <a class="el" href="a00106.html">bmfunc.h</a>. </td>
</tr>
</table>
<a class="anchor" name="file_a159" doxytag="bmfunc.h::operation"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top">enum <a class="el" href="a00092.html#a159">bm::operation</a> </td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
Bit operations enumeration.
<p>
<dl compact><dt><b>Enumeration values: </b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"><em><a class="anchor" name="a159a1" doxytag="BM_AND"></a>BM_AND</em> </td><td>
</td></tr>
<tr><td valign="top"><em><a class="anchor" name="a159a2" doxytag="BM_OR"></a>BM_OR</em> </td><td>
</td></tr>
<tr><td valign="top"><em><a class="anchor" name="a159a3" doxytag="BM_SUB"></a>BM_SUB</em> </td><td>
</td></tr>
<tr><td valign="top"><em><a class="anchor" name="a159a4" doxytag="BM_XOR"></a>BM_XOR</em> </td><td>
</td></tr>
</table>
</dl>
<p>
Definition at line <a class="el" href="a00106.html#l00197">197</a> of file <a class="el" href="a00106.html">bmfunc.h</a>. </td>
</tr>
</table>
<hr><h2>Function Documentation</h2>
<a class="anchor" name="file_a103" doxytag="bmfunc.h::and_op"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top">unsigned and_op </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top">unsigned </td>
<td class="mdname" nowrap> <em>v1</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>unsigned </td>
<td class="mdname" nowrap> <em>v2</em></td>
</tr>
<tr>
<td class="md"></td>
<td class="md">) </td>
<td class="md" colspan="2"><code> [inline]</code></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
GAP and functor.
<p>
<p>
Definition at line <a class="el" href="a00106.html#l02329">2329</a> of file <a class="el" href="a00106.html">bmfunc.h</a>. </td>
</tr>
</table>
<a class="anchor" name="file_a56" doxytag="bmfunc.h::bmfor_each"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="mdPrefix" colspan="4">
template<class T, class F> </td>
</tr>
<tr>
<td class="md" nowrap valign="top">F bmfor_each </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top">T </td>
<td class="mdname" nowrap> <em>first</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>T </td>
<td class="mdname" nowrap> <em>last</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>F </td>
<td class="mdname" nowrap> <em>f</em></td>
</tr>
<tr>
<td class="md"></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
Special BM optimized analog of STL for_each
<p>
Definition at line <a class="el" href="a00106.html#l00517">517</a> of file <a class="el" href="a00106.html">bmfunc.h</a>. </td>
</tr>
</table>
<a class="anchor" name="file_a55" doxytag="bmfunc.h::for_each_block"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="mdPrefix" colspan="4">
template<class T, class F> </td>
</tr>
<tr>
<td class="md" nowrap valign="top">void for_each_block </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top">T *** </td>
<td class="mdname" nowrap> <em>root</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>unsigned </td>
<td class="mdname" nowrap> <em>size1</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>unsigned </td>
<td class="mdname" nowrap> <em>size2</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>F & </td>
<td class="mdname" nowrap> <em>f</em></td>
</tr>
<tr>
<td class="md"></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
For each block executes supplied function.
<p>
Definition at line <a class="el" href="a00106.html#l00488">488</a> of file <a class="el" href="a00106.html">bmfunc.h</a>.
<p>
Referenced by <a class="el" href="a00103.html#l00810">bm::count_intervals()</a>, and <a class="el" href="a00102.html#l01732">bm::bvector< Alloc, MS >::invert()</a>. </td>
</tr>
</table>
<a class="anchor" name="file_a53" doxytag="bmfunc.h::for_each_nzblock"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="mdPrefix" colspan="4">
template<class T, class F> </td>
</tr>
<tr>
<td class="md" nowrap valign="top">void for_each_nzblock </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top">T *** </td>
<td class="mdname" nowrap> <em>root</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>unsigned </td>
<td class="mdname" nowrap> <em>size1</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>unsigned </td>
<td class="mdname" nowrap> <em>size2</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>F & </td>
<td class="mdname" nowrap> <em>f</em></td>
</tr>
<tr>
<td class="md"></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
For each non-zero block executes supplied function.
<p>
Definition at line <a class="el" href="a00106.html#l00437">437</a> of file <a class="el" href="a00106.html">bmfunc.h</a>.
<p>
Referenced by <a class="el" href="a00102.html#l01603">bm::bvector< Alloc, MS >::count()</a>, <a class="el" href="a00102.html#l01081">bm::bvector< Alloc, MS >::count_blocks()</a>, <a class="el" href="a00102.html#l01790">bm::bvector< Alloc, MS >::optimize()</a>, and <a class="el" href="a00102.html#l01829">bm::bvector< Alloc, MS >::set_gap_levels()</a>. </td>
</tr>
</table>
<a class="anchor" name="file_a54" doxytag="bmfunc.h::for_each_nzblock_if"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="mdPrefix" colspan="4">
template<class T, class F> </td>
</tr>
<tr>
<td class="md" nowrap valign="top">bool for_each_nzblock_if </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top">T *** </td>
<td class="mdname" nowrap> <em>root</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>unsigned </td>
<td class="mdname" nowrap> <em>size1</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>unsigned </td>
<td class="mdname" nowrap> <em>size2</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>F & </td>
<td class="mdname" nowrap> <em>f</em></td>
</tr>
<tr>
<td class="md"></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
For each non-zero block executes supplied function-predicate. Function returns if function-predicate returns true
<p>
Definition at line <a class="el" href="a00106.html#l00462">462</a> of file <a class="el" href="a00106.html">bmfunc.h</a>.
<p>
Referenced by <a class="el" href="a00102.html#l01149">bm::bvector< Alloc, MS >::any()</a>. </td>
</tr>
</table>
<a class="anchor" name="file_a51" doxytag="bmfunc.h::gap_bfind"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="mdPrefix" colspan="4">
template<typename T> </td>
</tr>
<tr>
<td class="md" nowrap valign="top">unsigned gap_bfind </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top">const T * </td>
<td class="mdname" nowrap> <em>buf</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>unsigned </td>
<td class="mdname" nowrap> <em>pos</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>unsigned * </td>
<td class="mdname" nowrap> <em>is_set</em></td>
</tr>
<tr>
<td class="md"></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
<p>
Definition at line <a class="el" href="a00106.html#l00371">371</a> of file <a class="el" href="a00106.html">bmfunc.h</a>.
<p>
References <a class="el" href="a00105.html#l00014">BM_ASSERT</a>.
<p>
Referenced by <a class="el" href="a00106.html#l00579">bm::gap_bit_count_range()</a>, <a class="el" href="a00106.html#l00935">bm::gap_find_in_block()</a>, and <a class="el" href="a00106.html#l00843">bm::gap_set_value()</a>. </td>
</tr>
</table>
<a class="anchor" name="file_a59" doxytag="bmfunc.h::gap_bit_count_range"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="mdPrefix" colspan="4">
template<typename T> </td>
</tr>
<tr>
<td class="md" nowrap valign="top">unsigned gap_bit_count_range </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top">const T * </td>
<td class="mdname" nowrap> <em>buf</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>T </td>
<td class="mdname" nowrap> <em>left</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>T </td>
<td class="mdname" nowrap> <em>right</em></td>
</tr>
<tr>
<td class="md"></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
Counts 1 bits in GAP buffer in the closed [left, right] diapason.
<p>
<dl compact><dt><b>Parameters:</b></dt><dd>
<table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"></td><td valign="top"><em>buf</em> </td><td>- GAP buffer pointer. </td></tr>
<tr><td valign="top"></td><td valign="top"><em>left</em> </td><td>- leftmost bit index to start from </td></tr>
<tr><td valign="top"></td><td valign="top"><em>right-</em> </td><td>rightmost bit index </td></tr>
</table>
</dl>
<dl compact><dt><b>Returns:</b></dt><dd>Number of non-zero bits. </dd></dl>
<p>
Definition at line <a class="el" href="a00106.html#l00579">579</a> of file <a class="el" href="a00106.html">bmfunc.h</a>.
<p>
References <a class="el" href="a00105.html#l00014">BM_ASSERT</a>, and <a class="el" href="a00106.html#l00371">bm::gap_bfind()</a>.
<p>
Referenced by <a class="el" href="a00102.html#l01638">bm::bvector< Alloc, MS >::count_range()</a>. </td>
</tr>
</table>
<a class="anchor" name="file_a57" doxytag="bmfunc.h::sum_arr"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="mdPrefix" colspan="4">
template<class T> </td>
</tr>
<tr>
<td class="md" nowrap valign="top">T sum_arr </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top">T * </td>
<td class="mdname" nowrap> <em>first</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>T * </td>
<td class="mdname" nowrap> <em>last</em></td>
</tr>
<tr>
<td class="md"></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
Computes SUM of all elements of the sequence
<p>
Definition at line <a class="el" href="a00106.html#l00529">529</a> of file <a class="el" href="a00106.html">bmfunc.h</a>. </td>
</tr>
</table>
<a class="anchor" name="file_a104" doxytag="bmfunc.h::xor_op"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="md" nowrap valign="top">unsigned xor_op </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top">unsigned </td>
<td class="mdname" nowrap> <em>v1</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>unsigned </td>
<td class="mdname" nowrap> <em>v2</em></td>
</tr>
<tr>
<td class="md"></td>
<td class="md">) </td>
<td class="md" colspan="2"><code> [inline]</code></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
GAP xor functor.
<p>
<p>
Definition at line <a class="el" href="a00106.html#l02336">2336</a> of file <a class="el" href="a00106.html">bmfunc.h</a>. </td>
</tr>
</table>
<a class="anchor" name="file_a48" doxytag="bmfunc.h::xor_swap"></a><p>
<table class="mdTable" cellpadding="2" cellspacing="0">
<tr>
<td class="mdRow">
<table cellpadding="0" cellspacing="0" border="0">
<tr>
<td class="mdPrefix" colspan="4">
template<typename W> </td>
</tr>
<tr>
<td class="md" nowrap valign="top">void xor_swap </td>
<td class="md" valign="top">( </td>
<td class="md" nowrap valign="top">W & </td>
<td class="mdname" nowrap> <em>x</em>, </td>
</tr>
<tr>
<td class="md" nowrap align="right"></td>
<td class="md"></td>
<td class="md" nowrap>W & </td>
<td class="mdname" nowrap> <em>y</em></td>
</tr>
<tr>
<td class="md"></td>
<td class="md">) </td>
<td class="md" colspan="2"></td>
</tr>
</table>
</td>
</tr>
</table>
<table cellspacing="5" cellpadding="0" border="0">
<tr>
<td>
</td>
<td>
<p>
XOR swap two scalar variables.
<p>
<p>
Definition at line <a class="el" href="a00106.html#l00231">231</a> of file <a class="el" href="a00106.html">bmfunc.h</a>.
<p>
References <a class="el" href="a00105.html#l00014">BM_ASSERT</a>.
<p>
Referenced by <a class="el" href="a00102.html#l01191">bm::bvector< Alloc, MS >::swap()</a>. </td>
</tr>
</table>
<hr size="1"><address style="align: right;"><small>Generated on Thu Apr 20 13:29:01 2006 for BitMagic by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.1 </small></address>
</body>
</html>
|
