forked from OctaForge/libostd
70 lines
1.8 KiB
C++
70 lines
1.8 KiB
C++
/* 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>
|
|
|
|
#include "octa/algorithm.h"
|
|
#include "octa/range.h"
|
|
#include "octa/string.h"
|
|
|
|
namespace octa {
|
|
|
|
template<typename _T, size_t _N>
|
|
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;
|
|
|
|
_T &operator[](size_t i) { return p_buf[i]; }
|
|
const _T &operator[](size_t i) const { return p_buf[i]; }
|
|
|
|
_T &at(size_t i) { return p_buf[i]; }
|
|
const _T &at(size_t i) const { return p_buf[i]; }
|
|
|
|
_T &front() { return p_buf[0]; }
|
|
const _T &front() const { return p_buf[0]; }
|
|
|
|
_T &back() { return p_buf[(_N > 0) ? (_N - 1) : 0]; }
|
|
const _T &back() const { return p_buf[(_N > 0) ? (_N - 1) : 0]; }
|
|
|
|
size_t size() const { return _N; }
|
|
|
|
bool empty() const { return _N == 0; }
|
|
|
|
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 >= &p_buf[0] && ptr < &p_buf[_N];
|
|
}
|
|
|
|
_T *data() { return p_buf; }
|
|
const _T *data() const { return p_buf; }
|
|
|
|
Range each() {
|
|
return octa::PointerRange<_T>(p_buf, p_buf + _N);
|
|
}
|
|
ConstRange each() const {
|
|
return octa::PointerRange<const _T>(p_buf, p_buf + _N);
|
|
}
|
|
|
|
void swap(Array &v) {
|
|
octa::swap_ranges(each(), v.each());
|
|
}
|
|
|
|
_T p_buf[(_N > 0) ? _N : 1];
|
|
};
|
|
|
|
} /* namespace octa */
|
|
|
|
#endif |