bitmagic-sys 0.2.4+bitmagic.7.7.7

Low-level bindings for the bitmagic.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142

/*
Copyright(c) 2002-2017 Anatoliy Kuznetsov(anatoliy_kuznetsov at yahoo.com)

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.

For more information please visit:  http://bitmagic.io
*/

/** \example svsample01.cpp
  Example of how to use bm::sparse_vector<> template class to set or
  import values.

  bm::sparse_vector<> uses bit-splicing method to keep bit-planes separate
  to provide on-the fly succinct data vector.
 
  \sa bm::sparse_vector<>::import
  \sa bm::sparse_vector<>::at
  \sa bm::sparse_vector<>::optimize
  \sa bm::sparse_vector<>::size
*/

/*! \file svsample01.cpp
    \brief Example: sparse_vector<> container set values
*/


#include <iostream>
#include <algorithm>

#include "bm.h"
#include "bmsparsevec.h"
#include "bmundef.h" /* clear the pre-proc defines from BM */

using namespace std;

typedef bm::sparse_vector<unsigned, bm::bvector<> > sparse_vector_u32;
typedef bm::sparse_vector<int, bm::bvector<> >      sparse_vector_i32;

/**
    bm::sparse_vector for unsigned int data
*/
static
void Demo1()
{
    using value_type = bm::sparse_vector<int, bm::bvector<> >::value_type;
    sparse_vector_u32 sv1;

    unsigned arr[3] = {1,2,3};
    sv1.import(arr, 3); // import from a C-style array (fastest way to populate)

    // optimize memory allocation of sparse vector
    {
        BM_DECLARE_TEMP_BLOCK(tb)
        sv1.optimize(tb);
    }

    cout << "sv1.size() = " << sv1.size() << endl;
    cout << "sv[]:";

    // print the vector elements using direct access operator
    for (unsigned i = 0; i < sv1.size(); ++i)
    {
        cout << sv1.at(i) << ",";
    }
    cout << endl;

    // add more at the end
    unsigned arr2[5] = {10, 20, 30, 40, 50};
    sv1.import(arr2, 5, sv1.size());

    cout << "sv1.size() = " << sv1.size() << endl;
    cout << "sv[]:";

    // print using std::for_each plus lambda
    std::for_each(sv1.begin(), sv1.end(),
                  [](value_type n) { cout << n << ", "; });
    cout << endl;
}

/**
    bm::sparse_vector can also support signed ints.
    The container transforms it from complementary code to more
    optimal representation so that
*/
static
void Demo2()
{
    sparse_vector_i32 sv1;

    int arr[3] = {1,-2,3};
    sv1.import(arr, 3); // import from a C-style array (fastest way to populate)

    // add more at the end
    int arr2[5] = {-10, 20, 30, 40, -50};
    sv1.import(arr2, 5, sv1.size());
    {
        BM_DECLARE_TEMP_BLOCK(tb)
        sv1.optimize(tb);
    }

    cout << "sv1.size() = " << sv1.size() << endl;
    cout << "sv[]:";

    // print using std::for_each plus lambda
    std::for_each(sv1.begin(), sv1.end(), [] (auto n) { cout << n << ", "; }
                  );
    cout << endl;
}


int main(void)
{
    try
    {
        // Demo1 for unsigned int
        Demo1();

        cout << endl << endl;

        // Demo2 for signed int
        Demo2();
    }
    catch(std::exception& ex)
    {
        std::cerr << ex.what() << std::endl;
        return 1;
    }
    

    return 0;
}