91 lines
2.1 KiB
C++
91 lines
2.1 KiB
C++
|
#include <cstddef>
|
||
|
|
|
||
|
|
namespace axolotl {
|
||
|
|
|
||
|
|
template<typename T, std::size_t max_size>
|
||
|
|
class List {
|
||
|
|
public:
|
||
|
|
List() : _end(_data) {}
|
||
|
|
|
||
|
|
typedef T * iterator;
|
||
|
|
typedef T const * const_iterator;
|
||
|
|
|
||
|
|
T * begin() { return _data; }
|
||
|
|
T * end() { return _end; }
|
||
|
|
T const * begin() const { return _data; }
|
||
|
|
T const * end() const { return _end; }
|
||
|
|
|
||
|
|
/**
|
||
|
|
* The number of items in the list.
|
||
|
|
*/
|
||
|
|
std::size_t size() { return _end - _data; }
|
||
|
|
|
||
|
|
T & operator[](std::size_t index) { return _data[index]; }
|
||
|
|
|
||
|
|
T const & operator[](std::size_t index) const { return _data[index]; }
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Erase the item from the list at the given position.
|
||
|
|
*/
|
||
|
|
void erase(T * pos) {
|
||
|
|
--_end;
|
||
|
|
while (pos != _end) {
|
||
|
|
*pos = *(pos + 1);
|
||
|
|
++pos;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Make space for an item in the list at a given position.
|
||
|
|
* If inserting the item makes the list longer than max_size then
|
||
|
|
* the end of the list is discarded.
|
||
|
|
* Returns the where the item is inserted.
|
||
|
|
*/
|
||
|
|
T * insert(T * pos) {
|
||
|
|
if (_end != _data + max_size) {
|
||
|
|
++_end;
|
||
|
|
} else if (pos == _end) {
|
||
|
|
--pos;
|
||
|
|
}
|
||
|
|
T * tmp = pos;
|
||
|
|
while (tmp != _end - 1) {
|
||
|
|
*(tmp + 1) = *tmp;
|
||
|
|
++tmp;
|
||
|
|
}
|
||
|
|
return pos;
|
||
|
|
}
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Insert an item into the list at a given position.
|
||
|
|
* If inserting the item makes the list longer than max_size then
|
||
|
|
* the end of the list is discarded.
|
||
|
|
* Returns the where the item is inserted.
|
||
|
|
*/
|
||
|
|
T * insert(T * pos, T const & value) {
|
||
|
|
pos = insert(pos);
|
||
|
|
*pos = value;
|
||
|
|
return pos;
|
||
|
|
}
|
||
|
|
|
||
|
|
List<T, max_size> & operator=(List<T, max_size> const & other) {
|
||
|
|
if (this = &other) {
|
||
|
|
return *this;
|
||
|
|
}
|
||
|
|
T * this_pos = _data;
|
||
|
|
T * const other_pos = other._data;
|
||
|
|
while (other_pos != other._end) {
|
||
|
|
*this_pos = *other;
|
||
|
|
++this_pos;
|
||
|
|
++other_pos;
|
||
|
|
}
|
||
|
|
_end = this_pos;
|
||
|
|
return *this;
|
||
|
|
}
|
||
|
|
|
||
|
|
private:
|
||
|
|
T * _end;
|
||
|
|
T _data[max_size];
|
||
|
|
};
|
||
|
|
|
||
|
|
} // namespace axolotl
|