BitMagic-C++
strsvsample04.cpp
Go to the documentation of this file.
1/*
2Copyright(c) 2002-2017 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)
3
4Licensed under the Apache License, Version 2.0 (the "License");
5you may not use this file except in compliance with the License.
6You may obtain a copy of the License at
7
8 http://www.apache.org/licenses/LICENSE-2.0
9
10Unless required by applicable law or agreed to in writing, software
11distributed under the License is distributed on an "AS IS" BASIS,
12WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13See the License for the specific language governing permissions and
14limitations under the License.
15
16For more information please visit: http://bitmagic.io
17*/
18
19/** \example strsvsample04.cpp
20 Example of how to use bm::str_sparse_vector<> - succinct container for
21 bit-transposed string collections with NULL (unassigned) values support
22
23 \sa bm::str_sparse_vector
24 \sa bm::str_sparse_vector::set_null
25 \sa bm::str_sparse_vector::push_back
26 \sa bm::str_sparse_vector::const_iterator
27 \sa bm::str_sparse_vector::optimize
28
29*/
30
31/*! \file strsvsample04.cpp
32 \brief Example: str_sparse_vector<> how to work with NULL values
33*/
34
35#include <iostream>
36#include <string>
37#include <vector>
38#include <algorithm>
39
40#include "bm.h"
41#include "bmstrsparsevec.h"
42#include "bmundef.h" /* clear the pre-proc defines from BM */
43
44using namespace std;
45
48
49int main(void)
50{
51 try
52 {
53 // construct container with NULL (unassigned support)
55
56 const char* s0 = "asz1234";
57 std::string str1 = "aqw1234";
58 std::string str3 = "54z";
59 std::string str00 = "00";
60
61 str_sv.set(0, s0); // set a C-string
62 str_sv.push_back(str1); // add from an STL string
63
64 str_sv.assign(3, str3); // assign element 3 from an STL string
65
66 // back-insert iterator can be used to add NULL values
67 {
68 auto bi = str_sv.get_back_inserter();
69 bi = "456"; // add regular value
70 bi.add_null(); // add NULL value explicitly
71 bi = (const char*)0; // add NULL via 0 ptr
72
73 bi.flush(); // flush insert iterator
74 }
75
76 str_sv.set_null(str_sv.size()); // set a NULL element with automatic resize
77
78 // please note that container automatically resizes
79 std::cout << "sv size()=" << str_sv.size() << endl; // 4
80
81
82 // print out the container content using [] reference
83 //
84 for (str_sv_type::size_type i = 0; i < str_sv.size(); ++i)
85 {
86 if (str_sv[i].is_null())
87 cout << i << ":NULL" << endl;
88 else
89 {
90 const char* s = str_sv[i];
91 cout << i << ":" << s << endl;
92 }
93 } // for i
94 cout << endl;
95
96 // clear vector elements in [4, 7] closed interval
97 // and set elements to NULL
98 //
99 str_sv.clear_range(4, 7, true);
100
101
102 // print content using const_iterator which also supports is_null()
103 //
104 {
106 str_sv_type::const_iterator it_end = str_sv.end();
107 for (; it != it_end; ++it)
108 {
109 if (it.is_null())
110 cout << "NULL" << endl;
111 else
112 cout << *it << endl;
113 } // for it
114 }
115
116 // bulk clear and set to NULL using bit-vector as an index
117 // (faster than random access)
118 {
119 bvector_type bv_idx { 0, 3, 4, 5 }; // index vector of elements
120 str_sv.set_null(bv_idx);
121 str_sv.optimize(); // recompress blocks to free some memory
122 }
123 cout << endl;
124 {
126 str_sv_type::const_iterator it_end = str_sv.end();
127 for (; it != it_end; ++it)
128 {
129 std::string_view s = it.get_string_view();
130 if (s.data() == 0)
131 cout << "NULL" << endl;
132 else
133 cout << s << endl;
134 } // for it
135 }
136
137 }
138 catch(std::exception& ex)
139 {
140 std::cerr << ex.what() << std::endl;
141 return 1;
142 }
143
144
145 return 0;
146}
147
Compressed bit-vector bvector<> container, set algebraic methods, traversal iterators.
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.
Definition: bm.h:115
void add_null()
add NULL (no-value) to the container
Const iterator to do quick traverse of the sparse vector.
bool is_null() const BMNOEXCEPT
Get NULL status.
string_view_type get_string_view() const
Get current string as string_view.
succinct sparse vector for strings with compression using bit-slicing ( transposition) method
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 set_null(size_type idx)
set NULL status for the specified element Vector is resized automatically
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
back_insert_iterator get_back_inserter()
Provide back insert iterator Back insert iterator implements buffered insertion, which is faster,...
str_sparse_vector< CharType, BV, STR_SIZE > & clear_range(size_type left, size_type right, bool set_null=false)
clear range (assign bit 0 for all planes)
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
Definition: bmconst.h:229
bm::str_sparse_vector< char, bvector_type, 32 > str_sv_type
bm::bvector bvector_type
int main(void)