summaryrefslogtreecommitdiffstats
path: root/raul/Array.hpp
diff options
context:
space:
mode:
authorDavid Robillard <d@drobilla.net>2012-11-22 06:16:10 +0000
committerDavid Robillard <d@drobilla.net>2012-11-22 06:16:10 +0000
commitc4b51e0935f75d118164fab6bfcefc6ddf69867e (patch)
treef4f6bfc5e0a19561dd7860f82976dff3fdbb68a6 /raul/Array.hpp
parent5642368878114fd99cb6bf877258945a38c3c0b9 (diff)
downloadraul-c4b51e0935f75d118164fab6bfcefc6ddf69867e.tar.gz
raul-c4b51e0935f75d118164fab6bfcefc6ddf69867e.tar.bz2
raul-c4b51e0935f75d118164fab6bfcefc6ddf69867e.zip
Tidy.
git-svn-id: http://svn.drobilla.net/lad/trunk/raul@4851 a436a847-0d15-0410-975c-d299462d15a1
Diffstat (limited to 'raul/Array.hpp')
-rw-r--r--raul/Array.hpp28
1 files changed, 22 insertions, 6 deletions
diff --git a/raul/Array.hpp b/raul/Array.hpp
index 96797d4..485f3cf 100644
--- a/raul/Array.hpp
+++ b/raul/Array.hpp
@@ -36,12 +36,18 @@ template <class T>
class Array : public Disposable
{
public:
- explicit Array(size_t size = 0) : _size(size), _elems(NULL) {
+ 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) {
+ 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)
@@ -49,14 +55,18 @@ public:
}
}
- Array(size_t size, const Array<T>& contents) : _size(size) {
+ 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) {
+ 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)
@@ -91,9 +101,15 @@ public:
inline size_t size() const { return _size; }
- inline T& operator[](size_t i) const { assert(i < _size); return _elems[i]; }
+ 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]; }
+ inline T& at(size_t i) const {
+ assert(i < _size);
+ return _elems[i];
+ }
private:
size_t _size;