/usr/include/vowpalwabbit/v_array.h is in libvw-dev 8.5.0.dfsg1-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 | /*
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
#include "vw_exception.h"
#include "memory.h"
const size_t erase_point = ~ ((1 << 10) -1);
template<class T> struct v_array
{
// private:
T* _begin;
T* _end;
public:
T* end_array;
size_t erase_count;
// enable C++ 11 for loops
inline T*& begin() { return _begin; }
inline T*& end() { return _end; }
inline T* const cbegin() const { return _begin; }
inline T* const cend() const { return _end; }
// v_array cannot have a user-defined constructor, because it participates in various unions.
// union members cannot have user-defined constructors.
// v_array() : _begin(nullptr), _end(nullptr), end_array(nullptr), erase_count(0) {}
// ~v_array() {
// delete_v();
// }
T last() const { return *(_end-1);}
T pop() { return *(--_end);}
bool empty() const { return _begin == _end;}
void decr() { _end--;}
void incr()
{ if (_end == end_array)
resize(2 * (end_array - _begin) + 3);
_end++;
}
T& operator[](size_t i) const { return _begin[i]; }
T& get(size_t i) const { return _begin[i]; }
inline size_t size() const {return _end-_begin;}
void resize(size_t length)
{ if ((size_t)(end_array-_begin) != length)
{ size_t old_len = _end-_begin;
T* temp = (T *)realloc(_begin, sizeof(T) * length);
if ((temp == nullptr) && ((sizeof(T)*length) > 0))
{ THROW("realloc of " << length << " failed in resize(). out of memory?");
}
else
_begin = temp;
if (old_len < length && _begin+old_len != nullptr)
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;
}
for (T*item = _begin; item != _end; ++item)
item->~T();
_end = _begin;
}
void delete_v()
{ if (_begin != nullptr)
{ for (T*item = _begin; item != _end; ++item)
item->~T();
free(_begin);
}
_begin = _end = end_array = nullptr;
}
void push_back(const T& new_ele)
{ if(_end == end_array)
resize(2 * (end_array-_begin) + 3);
new (_end++) T(new_ele);
}
void push_back_unchecked(const T& new_ele)
{ new (_end++) T(new_ele); }
size_t find_sorted(const T& ele) const //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)
{ 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 {nullptr, nullptr, nullptr, 0};}
template<class T> void copy_array(v_array<T>& dst, const v_array<T>& src)
{ dst.erase();
push_many(dst, src._begin, src.size());
}
// use to copy arrays of types with non-trivial copy constructors, such as shared_ptr
template<class T> void copy_array_no_memcpy(v_array<T>& dst, const v_array<T>& src)
{ dst.erase();
for (T*item = src._begin; item != src._end; ++item)
dst.push_back(*item);
}
template<class T> void copy_array(v_array<T>& dst, const 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 = calloc_or_throw<T>(length);
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;
}
template<class T>std::ostream& operator<<(std::ostream& os, const v_array<T>& v)
{ os << '[';
for (T* i=v._begin; i!=v._end; ++i) os << ' ' << *i;
os << " ]";
return os;
}
template<class T,class U>std::ostream& operator<<(std::ostream& os, const v_array<std::pair<T,U> >& v)
{ os << '[';
for (std::pair<T,U>* i=v._begin; i!=v._end; ++i) os << ' ' << i->first << ':' << i->second;
os << " ]";
return os;
}
typedef v_array<unsigned char> v_string;
inline v_string string2v_string(const std::string& s)
{ v_string res = v_init<unsigned char>();
if (!s.empty())
push_many(res, (unsigned char*)s.data(), s.size());
return res;
}
inline std::string v_string2string(const v_string& v_s)
{ std::string res;
for (unsigned char* i = v_s._begin; i != v_s._end; ++i)
res.push_back(*i);
return res;
}
|