BitMagic-C++
strsvsample01.cpp
Go to the documentation of this file.
1 /*
2 Copyright(c) 2002-2017 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)
3 
4 Licensed under the Apache License, Version 2.0 (the "License");
5 you may not use this file except in compliance with the License.
6 You may obtain a copy of the License at
7 
8  http://www.apache.org/licenses/LICENSE-2.0
9 
10 Unless required by applicable law or agreed to in writing, software
11 distributed under the License is distributed on an "AS IS" BASIS,
12 WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 See the License for the specific language governing permissions and
14 limitations under the License.
15 
16 For more information please visit: http://bitmagic.io
17 */
18 
19 /** \example strsvsample01.cpp
20  Example of how to use bm::str_sparse_vector<> - succinct container for
21  bit-transposed string collections
22 
23  \sa bm::str_sparse_vector
24 */
25 
26 /*! \file strsvsample01.cpp
27  \brief Example: str_sparse_vector<> set values, optimize memory
28 */
29 
30 #include <iostream>
31 #include <string>
32 #include <vector>
33 
34 #include "bm.h"
35 #include "bmstrsparsevec.h"
36 
37 using namespace std;
38 
40 
41 // define the sparse vector type for 'char' type using bvector as
42 // a container of bits for bit-transposed planes
43 // 32 - is maximum string length for this container.
44 // Memory allocation is dynamic using sparse techniques, so this number
45 // just defines the max capacity.
46 //
48 
49 int main(void)
50 {
51  try
52  {
53  str_sv_type str_sv;
54 
55  const char* s0 = "asz1234";
56  std::string str1 = "aqw1234";
57  std::string str3 = "54z";
58  std::string str00 = "00";
59 
60  str_sv.set(0, s0); // set a C-string
61  str_sv.push_back(str1); // add from an STL string
62 
63  str_sv.assign(3, str3); // assign element 3 from an STL string
64 
65  // please note that container automatically resizes
66  std::cout << "sv size()=" << str_sv.size() << endl; // 4
67 
68  str_sv.insert(0, str00); // insert element
69 
70  str_sv.erase(0); // erase element 0
71 
72 
73  // optimize runs compression in all bit-plains
74  {
76  str_sv.optimize(tb);
77  }
78 
79  // print out the container content using [] reference
80  //
81  for (str_sv_type::size_type i = 0; i < str_sv.size(); ++i)
82  {
83  const char* s = str_sv[i];
84  cout << i << ":" << s << endl;
85  } // for i
86  cout << "----" << endl;
87 
88  // print content using const_iterator
89  //
90  // const iterator has a bulk implementation,
91  // not like random access const_iterator is transposing a whole set
92  // of elements at once, it is faster for bulk traverse
93  //
94  {
95  str_sv_type::const_iterator it = str_sv.begin();
96  str_sv_type::const_iterator it_end = str_sv.end();
97  for (; it != it_end; ++it)
98  {
99  cout << *it << endl;
100  } // for it
101  }
102  }
103  catch(std::exception& ex)
104  {
105  std::cerr << ex.what() << std::endl;
106  return 1;
107  }
108 
109 
110  return 0;
111 }
112 
Compressed bit-vector bvector<> container, set algebraic methods, traversal iterators.
void optimize(bm::word_t *temp_block=0, typename bvector_type::optmode opt_mode=bvector_type::opt_compress, typename str_sparse_vector< CharType, BV, MAX_STR_SIZE >::statistics *stat=0)
run memory optimization for all vector plains
void erase(size_type idx)
erase the specified element
const_iterator end() const
Provide const iterator access to the end.
string sparse vector based on bit-transposed matrix
#define BM_DECLARE_TEMP_BLOCK(x)
Definition: bm.h:47
void push_back(const StrType &str)
push back a string
sparse vector for strings with compression using bit transposition method
void insert(size_type idx, const value_type *str)
insert the specified element
void assign(size_type idx, const StrType &str)
set specified element with bounds checking and automatic resize
int main(void)
const_iterator begin() const
Provide const iterator access to container content.
size_type size() const
return size of the vector
void set(size_type idx, const value_type *str)
set specified element with bounds checking and automatic resize
bvector_type::size_type size_type
bm::bvector bvector_type
bm::str_sparse_vector< char, bvector_type, 32 > str_sv_type
Const iterator to do quick traverse of the sparse vector.