BitMagic-C++
Data Structures | Public Types | Public Member Functions | Data Fields | Protected Types | Protected Member Functions | Friends
bm::sparse_vector< Val, BV > Class Template Reference

succinct sparse vector with runtime compression using bit transposition method More...

#include <bmsparsevec.h>

Inheritance diagram for bm::sparse_vector< Val, BV >:
Inheritance graph
[legend]
Collaboration diagram for bm::sparse_vector< Val, BV >:
Collaboration graph
[legend]

Data Structures

class  back_insert_iterator
 Back insert iterator implements buffered insert, faster than generic access assignment. More...
 
class  const_iterator
 Const iterator to traverse the sparse vector. More...
 
struct  is_remap_support
 
struct  is_rsc_support
 
class  reference
 Reference class to access elements via common [] operator. More...
 
struct  statistics
 

Public Types

typedef Val value_type
 
typedef BV bvector_type
 
typedef bvector_typebvector_type_ptr
 
typedef bvector_type::size_type size_type
 
typedef bvector_type::block_idx_type block_idx_type
 
typedef const bvector_typebvector_type_const_ptr
 
typedef const value_typeconst_reference
 
typedef BV::allocator_type allocator_type
 
typedef bvector_type::allocation_policy allocation_policy_type
 
typedef bvector_type::enumerator bvector_enumerator_type
 
typedef allocator_type::allocator_pool_type allocator_pool_type
 
typedef bm::basic_bmatrix< BV > bmatrix_type
 
typedef base_sparse_vector< Val, BV, 1 > parent_type
 
- Public Types inherited from bm::base_sparse_vector< Val, BV, 1 >
enum  bit_planes
 
enum  vector_capacity
 
typedef Val value_type
 
typedef BV bvector_type
 
typedef BV::size_type size_type
 
typedef bvector_typebvector_type_ptr
 
typedef const bvector_typebvector_type_const_ptr
 
typedef const value_typeconst_reference
 
typedef BV::allocator_type allocator_type
 
typedef bvector_type::allocation_policy allocation_policy_type
 
typedef bvector_type::enumerator bvector_enumerator_type
 
typedef allocator_type::allocator_pool_type allocator_pool_type
 
typedef bm::basic_bmatrix< BV > bmatrix_type
 

Public Member Functions

void swap (sparse_vector< Val, BV > &sv) BMNOEXCEPT
 content exchange More...
 
void set_allocator_pool (allocator_pool_type *pool_ptr) BMNOEXCEPT
 Set allocator pool for local (non-threaded) memory cyclic(lots of alloc-free ops) opertations. More...
 
Construction and assignment <br>
 sparse_vector (bm::null_support null_able=bm::no_null, allocation_policy_type ap=allocation_policy_type(), size_type bv_max_size=bm::id_max, const allocator_type &alloc=allocator_type())
 Sparse vector constructor. More...
 
 sparse_vector (const sparse_vector< Val, BV > &sv)
  More...
 
sparse_vector< Val, BV > & operator= (const sparse_vector< Val, BV > &sv)
  More...
 
 sparse_vector (sparse_vector< Val, BV > &&sv) BMNOEXCEPT
  More...
 
sparse_vector< Val, BV > & operator= (sparse_vector< Val, BV > &&sv) BMNOEXCEPT
  More...
 
 ~sparse_vector () BMNOEXCEPT
 
Element access
reference operator[] (size_type idx) BMNOEXCEPT
 Operator to get write access to an element
More...
 
value_type operator[] (size_type idx) const BMNOEXCEPT
 get specified element without bounds checking More...
 
value_type at (size_type idx) const
 access specified element with bounds checking More...
 
value_type get (size_type idx) const BMNOEXCEPT
 get specified element without bounds checking More...
 
void set (size_type idx, value_type v)
 set specified element with bounds checking and automatic resize More...
 
void inc (size_type idx)
 increment specified element by one More...
 
void push_back (value_type v)
 push value back into vector More...
 
void push_back_null (size_type count)
 push back specified amount of NULL values More...
 
void insert (size_type idx, value_type v)
 insert specified element into container More...
 
void erase (size_type idx)
 erase specified element from container More...
 
void clear (size_type idx, bool set_null)
 clear specified element with bounds checking and automatic resize More...
 
Iterator access
const_iterator begin () const BMNOEXCEPT
 Provide const iterator access to container content
More...
 
const_iterator end () const BMNOEXCEPT
 Provide const iterator access to the end
More...
 
const_iterator get_const_iterator (size_type idx) const BMNOEXCEPT
 Get const_itertor re-positioned to specific element. More...
 
back_insert_iterator get_back_inserter ()
 Provide back insert iterator Back insert iterator implements buffered insertion, which is faster, than random access or push_back. More...
 
Loading of sparse vector from C-style array <br>
void import (const value_type *arr, size_type arr_size, size_type offset=0, bool set_not_null=true)
 Import list of elements from a C-style array. More...
 
void import_back (const value_type *arr, size_type arr_size, bool set_not_null=true)
 Import list of elements from a C-style array (pushed back) More...
 
