|
BitMagic-C++
|
| bm.h | Compressed bit-vector bvector<> container, set algebraic methods, traversal iterators |
| bmaggregator.h | Algorithms for fast aggregation of N bvectors |
| bmalgo.h | Algorithms for bvector<> (main include) |
| bmalgo_impl.h | Algorithms for bvector<> |
| bmalgo_similarity.h | |
| bmalloc.h | Default SIMD friendly allocator |
| bmbmatrix.h | Basic bit-matrix class and utilities |
| bmconst.h | Constants, tables and typedefs |
| bmdef.h | Definitions(internal) |
| bmfunc.h | Bit manipulation primitives (internal) |
| bmgamma.h | Elias Gamma Utils used for compact serialization (internal) |
| bmrandom.h | Generation of random subset |
| bmserial.h | Serialization / compression of bvector<>. Set theoretical operations on compressed BLOBs |
| bmsimd.h | SIMD target version definitions |
| bmsparsevec.h | Sparse constainer sparse_vector<> for integer types using bit-transposition transform |
| bmsparsevec_algo.h | Algorithms for sparse_vector<> |
| bmsparsevec_compr.h | Compressed sparse container rsc_sparse_vector<> for integer types |
| bmsparsevec_serial.h | Serialization for sparse_vector<> |
| bmsparsevec_util.h | |
| bmsse2.h | Compute functions for SSE2 SIMD instruction set (internal) |
| bmsse4.h | Compute functions for SSE4.2 SIMD instruction set (internal) |
| bmsse_util.h | Compute functions for SSE SIMD instruction set (internal) |
| bmstrsparsevec.h | String sparse vector based on bit-transposed matrix |
| bmtimer.h | Timing utilities for benchmarking (internal) |
| bmtrans.h | Utilities for bit transposition (internal) (experimental!) |
| bmundef.h | Pre-processor un-defines to avoid global space pollution (internal) |
| bmutil.h | Bit manipulation primitives (internal) |
| bmvmin.h | Mini bitset for testing and utility purposes (internal) |
| bvsample01_64.cpp | Example: how to use 64-bit mode |
| bvsetalgebra.cpp | Example: algebra of sets operations |
| encoding.h | Encoding utilities for serialization (internal) |
| rscsample01.cpp | Example: rsc_sparse_vector<> usage |
| sample1.cpp | Example: bvector<> set bits and then retrieve indexes of ON bits |
| sample10.cpp | Example: bvector<> generation of random sub-set |
| sample11.cpp | Example: bvector<> bit-counting techniques analysis |
| sample12.cpp | Example: bvector<> analysis of bit setting methods |
| sample14.cpp | Example: bvector<> set operations on serialized/compressed BLOBs |
| sample15.cpp | Example: bvector<> methods to find last bit and bit-vectors effective range |
| sample16.cpp | Example: how to use bm::aggregator<> for logical operations |
| sample17.cpp | Example: rank and select operations using rank-select index |
| sample18.cpp | Example: bulk insert iterator |
| sample19.cpp | Example: bit-vector merge |
| sample2.cpp | Example: bvector<> set algebra operations AND, OR, XOR, etc |
| sample20.cpp | Example: bvector<> - bit-shifts |
| sample21.cpp | Example: bvector<> - bit-shifts |
| sample3.cpp | Example: bvector<> with different allocation/compression strategies |
| sample4.cpp | Example: bvector<> serialization/deserialization |
| sample5.cpp | Example: bvector<>::enumerator use |
| sample6.cpp | Example: bvector<> custom memory allocator |
| sample7.cpp | Example: set operations between bvector<> and arrays of integers |
| sample8.cpp | Example: bvector<> - STL interoperability |
| sample9.cpp | Example: bvector<> binary similarity / distance algorithms |
| strsvsample01.cpp | Example: str_sparse_vector<> set values, optimize memory |
| strsvsample02.cpp | Example: str_sparse_vector<> insertion sort example |
| strsvsample03.cpp | |
| svsample01.cpp | Example: sparse_vector<> container set values |
| svsample02.cpp | Example: sparse_vector<> serialization |
| svsample03.cpp | Example: sparse_vector<> merge and fast extraction of content |
| svsample04.cpp | Example: sparse_vector<> with NULL (unset) values |
| svsample05.cpp | Example: sparse_vector<> used for set 2 set remapping (theory of groups Image) |
| svsample06.cpp | Example: sparse_vector<> scan search (non-ordered set functionality) |
| svsample07.cpp | Example: sparse_vector<> lower bound search |
| xsample01.cpp | Example: Example: memory consumption techniques |
| xsample02.cpp | Example: sparse_vector<> used for counting sort / historgam construction |
| xsample03.cpp | Example: SNP search in human genome |
| xsample04.cpp | Example: DNA substring search |
| xsample04a.cpp | Example: DNA index construction |
| xsample05.cpp | Example: Example on how to use bit-transposed string sparse vector |
1.8.13