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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
|
/*
Copyright (c) by respective owners including Yahoo!, Microsoft, and
individual contributors. All rights reserved. Released under a BSD
license as described in the file LICENSE.
*/
#pragma once
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <stdint.h>
#ifdef _WIN32
#define __INLINE
#else
#define __INLINE inline
#endif
const size_t erase_point = ~ ((1 << 10) -1);
template<class T> struct v_array{
public:
T* begin;
T* end;
T* end_array;
size_t erase_count;
T last() { return *(end-1);}
T pop() { return *(--end);}
bool empty() { return begin == end;}
void decr() { end--;}
T& operator[](size_t i) { return begin[i]; }
T& get(size_t i) { return begin[i]; }
inline size_t size(){return end-begin;}
void resize(size_t length, bool zero_everything=false)
{
if ((size_t)(end_array-begin) != length)
{
size_t old_len = end-begin;
begin = (T *)realloc(begin, sizeof(T) * length);
if ((begin == NULL) && ((sizeof(T)*length) > 0)) {
std::cerr << "realloc of " << length << " failed in resize(). out of memory?" << std::endl;
throw std::exception();
}
if (zero_everything && (old_len < length))
memset(begin+old_len, 0, (length-old_len)*sizeof(T));
end = begin+old_len;
end_array = begin + length;
}
}
void erase()
{ if (++erase_count & erase_point)
{
resize(end-begin);
erase_count = 0;
}
end = begin;
}
void delete_v()
{
if (begin != NULL)
free(begin);
begin = end = end_array = NULL;
}
void push_back(const T &new_ele)
{
if(end == end_array)
resize(2 * (end_array-begin) + 3);
*(end++) = new_ele;
}
size_t find_sorted(const T& ele) //index of the smallest element >= ele, return true if element is in the array
{
size_t size = end - begin;
size_t a = 0;
size_t b = size;
size_t i = (a + b) / 2;
while(b - a > 1)
{
if(begin[i] < ele) //if a = 0, size = 1, if in while we have b - a >= 1 the loop is infinite
a = i;
else if(begin[i] > ele)
b = i;
else
return i;
i = (a + b) / 2;
}
if((size == 0) || (begin[a] > ele) || (begin[a] == ele)) //pusta tablica, nie wchodzi w while
return a;
else //size = 1, ele = 1, begin[0] = 0
return b;
}
size_t unique_add_sorted(const T &new_ele)//ANNA
{
size_t index = 0;
size_t size = end - begin;
size_t to_move;
if(!contain_sorted(new_ele, index))
{
if(end == end_array)
resize(2 * (end_array-begin) + 3);
to_move = size - index;
if(to_move > 0)
memmove(begin + index + 1, begin + index, to_move * sizeof(T)); //kopiuje to_move*.. bytow z begin+index do begin+index+1
begin[index] = new_ele;
end++;
}
return index;
}
bool contain_sorted(const T &ele, size_t& index)
{
index = find_sorted(ele);
if(index == this->size())
return false;
if(begin[index] == ele)
return true;
return false;
}
};
#ifdef _WIN32
#undef max
#undef min
#endif
inline size_t max(size_t a, size_t b)
{ if ( a < b) return b; else return a;
}
inline size_t min(size_t a, size_t b)
{ if ( a < b) return a; else return b;
}
template<class T>
inline v_array<T> v_init() { return {NULL, NULL, NULL, 0};}
template<class T> void copy_array(v_array<T>& dst, v_array<T> src)
{
dst.erase();
push_many(dst, src.begin, src.size());
}
template<class T> void copy_array(v_array<T>& dst, v_array<T> src, T(*copy_item)(T&))
{
dst.erase();
for (T*item = src.begin; item != src.end; ++item)
dst.push_back(copy_item(*item));
}
template<class T> void push_many(v_array<T>& v, const T* begin, size_t num)
{
if(v.end+num >= v.end_array)
v.resize(max(2 * (size_t)(v.end_array - v.begin) + 3,
v.end - v.begin + num));
memcpy(v.end, begin, num * sizeof(T));
v.end += num;
}
template<class T> void calloc_reserve(v_array<T>& v, size_t length)
{
v.begin = (T *)calloc(length, sizeof(T));
v.end = v.begin;
v.end_array = v.begin + length;
}
template<class T> v_array<T> pop(v_array<v_array<T> > &stack)
{
if (stack.end != stack.begin)
return *(--stack.end);
else
return v_array<T>();
}
template<class T> bool v_array_contains(v_array<T> &A, T x) {
for (T* e = A.begin; e != A.end; ++e)
if (*e == x) return true;
return false;
}
|
