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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175

/*
Copyright (c) 2003 Anatoliy Kuznetsov.
*/
#ifndef BM_COMPRESSED_VECTOR__H__INCLUDED__
#define BM_COMPRESSED_VECTOR__H__INCLUDED__

#include "bmmalloc.h"


namespace bm
{


template<class V, class S, class A=bm::malloc_allocator<V> >
class compressed_scalar_vector
{
public:
    typedef S                       set_type;
    typedef S                       bvector_type;
    typedef V                       value_type;
    typedef bm::id_t                key_type;

public:
    compressed_scalar_vector(S* set=0);
    compressed_scalar_vector(unsigned size, S* set=0);
    compressed_scalar_vector(const compressed_scalar_vector<V, S, A>& vect);    
    compressed_scalar_vector<V, S, A>& operator=(const compressed_scalar_vector<V, S, A>& vect);
    
    ~compressed_scalar_vector();
    
    unsigned size() const     { return size_; }
    unsigned capacity() const { return capacity_; }
    
    void set(unsigned idx, const V& value);
    
    void resize(unsigned new_size);
private:
    void reserve_new(unsigned capacity);    
private:
    S*         set_;
    V*         data_;
    unsigned   size_;
    unsigned   capacity_;
    unsigned   max_idx_;
    unsigned*  set_block_count_cache_;    
};

// ---------------------------------------------------------------------------

template<class V, class S, class A>
compressed_scalar_vector<V, S, A>::compressed_scalar_vector(S* set)
: set_(set ? set : new S()),
  data_(0),
  size_(0),
  capacity_(0),
  max_idx_(0),
  set_block_count_cache_(0)
{
    assert(!set_->any());
}

template<class V, class S, class A>
compressed_scalar_vector<V, S, A>::compressed_scalar_vector(unsigned size, S* set)
: set_(set ? set : new S()),
  max_idx_(0),
  set_block_count_cache_(0)
{
    assert(!set_->any());
    data_ = size ? A::allocate(size, 0) : 0;    
    size_ = capacity_ = size_;
}

template<class V, class S, class A>
compressed_scalar_vector<V, S, A>::compressed_scalar_vector
                               (const compressed_scalar_vector<V, S, A>& vect)
: set_(new S(vect.set_),
  max_idx_(vect.max_idx_),
  set_block_count_cache_(0)
{
    capacity_ = size_ = vect.size();
    if (size_)
    {
        data_ = A::allocate(size_, 0) : 0;
        ::memcpy(data_, vect.data_, sizeof(V) * size_);
    }
    else
    {
        data_ = 0;
    }
}

template<class V, class S, class A>
compressed_scalar_vector<V, S, A>::~compressed_scalar_vector()
{
    delete set_;
    if (data_)
        A::deallocate(data_, capacity_);
    delete set_block_count_cache_;
}


template<class V, class S, class A>
compressed_scalar_vector<V, S, A>& operator=(const compressed_scalar_vector<V, S, A>& vect)
{
    *set_ = *(vect.set_);
    
    if (capacity_ < vect.size())
    {
        A::deallocate(data_, capacity_);
        capacity_ = size_ = vect.size();
        data_ = A::allocate(size_, 0);        
    }
    else
    {
        size_ = vect.size();
    }
    ::memcpy(data_, vect.data_, sizeof(V) * size_);
}


template<class V, class S, class A>
void compressed_scalar_vector<V, S, A>::set(unsigned idx, const V& value)
{
    assert(idx < size_);
    
    unsigned i;
    if (idx >= max_idx_)
    {
        i = set_->count();
        max_idx_ = idx;
    }
    else
    {
        i = set_->count_range(0, idx);
    }
    
    if (set_->test(idx))
    {
        --i;
    }
    else
    {
        set_->set(idx);
        if (i >= size())
        {
            resize(i+1);
        }
    }
    data_[i] = value;
}


template<class V, class S, class A>
void compressed_scalar_vector<V, S, A>::resize(unsigned new_size)
{
    if (new_size > capacity)
    {
        reserve_new(new_size);
    }
    size_ = new_size;
}

template<class V, class S, class A>
void compressed_scalar_vector<V, S, A>::reserve_new(unsigned capacity)
{
    V* data_new = A::allocate(capacity, 0);
    ::memcpy(data_, data_new, sizeof(V) * size_);
    capacity_ = capacity;
}


} // namespace bm

#endif