Export content to C-style array <br>
size_type decode (value_type *arr, size_type idx_from, size_type dec_size, bool zero_mem=true) const
 Bulk export list of elements to a C-style array. More...
 
size_type gather (value_type *arr, const size_type *idx, size_type size, bm::sort_order sorted_idx) const
 Gather elements to a C-style array. More...
 
Clear <br>
void clear_all (bool free_mem) BMNOEXCEPT
 resize to zero, free memory More...
 
void clear () BMNOEXCEPT
 resize to zero, free memory More...
 
sparse_vector< Val, BV > & clear_range (size_type left, size_type right, bool set_null=false)
 clear range (assign bit 0 for all planes) More...
 
Size, etc <br>
size_type size () const BMNOEXCEPT
 return size of the vector More...
 
bool empty () const BMNOEXCEPT
 return true if vector is empty More...
 
void resize (size_type sz)
 resize vector More...
 
void sync_size () BMNOEXCEPT
 recalculate size to exclude tail NULL elements After this call size() will return the true size of the vector More...
 
Comparison <br>
bool equal (const sparse_vector< Val, BV > &sv, bm::null_support null_able=bm::use_null) const BMNOEXCEPT
 check if another sparse vector has the same content and size More...
 
Element comparison <br>
int compare (size_type idx, const value_type val) const BMNOEXCEPT
 Compare vector element with argument. More...
 
Memory optimization <br>
void optimize (bm::word_t *temp_block=0, typename bvector_type::optmode opt_mode=bvector_type::opt_compress, typename sparse_vector< Val, BV >::statistics *stat=0)
 run memory optimization for all vector planes More...
 
void optimize_gap_size ()
 Optimize sizes of GAP blocks. More...
 
void calc_stat (struct sparse_vector< Val, BV >::statistics *st) const BMNOEXCEPT
 Calculates memory statistics. More...
 
Merge, split, partition data <br>
sparse_vector< Val, BV > & join (const sparse_vector< Val, BV > &sv)
 join all with another sparse vector using OR operation More...
 
sparse_vector< Val, BV > & merge (sparse_vector< Val, BV > &sv)
 merge with another sparse vector using OR operation Merge is different from join(), because it borrows data from the source vector, so it gets modified. More...
 
void copy_range (const sparse_vector< Val, BV > &sv, size_type left, size_type right, bm::null_support splice_null=bm::use_null)
 copy range of values from another sparse vector More...
 
void keep_range (size_type left, size_type right, bm::null_support splice_null=bm::use_null)
 Keep only specified interval in the sparse vector, clear all other elements. More...
 
void filter (const bvector_type &bv_mask)
 Apply value filter, defined by mask vector. More...
 
- Public Member Functions inherited from bm::base_sparse_vector< Val, BV, 1 >
 base_sparse_vector ()
 
 base_sparse_vector (bm::null_support null_able, allocation_policy_type ap, size_type bv_max_size, const allocator_type &alloc)
 
 base_sparse_vector (const base_sparse_vector< Val, BV, MAX_SIZE > &bsv)
 
 base_sparse_vector (base_sparse_vector< Val, BV, MAX_SIZE > &&bsv) BMNOEXCEPT
  More...
 
void swap (base_sparse_vector< Val, BV, MAX_SIZE > &bsv) BMNOEXCEPT
 
size_type size () const BMNOEXCEPT
 
void resize (size_type new_size)
 
void clear_range (size_type left, size_type right, bool set_null)
 
void keep_range_no_check (size_type left, size_type right, bm::null_support splice_null)
 
void clear_all (bool free_mem=true) BMNOEXCEPT
 resize to zero, free memory More...
 
bool empty () const BMNOEXCEPT
  More...
 
void optimize (bm::word_t *temp_block=0, typename bvector_type::optmode opt_mode=bvector_type::opt_compress, typename bvector_type::statistics *stat=0)
 run memory optimization for all bit-vector rows More...
 
void calc_stat (typename bvector_type::statistics *st) const BMNOEXCEPT
 Calculates memory statistics. More...
 
bool equal (const base_sparse_vector< Val, BV, MAX_SIZE > &sv, bm::null_support null_able=bm::use_null) const BMNOEXCEPT
 check if another sparse vector has the same content and size More...
 
bool is_nullable () const BMNOEXCEPT
 check if container supports NULL(unassigned) values More...
 
bm::null_support get_null_support () const BMNOEXCEPT
 check if container supports NULL(unassigned) values More...
 
const bvector_typeget_null_bvector () const BMNOEXCEPT
 Get bit-vector of assigned values or NULL (if not constructed that way) More...
 
bool is_null (size_type idx) const BMNOEXCEPT
 test if specified element is NULL More...
 
bvector_type_ptr get_plane (unsigned i)
 get access to bit-plane, function checks and creates a plane More...
 
bvector_type_const_ptr get_plane (unsigned i) const BMNOEXCEPT
 get read-only access to bit-plane More...
 
unsigned effective_planes () const BMNOEXCEPT
 Number of effective bit-planes in the value type. More...
 
bvector_type_ptr plane (unsigned i) BMNOEXCEPT
 get access to bit-plane as is (can return NULL) More...
 
