diff options
Diffstat (limited to 'raul/Array.hpp')
-rw-r--r-- | raul/Array.hpp | 137 |
1 files changed, 137 insertions, 0 deletions
diff --git a/raul/Array.hpp b/raul/Array.hpp new file mode 100644 index 0000000..1920b4a --- /dev/null +++ b/raul/Array.hpp @@ -0,0 +1,137 @@ +/* + This file is part of Raul. + Copyright 2007-2013 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 3 of the License, or 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 more details. + + You should have received a copy of the GNU General Public License + along with Raul. If not, see <http://www.gnu.org/licenses/>. +*/ + +#ifndef RAUL_ARRAY_HPP +#define RAUL_ARRAY_HPP + +#include <algorithm> +#include <cassert> +#include <cstddef> + +#include "raul/Maid.hpp" + +namespace Raul { + +/** A disposable array with size. + * + * \ingroup raul + */ +template <class T> +class Array : public Maid::Disposable +{ +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; + } + } + } + + explicit Array(const Array<T>& copy) + : _size(copy._size) + { + _elems = new T[_size]; + for (size_t i = 0; i < _size; ++i) { + _elems[i] = copy._elems[i]; + } + } + + 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) { + delete[] _elems; + _size = num_elems; + + if (num_elems > 0) { + _elems = new T[num_elems]; + } else { + _elems = NULL; + } + } + + virtual void alloc(size_t num_elems, T initial_value) { + delete[] _elems; + _size = num_elems; + + if (num_elems > 0) { + _elems = new T[num_elems]; + for (size_t i = 0; i < _size; ++i) { + _elems[i] = initial_value; + } + } else { + _elems = NULL; + } + } + + 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 |