Example of how to use bm::str_sparse_vector<> - succinct container for bit-transposed string collections
#include <iostream>
#include <string>
#include <vector>
#include <cassert>
using namespace std;
{
try
{
const char* s0 = "asz1234";
std::string str1 = "aqw1234";
std::string str3 = "54z";
std::string str00 = "00";
std::cout <<
"sv size()=" << str_sv.
size() << endl;
{
}
{
const char* s = str_sv[i];
cout << i << ":" << s << endl;
}
cout << "----" << endl;
{
for (; it != it_end; ++it)
{
cout << *it << endl;
}
}
std::string s;
bool found = str_sv2.
try_get(0, s);
assert(!found); (void)found;
assert(found);
std::cout << s << std::endl;
{
{
cout << "NULL, ";
else
cout << *it << ", ";
}
cout << endl;
}
}
catch(std::exception& ex)
{
std::cerr << ex.what() << std::endl;
return 1;
}
return 0;
}
Compressed bit-vector bvector<> container, set algebraic methods, traversal iterators.
#define BM_DECLARE_TEMP_BLOCK(x)
string sparse vector based on bit-transposed matrix
pre-processor un-defines to avoid global space pollution (internal)
Bitvector Bit-vector container with runtime compression of bits.
Const iterator to do quick traverse of the sparse vector.
bool is_null() const BMNOEXCEPT
Get NULL status.
void go_to(size_type pos) BMNOEXCEPT
re-position to a specified position
bool valid() const BMNOEXCEPT
Returns true if iterator is at a valid position.
succinct sparse vector for strings with compression using bit-slicing ( transposition) method
void insert(size_type idx, const value_type *str)
insert the specified element
const_iterator end() const BMNOEXCEPT
Provide const iterator access to the end
void optimize(bm::word_t *temp_block=0, typename bvector_type::optmode opt_mode=bvector_type::opt_compress, typename str_sparse_vector< CharType, BV, STR_SIZE >::statistics *stat=0)
run memory optimization for all vector planes
void assign(size_type idx, const StrType &str)
set specified element with bounds checking and automatic resize
size_type size() const
return size of the vector
const_iterator begin() const BMNOEXCEPT
Provide const iterator access to container content
void push_back(const StrType &str)
push back a string
bool try_get(size_type idx, StrType &str) const
get specified string element if NOT NULL Template method expects an STL-compatible type basic_string<...
void erase(size_type idx)
erase the specified element
void push_back_null(size_type count)
push back specified amount of NULL values
void set(size_type idx, const value_type *str)
set specified element with bounds checking and automatic resize
bvector_type::size_type size_type
@ use_null
support "non-assigned" or "NULL" logic
bm::str_sparse_vector< char, bvector_type, 32 > str_sv_type