bvector_type_const_ptr plane (unsigned i) const BMNOEXCEPT
 
bvector_typeget_null_bvect ()
 
void free_plane (unsigned i)
 free memory in bit-plane More...
 
bm::id64_t get_planes_mask (unsigned element_idx) const BMNOEXCEPT
  More...
 
const bmatrix_typeget_bmatrix () const BMNOEXCEPT
  More...
 
bmatrix_typeget_bmatrix () BMNOEXCEPT
 access to internal bit-matrix More...
 

Data Fields

friend const_iterator
 
friend back_insert_iterator
  More...
 

Protected Types

enum  octet_planes { sv_octet_planes = sizeof(value_type) }
 
enum  buf_size_e { n_buf_size = 1024 * 8 }
 
typedef bm::heap_matrix< unsigned char, sizeof(value_type), 256, typename bvector_type::allocator_typeremap_matrix_type
 unused remap matrix type for compatibility with the sparse serializer More...
 
- Protected Types inherited from bm::base_sparse_vector< Val, BV, 1 >
typedef bvector_type::block_idx_type block_idx_type
 

Protected Member Functions

void set_value (size_type idx, value_type v)
 set value without checking boundaries More...
 
void set_value_no_null (size_type idx, value_type v)
 set value without checking boundaries or support of NULL More...
 
void push_back_no_null (value_type v)
 push value back into vector without NULL semantics More...
 
void insert_value (size_type idx, value_type v)
 insert value without checking boundaries More...
 
void insert_value_no_null (size_type idx, value_type v)
 insert value without checking boundaries or support of NULL More...
 
void resize_internal (size_type sz)
  More...
 
size_type size_internal () const BMNOEXCEPT
  More...
 
bool is_remap () const BMNOEXCEPT
 
size_t remap_size () const BMNOEXCEPT
 
const unsigned char * get_remap_buffer () const BMNOEXCEPT
 
unsigned char * init_remap_buffer () BMNOEXCEPT
 
void set_remap () BMNOEXCEPT
 
const remap_matrix_typeget_remap_matrix () const
 
remap_matrix_typeget_remap_matrix ()
 
bool resolve_range (size_type from, size_type to, size_type *idx_from, size_type *idx_to) const BMNOEXCEPT
 
void inc_no_null (size_type idx)
 Increment element by 1 without chnaging NULL vector or size. More...
 
void inc_no_null (size_type idx, value_type v)
 increment by v without chnaging NULL vector or size More...
 
- Protected Member Functions inherited from bm::base_sparse_vector< Val, BV, 1 >
void copy_from (const base_sparse_vector< Val, BV, MAX_SIZE > &bsv)
 
void merge_matr (bmatrix_type &bmatr, unsigned psize)
 Merge plane bvectors from an outside base matrix Note: outside base matrix gets destroyed. More...
 
void clear_value_planes_from (unsigned plane_idx, size_type idx)
  More...
 
void insert_clear_value_planes_from (unsigned plane_idx, size_type idx)
  More...
 
void erase_column (size_type idx)
  More...
 
void insert_null (size_type idx, bool not_null)
  More...
 
void optimize_block (block_idx_type nb)
 optimize block in all matrix planes More...
 
void copy_range_planes (const base_sparse_vector< Val, BV, MAX_SIZE > &bsv, typename base_sparse_vector< Val, BV, MAX_SIZE >::size_type left, typename base_sparse_vector< Val, BV, MAX_SIZE >::size_type right, bm::null_support splice_null)
 Perform copy_range() on a set of planes. More...
 

Friends

template<class V , class SV >
class rsc_sparse_vector
 
template<class SVect >
class sparse_vector_scanner
 
template<class SVect >
class sparse_vector_serializer
 
template<class SVect >
class sparse_vector_deserializer
 

Various traits <br>

void set_null (size_type idx)
 set specified element to unassigned value (NULL) More...
 
static bool is_compressed () BMNOEXCEPT
 trait if sparse vector is "compressed" (false) More...
 

Access to internals <br>

void sync (bool)
 syncronize internal structures, build fast access index More...
 
size_type extract (value_type *arr, size_type size, size_type offset=0, bool zero_mem=true) const BMNOEXCEPT2
 Bulk export list of elements to a C-style array. More...
 
size_type extract_range (value_type *arr, size_type size, size_type offset, bool zero_mem=true) const
 extract small window without use of masking vector More...
 
size_type extract_planes (value_type *arr, size_type size, size_type offset, bool zero_mem=true) const
 extract medium window without use of masking vector More...
 
size_type effective_size () const BMNOEXCEPT
 size of sparse vector (may be different for RSC) More...
 
size_type effective_vector_max () const BMNOEXCEPT
 Always 1 (non-matrix type) More...
 
static size_type translate_address (size_type i) BMNOEXCEPT
 address translation for this type of container More...
 
static void throw_range_error (const char *err_msg)
 throw range error More...
 
static void throw_bad_alloc ()
 throw bad alloc More...
 
static bool find_rank (size_type rank, size_type &pos) BMNOEXCEPT
 find position of compressed element by its rank More...
 

Additional Inherited Members

