/usr/include/raul/Array.hpp is in libraul-dev 0.8.0+dfsg0-0.1+b1.
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 | /* This file is part of Raul.
* Copyright (C) 2007-2009 David Robillard <http://drobilla.net>
*
* Raul is free software; you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation; either version 2 of the License, or (at your option) any later
* version.
*
* Raul is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef RAUL_ARRAY_HPP
#define RAUL_ARRAY_HPP
#include <cassert>
#include <cstddef>
#include <algorithm>
#include "Deletable.hpp"
namespace Raul {
/** An array.
*
* Has a stack-like push_back(), but is NOT a resizeable array (the size given
* to the constructor or alloc method is the maximum number of elements which
* can be pushed).
* \ingroup raul
*/
template <class T>
class Array : public Deletable
{
public:
explicit Array(size_t size = 0) : _size(size), _elems(NULL) {
if (size > 0)
_elems = new T[size];
}
Array(size_t size, T initial_value) : _size(size), _elems(NULL) {
if (size > 0) {
_elems = new T[size];
for (size_t i = 0; i < size; ++i)
_elems[i] = initial_value;
}
}
Array(size_t size, const Array<T>& contents) : _size(size) {
assert(contents.size() >= size);
_elems = new T[size];
for (size_t i = 0; i < std::min(size, contents.size()); ++i)
_elems[i] = contents[i];
}
Array(size_t size, const Array<T>& contents, T initial_value=T()) : _size(size) {
_elems = new T[size];
const size_t end = std::min(size, contents.size());
for (size_t i = 0; i < end; ++i)
_elems[i] = contents[i];
for (size_t i = end; i < size; ++i)
_elems[i] = initial_value;
}
~Array() {
delete[] _elems;
}
virtual void alloc(size_t num_elems) {
assert(num_elems > 0);
delete[] _elems;
_size = num_elems;
_elems = new T[num_elems];
}
virtual void alloc(size_t num_elems, T initial_value) {
assert(num_elems > 0);
delete[] _elems;
_size = num_elems;
_elems = new T[num_elems];
for (size_t i = 0; i < _size; ++i)
_elems[i] = initial_value;
}
inline size_t size() const { return _size; }
inline T& operator[](size_t i) const { assert(i < _size); return _elems[i]; }
inline T& at(size_t i) const { assert(i < _size); return _elems[i]; }
private:
size_t _size;
T* _elems;
};
} // namespace Raul
#endif // RAUL_ARRAY_HPP
|