libostd/octa/array.h

68 lines
2.0 KiB
C
Raw Normal View History

2015-04-21 18:57:20 +02:00
/* Static array implementation for OctaSTD.
*
* This file is part of OctaSTD. See COPYING.md for futher information.
*/
#ifndef OCTA_ARRAY_H
#define OCTA_ARRAY_H
#include <stddef.h>
2015-05-21 01:34:42 +02:00
#include "octa/algorithm.h"
2015-04-21 18:57:20 +02:00
#include "octa/range.h"
2015-05-28 03:38:52 +02:00
#include "octa/string.h"
2015-04-21 18:57:20 +02:00
namespace octa {
template<typename _T, size_t _N>
2015-04-21 18:57:20 +02:00
struct Array {
typedef size_t Size;
typedef ptrdiff_t Difference;
typedef _T Value;
typedef _T &Reference;
typedef const _T &ConstReference;
typedef _T *Pointer;
typedef const _T *ConstPointer;
typedef PointerRange< _T> Range;
typedef PointerRange<const _T> ConstRange;
2015-04-21 18:57:20 +02:00
_T &operator[](size_t __i) { return __buf[__i]; }
const _T &operator[](size_t __i) const { return __buf[__i]; }
2015-04-21 18:57:20 +02:00
_T &at(size_t __i) { return __buf[__i]; }
const _T &at(size_t __i) const { return __buf[__i]; }
2015-04-21 18:57:20 +02:00
_T &front() { return __buf[0]; }
const _T &front() const { return __buf[0]; }
2015-04-21 18:57:20 +02:00
_T &back() { return __buf[(_N > 0) ? (_N - 1) : 0]; }
const _T &back() const { return __buf[(_N > 0) ? (_N - 1) : 0]; }
2015-04-21 18:57:20 +02:00
size_t size() const { return _N; }
2015-04-21 18:57:20 +02:00
bool empty() const { return _N == 0; }
2015-05-17 23:51:42 +02:00
bool in_range(size_t __idx) { return __idx < _N; }
bool in_range(int __idx) { return __idx >= 0 && size_t(__idx) < _N; }
bool in_range(const _T *__ptr) {
return __ptr >= &__buf[0] && __ptr < &__buf[_N];
2015-05-17 23:51:42 +02:00
}
_T *data() { return __buf; }
const _T *data() const { return __buf; }
2015-04-21 18:57:20 +02:00
Range each() {
return octa::PointerRange<_T>(__buf, __buf + _N);
2015-04-21 18:57:20 +02:00
}
ConstRange each() const {
return octa::PointerRange<const _T>(__buf, __buf + _N);
2015-04-21 18:57:20 +02:00
}
void swap(Array &__v) {
octa::swap_ranges(each(), __v.each());
2015-05-21 01:34:42 +02:00
}
_T __buf[(_N > 0) ? _N : 1];
2015-04-21 18:57:20 +02:00
};
}
#endif