- Static Public Member Functions inherited from bm::base_sparse_vector< Val, BV, 1 >
static unsigned planes () BMNOEXCEPT
 get total number of bit-planes in the vector More...
 
static unsigned stored_planes () BMNOEXCEPT
 Number of stored bit-planes (value planes + extra. More...
 
- Static Protected Member Functions inherited from bm::base_sparse_vector< Val, BV, 1 >
static unsigned value_bits () BMNOEXCEPT
 Number of total bit-planes in the value type. More...
 
static unsigned null_plane () BMNOEXCEPT
 plane index for the "NOT NULL" flags plane More...
 
- Protected Attributes inherited from bm::base_sparse_vector< Val, BV, 1 >
bmatrix_type bmatr_
 bit-transposed matrix More...
 
size_type size_
 array size More...
 
unsigned effective_planes_
 

Detailed Description

template<class Val, class BV>
class bm::sparse_vector< Val, BV >

succinct sparse vector with runtime compression using bit transposition method

Sparse vector implements variable bit-depth storage model. Initial data is bit-transposed into bit-planes so each element may use less memory than the original native data type prescribes. For example, 32-bit integer may only use 20 bits.

Another level of compression is provided by bit-vector (BV template parameter) used for storing bit planes. bvector<> implements varians of on the fly block compression, so if a significant area of a sparse vector uses less bits - it will save memory.

Overall it provides variable bit-depth compression, sparse compression in bit-planes.

Examples
inv_list.cpp, rscsample01.cpp, rscsample02.cpp, rscsample03.cpp, rscsample04.cpp, rscsample05.cpp, svsample01.cpp, svsample02.cpp, svsample03.cpp, svsample04.cpp, svsample05.cpp, svsample06.cpp, svsample07.cpp, svsample08.cpp, svsample09.cpp, xsample01.cpp, xsample02.cpp, xsample03.cpp, xsample06.cpp, xsample07.cpp, xsample08.cpp, and xsample09.cpp.

Definition at line 81 of file bmsparsevec.h.

Member Typedef Documentation

◆ remap_matrix_type

template<class Val , class BV >
typedef bm::heap_matrix<unsigned char, sizeof(value_type), 256, typename bvector_type::allocator_type> bm::sparse_vector< Val, BV >::remap_matrix_type
protected

unused remap matrix type for compatibility with the sparse serializer

Definition at line 925 of file bmsparsevec.h.

Member Enumeration Documentation

◆ buf_size_e

template<class Val , class BV >
enum bm::sparse_vector::buf_size_e
protected
Enumerator
n_buf_size 

Definition at line 890 of file bmsparsevec.h.

◆ octet_planes

template<class Val , class BV >
enum bm::sparse_vector::octet_planes
protected
Enumerator
sv_octet_planes 

Definition at line 886 of file bmsparsevec.h.

Constructor & Destructor Documentation

◆ sparse_vector() [1/3]

template<class Val , class BV >
bm::sparse_vector< Val, BV >::sparse_vector ( bm::null_support  null_able = bm::no_null,
allocation_policy_type  ap = allocation_policy_type(),
size_type  bv_max_size = bm::id_max,
const allocator_type alloc = allocator_type() 
)

Sparse vector constructor.

Parameters
null_able- defines if vector supports NULL values flag by default it is OFF, use bm::use_null to enable it
ap- allocation strategy for underlying bit-vectors Default allocation policy uses BM_BIT setting (fastest access)
bv_max_size- maximum possible size of underlying bit-vectors Please note, this is NOT size of svector itself, it is dynamic upper limit which should be used very carefully if we surely know the ultimate size
alloc- allocator for bit-vectors
See also
bvector<> container
bm::bvector<>::allocation_policy
bm::startegy

Definition at line 957 of file bmsparsevec.h.

◆ sparse_vector() [2/3]

template<class Val , class BV >
bm::sparse_vector< Val, BV >::sparse_vector ( const sparse_vector< Val, BV > &  sv)

copy-ctor

Definition at line 968 of file bmsparsevec.h.

◆ sparse_vector() [3/3]

template<class Val , class BV >
bm::sparse_vector< Val, BV >::sparse_vector ( sparse_vector< Val, BV > &&  sv)

move-ctor

Definition at line 976 of file bmsparsevec.h.

Member Function Documentation

◆ at()

template<class Val , class BV >
sparse_vector< Val, BV >::value_type bm::sparse_vector< Val, BV >::at ( size_type  idx) const

access specified element with bounds checking

Parameters
idx- element index
Returns
value of the element
Examples
svsample01.cpp, and svsample03.cpp.

Definition at line 1482 of file bmsparsevec.h.

Referenced by main(), and print_svector().

◆ begin()

template<class Val , class BV >
sparse_vector< Val, BV >::const_iterator bm::sparse_vector< Val, BV >::begin

Provide const iterator access to container content

Definition at line 1959 of file bmsparsevec.h.

Referenced by build_vector_pairs(), compare_sv_it(), and main().

◆ calc_stat()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::calc_stat ( struct sparse_vector< Val, BV >::statistics st) const

Calculates memory statistics.

Function fills statistics structure containing information about how this vector uses memory and estimation of max. amount of memory bvector needs to serialize itself.

Parameters
st- pointer on statistics structure to be filled in.
See also
statistics

Definition at line 1776 of file bmsparsevec.h.

References BM_ASSERT.

Referenced by main().

◆ clear() [1/2]

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::clear ( )
inline

resize to zero, free memory

Definition at line 616 of file bmsparsevec.h.

References bm::sparse_vector< Val, BV >::clear_all().

◆ clear() [2/2]

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::clear ( size_type  idx,
bool  set_null 
)

clear specified element with bounds checking and automatic resize

Parameters
idx- element index
set_null- if true the value receives NULL (unassigned) value

Definition at line 1529 of file bmsparsevec.h.

Referenced by main().

◆ clear_all()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::clear_all ( bool  free_mem)

resize to zero, free memory

Definition at line 1745 of file bmsparsevec.h.

Referenced by bm::sparse_vector< Val, BV >::clear(), and bm::sparse_vector< Val, BV >::operator=().

◆ clear_range()

template<class Val , class BV >
sparse_vector< Val, BV > & bm::sparse_vector< Val, BV >::clear_range ( size_type  left,
size_type  right,
bool  set_null = false 
)

clear range (assign bit 0 for all planes)

Parameters
left- interval start
right- interval end (closed interval)
set_null- set cleared values to unassigned (NULL)

Definition at line 1764 of file bmsparsevec.h.

◆ compare()

template<class Val , class BV >
int bm::sparse_vector< Val, BV >::compare ( size_type  idx,
const value_type  val 
) const

Compare vector element with argument.

Parameters
idx- vactor element index
val- argument to compare with
Returns
0 - equal, < 0 - vect[i] < val, >0 otherwise

Definition at line 1938 of file bmsparsevec.h.

◆ copy_range()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::copy_range ( const sparse_vector< Val, BV > &  sv,
size_type  left,
size_type  right,
bm::null_support  splice_null = bm::use_null 
)

copy range of values from another sparse vector

Copy [left..right] values from the source vector, clear everything outside the range.

Parameters
sv- source vector
left- index from in losed diapason of [left..right]
right- index to in losed diapason of [left..right]
splice_null- "use_null" copy range for NULL vector or do not copy it

Definition at line 1888 of file bmsparsevec.h.

References bm::sparse_vector< Val, BV >::size(), and bm::xor_swap().

◆ decode()

template<class Val , class BV >
sparse_vector< Val, BV >::size_type bm::sparse_vector< Val, BV >::decode ( value_type arr,
size_type  idx_from,
size_type  dec_size,
bool  zero_mem = true 
) const

Bulk export list of elements to a C-style array.

For efficiency, this is left as a low level function, it does not do any bounds checking on the target array, it will override memory and crash if you are not careful with allocation and request size.

Parameters
arr- dest array
idx_from- index in the sparse vector to export from
dec_size- decoding size (array allocation should match)
zero_mem- set to false if target array is pre-initialized with 0s to avoid performance penalty
Returns
number of actually exported elements (can be less than requested)
See also
gather
Examples
svsample03.cpp.

Definition at line 1130 of file bmsparsevec.h.

Referenced by main().

◆ effective_size()

template<class Val , class BV >
size_type bm::sparse_vector< Val, BV >::effective_size ( ) const
inline

size of sparse vector (may be different for RSC)

Definition at line 871 of file bmsparsevec.h.

References bm::sparse_vector< Val, BV >::size().

◆ effective_vector_max()

template<class Val , class BV >
size_type bm::sparse_vector< Val, BV >::effective_vector_max ( ) const
inline

Always 1 (non-matrix type)

Definition at line 876 of file bmsparsevec.h.

◆ empty()

template<class Val , class BV >
bool bm::sparse_vector< Val, BV >::empty ( ) const
inline

return true if vector is empty

Returns
true if empty

Definition at line 642 of file bmsparsevec.h.

References bm::sparse_vector< Val, BV >::size().

Referenced by bm::sparse_vector< Val, BV >::back_insert_iterator::flush(), main(), and run_benchmark().

◆ end()

template<class Val , class BV >
const_iterator bm::sparse_vector< Val, BV >::end ( ) const
inline

Provide const iterator access to the end

Definition at line 483 of file bmsparsevec.h.

References bm::sparse_vector< Val, BV >::const_iterator::const_iterator(), and bm::id_max.

Referenced by build_vector_pairs(), and main().

◆ equal()

template<class Val , class BV >
bool bm::sparse_vector< Val, BV >::equal ( const sparse_vector< Val, BV > &  sv,
bm::null_support  null_able = bm::use_null 
) const

check if another sparse vector has the same content and size

Parameters
sv- sparse vector for comparison
null_able- flag to consider NULL vector in comparison (default) or compare only value content planes
Returns
true, if it is the same

Definition at line 1949 of file bmsparsevec.h.

Referenced by main(), SDemo1(), and SDemo2().

◆ erase()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::erase ( size_type  idx)

erase specified element from container

Parameters
idx- element index

Definition at line 1626 of file bmsparsevec.h.

References BM_ASSERT.

◆ extract()

template<class Val , class BV >
sparse_vector< Val, BV >::size_type bm::sparse_vector< Val, BV >::extract ( value_type arr,
size_type  size,
size_type  offset = 0,
bool  zero_mem = true 
) const

Bulk export list of elements to a C-style array.

Use of all extract() methods is restricted. Please consider decode() for the same purpose.

Parameters
arr- dest array
size- dest size
offset- target index in the sparse vector to export from
zero_mem- set to false if target array is pre-initialized with 0s to avoid performance penalty
Returns
number of exported elements
See also
decode

Decoder functor

< target array for reverse transpose

< bit-plane mask

< SV read offset

Definition at line 1416 of file bmsparsevec.h.

References BMNOEXCEPT, BMNOEXCEPT2, BMRESTRICT, and bm::for_each_bit_range_no_check().

◆ extract_planes()

template<class Val , class BV >
sparse_vector< Val, BV >::size_type bm::sparse_vector< Val, BV >::extract_planes ( value_type arr,
size_type  size,
size_type  offset,
bool  zero_mem = true 
) const

extract medium window without use of masking vector

See also
decode

Definition at line 1371 of file bmsparsevec.h.

◆ extract_range()

template<class Val , class BV >
sparse_vector< Val, BV >::size_type bm::sparse_vector< Val, BV >::extract_range ( value_type arr,
size_type  size,
size_type  offset,
bool  zero_mem = true 
) const

◆ filter()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::filter ( const bvector_type bv_mask)

Apply value filter, defined by mask vector.

All bit-planes are ANDed against the filter mask.

Definition at line 1914 of file bmsparsevec.h.

◆ find_rank()

template<class Val , class BV >
bool bm::sparse_vector< Val, BV >::find_rank ( size_type  rank,
size_type pos 
)
static

find position of compressed element by its rank

Definition at line 1753 of file bmsparsevec.h.

References BM_ASSERT.

◆ gather()

template<class Val , class BV >
sparse_vector< Val, BV >::size_type bm::sparse_vector< Val, BV >::gather ( value_type arr,
const size_type idx,
size_type  size,
bm::sort_order  sorted_idx 
) const

Gather elements to a C-style array.

Gather collects values from different locations, for best performance feed it with sorted list of indexes.

Faster than one-by-one random access.

For efficiency, this is left as a low level function, it does not do any bounds checking on the target array, it will override memory and crash if you are not careful with allocation and request size.

Parameters
arr- dest array
idx- index list to gather elements
size- decoding index list size (array allocation should match)
sorted_idx- sort order directive for the idx array (BM_UNSORTED, BM_SORTED, BM_UNKNOWN) Sort order affects both performance and correctness(!), use BM_UNKNOWN if not sure.
Returns
number of actually exported elements (can be less than requested)
See also
decode

Definition at line 1142 of file bmsparsevec.h.

References bm::bit_block_gather_scatter(), BM_ASSERT, BM_IS_GAP, bm::BM_SORTED, bm::BM_SORTED_UNIFORM, bm::BM_UNKNOWN, bm::BM_UNSORTED, BMGAP_PTR, FULL_BLOCK_FAKE_ADDR, bm::gap_bfind(), bm::gap_test_unr(), bm::idx_arr_block_lookup_u32(), bm::idx_arr_block_lookup_u64(), bm::set_array_mask, bm::set_array_shift, bm::set_block_mask, and bm::set_block_shift.

◆ get()

template<class Val , class BV >
sparse_vector< Val, BV >::value_type bm::sparse_vector< Val, BV >::get ( size_type  idx) const

get specified element without bounds checking

Parameters
idx- element index
Returns
value of the element

Definition at line 1493 of file bmsparsevec.h.

References BM_ASSERT, and bm::id_max.

Referenced by counting_sort_naive(), sparse_vect_index::get_vector(), bm::sparse_vector< Val, BV >::operator[](), print_sorted(), raw_data_size(), and test_data().

◆ get_back_inserter()

template<class Val , class BV >
back_insert_iterator bm::sparse_vector< Val, BV >::get_back_inserter ( )
inline

Provide back insert iterator Back insert iterator implements buffered insertion, which is faster, than random access or push_back.

Definition at line 496 of file bmsparsevec.h.

References bm::sparse_vector< Val, BV >::back_insert_iterator.

Referenced by compute_historgam(), generate_DNA_vector(), generate_test_set(), main(), write_as_rsc_svector(), and write_as_svector().

◆ get_const_iterator()

template<class Val , class BV >
const_iterator bm::sparse_vector< Val, BV >::get_const_iterator ( size_type  idx) const
inline

Get const_itertor re-positioned to specific element.

Parameters
idx- position in the sparse vector

Definition at line 489 of file bmsparsevec.h.

References bm::sparse_vector< Val, BV >::const_iterator::const_iterator().

◆ import()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::import ( const value_type arr,
size_type  arr_size,
size_type  offset = 0,
bool  set_not_null = true 
)

Import list of elements from a C-style array.

Parameters
arr- source array
arr_size- source size
offset- target index in the sparse vector
set_not_null- import should register in not null vector
Examples
svsample01.cpp, and svsample03.cpp.

Definition at line 1029 of file bmsparsevec.h.

References bm::bitscan(), and bm::BM_SORTED.

Referenced by convert_bv2sv(), and main().

◆ import_back()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::import_back ( const value_type arr,
size_type  arr_size,
bool  set_not_null = true 
)

Import list of elements from a C-style array (pushed back)

Parameters
arr- source array
arr_size- source array size
set_not_null- import should register in not null vector

Definition at line 1119 of file bmsparsevec.h.

◆ inc()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::inc ( size_type  idx)

increment specified element by one

Parameters
idx- element index

Definition at line 1709 of file bmsparsevec.h.

Referenced by counting_sort(), counting_sort_parallel(), and counting_sort_subbatch().

◆ inc_no_null() [1/2]

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::inc_no_null ( size_type  idx)
protected

Increment element by 1 without chnaging NULL vector or size.

Definition at line 1722 of file bmsparsevec.h.

◆ inc_no_null() [2/2]

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::inc_no_null ( size_type  idx,
value_type  v 
)
protected

increment by v without chnaging NULL vector or size

Definition at line 1736 of file bmsparsevec.h.

◆ insert()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::insert ( size_type  idx,
value_type  v 
)

insert specified element into container

Parameters
idx- element index
v- element value

Definition at line 1568 of file bmsparsevec.h.

Referenced by insertion_sort().

◆ insert_value()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::insert_value ( size_type  idx,
value_type  v 
)
protected

insert value without checking boundaries

Definition at line 1582 of file bmsparsevec.h.

◆ insert_value_no_null()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::insert_value_no_null ( size_type  idx,
value_type  v 
)
protected

insert value without checking boundaries or support of NULL

Definition at line 1591 of file bmsparsevec.h.

References bm::bit_scan_reverse().

◆ is_compressed()

template<class Val , class BV >
static bool bm::sparse_vector< Val, BV >::is_compressed ( )
inlinestatic

trait if sparse vector is "compressed" (false)

Definition at line 513 of file bmsparsevec.h.

◆ join()

template<class Val , class BV >
sparse_vector< Val, BV > & bm::sparse_vector< Val, BV >::join ( const sparse_vector< Val, BV > &  sv)

join all with another sparse vector using OR operation

Parameters
sv- argument vector to join with
Returns
slf reference
See also
merge
Examples
svsample03.cpp.

Definition at line 1828 of file bmsparsevec.h.

References bm::base_sparse_vector< Val, BV, MAX_SIZE >::bmatr_, bm::base_sparse_vector< Val, BV, MAX_SIZE >::is_nullable(), bm::basic_bmatrix< BV >::row(), and bm::sparse_vector< Val, BV >::size().

Referenced by main().

◆ keep_range()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::keep_range ( size_type  left,
size_type  right,
bm::null_support  splice_null = bm::use_null 
)

Keep only specified interval in the sparse vector, clear all other elements.

Parameters
left- interval start
right- interval end (closed interval)
splice_null- "use_null" copy range for NULL vector or not

Definition at line 1902 of file bmsparsevec.h.

References bm::xor_swap().

◆ merge()

template<class Val , class BV >
sparse_vector< Val, BV > & bm::sparse_vector< Val, BV >::merge ( sparse_vector< Val, BV > &  sv)

merge with another sparse vector using OR operation Merge is different from join(), because it borrows data from the source vector, so it gets modified.

Parameters
sv- [in, out]argument vector to join with (vector mutates)
Returns
slf reference
See also
join

Definition at line 1867 of file bmsparsevec.h.

References bm::base_sparse_vector< Val, BV, MAX_SIZE >::bmatr_, bm::base_sparse_vector< Val, BV, MAX_SIZE >::is_nullable(), and bm::sparse_vector< Val, BV >::size().

Referenced by counting_sort_parallel().

◆ operator=() [1/2]

template<class Val , class BV >
sparse_vector<Val,BV>& bm::sparse_vector< Val, BV >::operator= ( const sparse_vector< Val, BV > &  sv)
inline

copy assignmment operator

Definition at line 371 of file bmsparsevec.h.

References bm::base_sparse_vector< Val, BV, 1 >::copy_from().

◆ operator=() [2/2]

template<class Val , class BV >
sparse_vector<Val,BV>& bm::sparse_vector< Val, BV >::operator= ( sparse_vector< Val, BV > &&  sv)
inline

move assignmment operator

Definition at line 384 of file bmsparsevec.h.

References bm::sparse_vector< Val, BV >::clear_all(), and bm::sparse_vector< Val, BV >::swap().

◆ operator[]() [1/2]

template<class Val , class BV >
reference bm::sparse_vector< Val, BV >::operator[] ( size_type  idx)
inline

Operator to get write access to an element

Definition at line 404 of file bmsparsevec.h.

◆ operator[]() [2/2]

template<class Val , class BV >
value_type bm::sparse_vector< Val, BV >::operator[] ( size_type  idx) const
inline

get specified element without bounds checking

Parameters
idx- element index
Returns
value of the element

Definition at line 412 of file bmsparsevec.h.

References bm::sparse_vector< Val, BV >::get().

◆ optimize()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::optimize ( bm::word_t temp_block = 0,
typename bvector_type::optmode  opt_mode = bvector_type::opt_compress,
typename sparse_vector< Val, BV >::statistics stat = 0 
)

run memory optimization for all vector planes

Parameters
temp_block- pre-allocated memory block to avoid unnecessary re-allocs
opt_mode- requested compression depth
stat- memory allocation statistics after optimization
Examples
svsample01.cpp, and svsample03.cpp.

Definition at line 1792 of file bmsparsevec.h.

References bm::bv_statistics::add(), and bm::bv_statistics::reset().

Referenced by compute_historgam(), convert_bv2sv(), generate_big_case(), main(), SDemo1(), SDemo2(), and write_as_svector().

◆ optimize_gap_size()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::optimize_gap_size

Optimize sizes of GAP blocks.

This method runs an analysis to find optimal GAP levels for all bit planes of the vector.

Definition at line 1811 of file bmsparsevec.h.

◆ push_back()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::push_back ( value_type  v)

push value back into vector

Parameters
v- element value
Examples
svsample04.cpp.

Definition at line 1546 of file bmsparsevec.h.

Referenced by generate_random_subset(), main(), and SDemo1().

◆ push_back_no_null()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::push_back_no_null ( value_type  v)
protected

push value back into vector without NULL semantics

Definition at line 1639 of file bmsparsevec.h.

◆ push_back_null()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::push_back_null ( size_type  count)

push back specified amount of NULL values

Parameters
count- number of NULLs to push back

Definition at line 1555 of file bmsparsevec.h.

References BM_ASSERT, and bm::id_max.

◆ resize()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::resize ( size_type  sz)
inline

resize vector

Parameters
sz- new size

Definition at line 647 of file bmsparsevec.h.

References bm::base_sparse_vector< Val, BV, 1 >::resize().

Referenced by main(), and bm::sparse_vector< Val, BV >::resize_internal().

◆ resize_internal()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::resize_internal ( size_type  sz)
inlineprotected

Definition at line 910 of file bmsparsevec.h.

References bm::sparse_vector< Val, BV >::resize().

◆ set()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::set ( size_type  idx,
value_type  v 
)

set specified element with bounds checking and automatic resize

Parameters
idx- element index
v- element value
Examples
svsample03.cpp.

Definition at line 1517 of file bmsparsevec.h.

Referenced by build_histogram(), compute_rsc_historgam(), convert_bv2sv(), counting_sort_naive(), fill_test_data(), load_snp_report(), main(), SDemo2(), test_mismatch_search(), test_sv_cmp(), and test_sv_cmp_it().

◆ set_allocator_pool()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::set_allocator_pool ( allocator_pool_type pool_ptr)

Set allocator pool for local (non-threaded) memory cyclic(lots of alloc-free ops) opertations.

Definition at line 1968 of file bmsparsevec.h.

◆ set_null()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::set_null ( size_type  idx)

set specified element to unassigned value (NULL)

Parameters
idx- element index

Definition at line 1021 of file bmsparsevec.h.

Referenced by main().

◆ set_value()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::set_value ( size_type  idx,
value_type  v 
)
protected

set value without checking boundaries

Definition at line 1648 of file bmsparsevec.h.

◆ set_value_no_null()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::set_value_no_null ( size_type  idx,
value_type  v 
)
protected

set value without checking boundaries or support of NULL

Definition at line 1659 of file bmsparsevec.h.

References bm::bit_scan_reverse(), bm::set_array_mask, bm::set_array_shift, and bm::set_block_shift.

◆ size()

template<class Val , class BV >
size_type bm::sparse_vector< Val, BV >::size ( ) const
inline

◆ size_internal()

template<class Val , class BV >
size_type bm::sparse_vector< Val, BV >::size_internal ( ) const
inlineprotected

Definition at line 911 of file bmsparsevec.h.

References bm::sparse_vector< Val, BV >::size().

◆ swap()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::swap ( sparse_vector< Val, BV > &  sv)

content exchange

Definition at line 993 of file bmsparsevec.h.

Referenced by bm::sparse_vector< Val, BV >::operator=().

◆ sync()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::sync ( bool  )
inline

syncronize internal structures, build fast access index

Definition at line 798 of file bmsparsevec.h.

◆ sync_size()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::sync_size

recalculate size to exclude tail NULL elements After this call size() will return the true size of the vector

Definition at line 1107 of file bmsparsevec.h.

◆ throw_bad_alloc()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::throw_bad_alloc
static

throw bad alloc

Definition at line 1013 of file bmsparsevec.h.

◆ throw_range_error()

template<class Val , class BV >
void bm::sparse_vector< Val, BV >::throw_range_error ( const char *  err_msg)
static

throw range error

Definition at line 1001 of file bmsparsevec.h.

References BM_ASSERT_THROW.

◆ translate_address()

template<class Val , class BV >
static size_type bm::sparse_vector< Val, BV >::translate_address ( size_type  i)
inlinestatic

address translation for this type of container

Definition at line 845 of file bmsparsevec.h.


The documentation for this class was generated from the following file: