2018-10-10 12:53:07 +03:00
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include "Assertions.h"
|
|
|
|
#include "OwnPtr.h"
|
2018-10-10 16:11:43 +03:00
|
|
|
#include "kmalloc.h"
|
2018-10-10 12:53:07 +03:00
|
|
|
|
|
|
|
namespace AK {
|
|
|
|
|
2018-11-01 01:19:15 +03:00
|
|
|
template<typename T, typename Allocator> class Vector;
|
2018-10-10 12:53:07 +03:00
|
|
|
|
2018-11-01 01:19:15 +03:00
|
|
|
struct KmallocAllocator {
|
|
|
|
static void* allocate(size_t size) { return kmalloc(size); }
|
|
|
|
static void deallocate(void* ptr) { kfree(ptr); }
|
|
|
|
};
|
|
|
|
|
|
|
|
struct KmallocEternalAllocator {
|
|
|
|
static void* allocate(size_t size) { return kmalloc_eternal(size); }
|
|
|
|
static void deallocate(void*) { }
|
|
|
|
};
|
|
|
|
|
|
|
|
template<typename T, typename Allocator>
|
2018-10-10 12:53:07 +03:00
|
|
|
class VectorImpl {
|
|
|
|
public:
|
|
|
|
~VectorImpl() { }
|
2018-10-26 18:42:12 +03:00
|
|
|
static VectorImpl* create(size_t capacity)
|
2018-10-10 12:53:07 +03:00
|
|
|
{
|
|
|
|
size_t size = sizeof(VectorImpl) + sizeof(T) * capacity;
|
2018-11-01 01:19:15 +03:00
|
|
|
void* slot = Allocator::allocate(size);
|
2018-10-26 18:42:12 +03:00
|
|
|
new (slot) VectorImpl(capacity);
|
|
|
|
return (VectorImpl*)slot;
|
2018-10-10 12:53:07 +03:00
|
|
|
}
|
|
|
|
|
2018-10-16 14:59:28 +03:00
|
|
|
size_t size() const { return m_size; }
|
|
|
|
size_t capacity() const { return m_capacity; }
|
2018-10-10 12:53:07 +03:00
|
|
|
|
2019-02-05 08:37:03 +03:00
|
|
|
T& at(size_t i) { ASSERT(i < m_size); return *slot(i); }
|
|
|
|
const T& at(size_t i) const { ASSERT(i < m_size); return *slot(i); }
|
2018-10-10 12:53:07 +03:00
|
|
|
|
2018-10-16 14:59:28 +03:00
|
|
|
void remove(size_t index)
|
2018-10-13 02:17:36 +03:00
|
|
|
{
|
|
|
|
ASSERT(index < m_size);
|
|
|
|
at(index).~T();
|
2018-10-16 14:59:28 +03:00
|
|
|
for (size_t i = index + 1; i < m_size; ++i) {
|
2018-10-16 13:10:01 +03:00
|
|
|
new (slot(i - 1)) T(move(at(i)));
|
2018-10-13 02:17:36 +03:00
|
|
|
at(i).~T();
|
|
|
|
}
|
|
|
|
|
|
|
|
--m_size;
|
|
|
|
}
|
|
|
|
|
2018-11-11 17:36:40 +03:00
|
|
|
//private:
|
2018-11-01 01:19:15 +03:00
|
|
|
friend class Vector<T, Allocator>;
|
2018-10-10 12:53:07 +03:00
|
|
|
|
2018-10-16 14:59:28 +03:00
|
|
|
VectorImpl(size_t capacity) : m_capacity(capacity) { }
|
2018-10-10 12:53:07 +03:00
|
|
|
|
|
|
|
T* tail() { return reinterpret_cast<T*>(this + 1); }
|
2018-10-16 14:59:28 +03:00
|
|
|
T* slot(size_t i) { return &tail()[i]; }
|
2018-10-10 12:53:07 +03:00
|
|
|
|
|
|
|
const T* tail() const { return reinterpret_cast<const T*>(this + 1); }
|
2018-10-16 14:59:28 +03:00
|
|
|
const T* slot(size_t i) const { return &tail()[i]; }
|
2018-10-10 12:53:07 +03:00
|
|
|
|
2018-10-16 14:59:28 +03:00
|
|
|
size_t m_size { 0 };
|
|
|
|
size_t m_capacity;
|
2018-10-10 12:53:07 +03:00
|
|
|
};
|
|
|
|
|
2018-11-01 01:19:15 +03:00
|
|
|
template<typename T, typename Allocator = KmallocAllocator>
|
2018-10-10 12:53:07 +03:00
|
|
|
class Vector {
|
|
|
|
public:
|
|
|
|
Vector() { }
|
|
|
|
~Vector() { clear(); }
|
|
|
|
|
|
|
|
Vector(Vector&& other)
|
2018-10-26 18:42:12 +03:00
|
|
|
: m_impl(other.m_impl)
|
2018-10-10 12:53:07 +03:00
|
|
|
{
|
2018-10-26 18:42:12 +03:00
|
|
|
other.m_impl = nullptr;
|
2018-10-10 12:53:07 +03:00
|
|
|
}
|
|
|
|
|
2018-11-05 12:23:00 +03:00
|
|
|
Vector(const Vector& other)
|
|
|
|
{
|
2019-01-20 00:53:05 +03:00
|
|
|
ensure_capacity(other.size());
|
2018-11-05 12:23:00 +03:00
|
|
|
for (size_t i = 0; i < other.size(); ++i)
|
|
|
|
unchecked_append(other[i]);
|
|
|
|
}
|
|
|
|
|
2018-10-10 12:53:07 +03:00
|
|
|
Vector& operator=(Vector&& other)
|
|
|
|
{
|
2018-10-26 18:42:12 +03:00
|
|
|
if (this != &other) {
|
|
|
|
m_impl = other.m_impl;
|
|
|
|
other.m_impl = nullptr;
|
|
|
|
}
|
2018-10-10 12:53:07 +03:00
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
void clear()
|
|
|
|
{
|
2018-10-16 14:59:28 +03:00
|
|
|
for (size_t i = 0; i < size(); ++i) {
|
2018-10-10 12:53:07 +03:00
|
|
|
at(i).~T();
|
|
|
|
}
|
2018-11-01 01:19:15 +03:00
|
|
|
Allocator::deallocate(m_impl);
|
2018-10-10 12:53:07 +03:00
|
|
|
m_impl = nullptr;
|
|
|
|
}
|
|
|
|
|
2019-01-12 09:22:25 +03:00
|
|
|
void clear_with_capacity()
|
|
|
|
{
|
|
|
|
if (!m_impl)
|
|
|
|
return;
|
|
|
|
for (size_t i = 0; i < size(); ++i)
|
|
|
|
at(i).~T();
|
|
|
|
m_impl->m_size = 0;
|
|
|
|
}
|
|
|
|
|
2018-11-03 02:31:42 +03:00
|
|
|
bool contains_slow(const T& value) const
|
|
|
|
{
|
|
|
|
for (size_t i = 0; i < size(); ++i) {
|
|
|
|
if (at(i) == value)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2018-12-21 04:10:45 +03:00
|
|
|
bool is_empty() const { return size() == 0; }
|
2018-10-16 14:59:28 +03:00
|
|
|
size_t size() const { return m_impl ? m_impl->size() : 0; }
|
|
|
|
size_t capacity() const { return m_impl ? m_impl->capacity() : 0; }
|
2018-10-10 12:53:07 +03:00
|
|
|
|
2018-10-28 00:42:20 +03:00
|
|
|
T* data() { return m_impl ? &at(0) : nullptr; }
|
|
|
|
const T* data() const { return m_impl ? &at(0) : nullptr; }
|
|
|
|
|
2018-10-16 14:59:28 +03:00
|
|
|
const T& at(size_t i) const { return m_impl->at(i); }
|
|
|
|
T& at(size_t i) { return m_impl->at(i); }
|
2018-10-10 12:53:07 +03:00
|
|
|
|
2018-10-16 14:59:28 +03:00
|
|
|
const T& operator[](size_t i) const { return at(i); }
|
|
|
|
T& operator[](size_t i) { return at(i); }
|
2018-10-10 12:53:07 +03:00
|
|
|
|
|
|
|
const T& first() const { return at(0); }
|
|
|
|
T& first() { return at(0); }
|
|
|
|
|
|
|
|
const T& last() const { return at(size() - 1); }
|
|
|
|
T& last() { return at(size() - 1); }
|
|
|
|
|
2019-01-20 00:53:05 +03:00
|
|
|
T take_last()
|
2018-10-10 12:53:07 +03:00
|
|
|
{
|
2018-12-21 04:10:45 +03:00
|
|
|
ASSERT(!is_empty());
|
2018-10-16 13:10:01 +03:00
|
|
|
T value = move(last());
|
2018-10-10 12:53:07 +03:00
|
|
|
last().~T();
|
|
|
|
--m_impl->m_size;
|
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
2019-01-14 04:49:30 +03:00
|
|
|
T take_first()
|
|
|
|
{
|
|
|
|
ASSERT(!is_empty());
|
|
|
|
T value = move(first());
|
|
|
|
remove(0);
|
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
2018-10-16 14:59:28 +03:00
|
|
|
void remove(size_t index)
|
2018-10-13 02:17:36 +03:00
|
|
|
{
|
|
|
|
m_impl->remove(index);
|
|
|
|
}
|
|
|
|
|
2018-11-13 03:36:31 +03:00
|
|
|
Vector& operator=(const Vector<T>& other)
|
|
|
|
{
|
|
|
|
if (this != &other) {
|
|
|
|
clear();
|
2019-01-20 00:53:05 +03:00
|
|
|
ensure_capacity(other.size());
|
2018-11-13 03:36:31 +03:00
|
|
|
for (const auto& v : other)
|
|
|
|
unchecked_append(v);
|
|
|
|
}
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
2018-10-28 12:26:07 +03:00
|
|
|
void append(Vector<T>&& other)
|
|
|
|
{
|
|
|
|
Vector<T> tmp = move(other);
|
2019-01-20 00:53:05 +03:00
|
|
|
ensure_capacity(size() + tmp.size());
|
2018-10-28 12:26:07 +03:00
|
|
|
for (auto&& v : tmp) {
|
2018-11-05 12:23:00 +03:00
|
|
|
unchecked_append(move(v));
|
2018-10-28 12:26:07 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-11-05 12:23:00 +03:00
|
|
|
void unchecked_append(T&& value)
|
2018-10-28 12:26:07 +03:00
|
|
|
{
|
2018-12-27 00:02:24 +03:00
|
|
|
ASSERT((size() + 1) <= capacity());
|
2018-10-28 12:26:07 +03:00
|
|
|
new (m_impl->slot(m_impl->m_size)) T(move(value));
|
|
|
|
++m_impl->m_size;
|
|
|
|
}
|
|
|
|
|
2018-11-05 12:23:00 +03:00
|
|
|
void unchecked_append(const T& value)
|
|
|
|
{
|
|
|
|
new (m_impl->slot(m_impl->m_size)) T(value);
|
|
|
|
++m_impl->m_size;
|
|
|
|
}
|
|
|
|
|
2018-10-10 12:53:07 +03:00
|
|
|
void append(T&& value)
|
|
|
|
{
|
2019-01-20 00:53:05 +03:00
|
|
|
ensure_capacity(size() + 1);
|
2018-10-16 13:10:01 +03:00
|
|
|
new (m_impl->slot(m_impl->m_size)) T(move(value));
|
2018-10-10 12:53:07 +03:00
|
|
|
++m_impl->m_size;
|
|
|
|
}
|
|
|
|
|
|
|
|
void append(const T& value)
|
|
|
|
{
|
2019-01-20 00:53:05 +03:00
|
|
|
ensure_capacity(size() + 1);
|
2018-10-10 12:53:07 +03:00
|
|
|
new (m_impl->slot(m_impl->m_size)) T(value);
|
|
|
|
++m_impl->m_size;
|
|
|
|
}
|
|
|
|
|
2018-11-16 19:56:18 +03:00
|
|
|
void append(const T* values, size_t count)
|
|
|
|
{
|
2019-01-20 00:53:05 +03:00
|
|
|
ensure_capacity(size() + count);
|
2018-11-16 19:56:18 +03:00
|
|
|
for (size_t i = 0; i < count; ++i)
|
|
|
|
new (m_impl->slot(m_impl->m_size + i)) T(values[i]);
|
|
|
|
m_impl->m_size += count;
|
|
|
|
}
|
|
|
|
|
2019-01-20 00:53:05 +03:00
|
|
|
void ensure_capacity(size_t neededCapacity)
|
2018-10-10 12:53:07 +03:00
|
|
|
{
|
|
|
|
if (capacity() >= neededCapacity)
|
|
|
|
return;
|
2019-01-20 00:53:05 +03:00
|
|
|
size_t new_capacity = padded_capacity(neededCapacity);
|
2019-01-31 19:31:23 +03:00
|
|
|
auto new_impl = VectorImpl<T, Allocator>::create(new_capacity);
|
2018-10-10 12:53:07 +03:00
|
|
|
if (m_impl) {
|
2019-01-31 19:31:23 +03:00
|
|
|
new_impl->m_size = m_impl->m_size;
|
2018-10-16 14:59:28 +03:00
|
|
|
for (size_t i = 0; i < size(); ++i) {
|
2019-01-31 19:31:23 +03:00
|
|
|
new (new_impl->slot(i)) T(move(m_impl->at(i)));
|
2018-10-10 12:53:07 +03:00
|
|
|
m_impl->at(i).~T();
|
|
|
|
}
|
2018-11-01 01:19:15 +03:00
|
|
|
Allocator::deallocate(m_impl);
|
2018-10-10 12:53:07 +03:00
|
|
|
}
|
2019-01-31 19:31:23 +03:00
|
|
|
m_impl = new_impl;
|
2018-10-10 12:53:07 +03:00
|
|
|
}
|
|
|
|
|
2018-11-01 15:39:28 +03:00
|
|
|
void resize(size_t new_size)
|
|
|
|
{
|
|
|
|
ASSERT(new_size >= size());
|
|
|
|
if (!new_size)
|
|
|
|
return;
|
2019-01-20 00:53:05 +03:00
|
|
|
ensure_capacity(new_size);
|
2018-11-01 15:39:28 +03:00
|
|
|
for (size_t i = size(); i < new_size; ++i)
|
|
|
|
new (m_impl->slot(i)) T;
|
|
|
|
m_impl->m_size = new_size;
|
|
|
|
}
|
|
|
|
|
2018-10-10 12:53:07 +03:00
|
|
|
class Iterator {
|
|
|
|
public:
|
|
|
|
bool operator!=(const Iterator& other) { return m_index != other.m_index; }
|
|
|
|
Iterator& operator++() { ++m_index; return *this; }
|
|
|
|
T& operator*() { return m_vector[m_index]; }
|
|
|
|
private:
|
|
|
|
friend class Vector;
|
2018-10-16 14:59:28 +03:00
|
|
|
Iterator(Vector& vector, size_t index) : m_vector(vector), m_index(index) { }
|
2018-10-10 12:53:07 +03:00
|
|
|
Vector& m_vector;
|
2018-10-16 14:59:28 +03:00
|
|
|
size_t m_index { 0 };
|
2018-10-10 12:53:07 +03:00
|
|
|
};
|
|
|
|
|
|
|
|
Iterator begin() { return Iterator(*this, 0); }
|
|
|
|
Iterator end() { return Iterator(*this, size()); }
|
|
|
|
|
|
|
|
class ConstIterator {
|
|
|
|
public:
|
|
|
|
bool operator!=(const ConstIterator& other) { return m_index != other.m_index; }
|
|
|
|
ConstIterator& operator++() { ++m_index; return *this; }
|
|
|
|
const T& operator*() const { return m_vector[m_index]; }
|
|
|
|
private:
|
|
|
|
friend class Vector;
|
2018-10-16 14:59:28 +03:00
|
|
|
ConstIterator(const Vector& vector, const size_t index) : m_vector(vector), m_index(index) { }
|
2018-10-10 12:53:07 +03:00
|
|
|
const Vector& m_vector;
|
2018-10-16 14:59:28 +03:00
|
|
|
size_t m_index { 0 };
|
2018-10-10 12:53:07 +03:00
|
|
|
};
|
|
|
|
|
2018-10-13 02:17:36 +03:00
|
|
|
ConstIterator begin() const { return ConstIterator(*this, 0); }
|
|
|
|
ConstIterator end() const { return ConstIterator(*this, size()); }
|
2018-10-10 12:53:07 +03:00
|
|
|
|
2018-11-11 17:36:40 +03:00
|
|
|
//private:
|
2019-01-20 00:53:05 +03:00
|
|
|
static size_t padded_capacity(size_t capacity)
|
2018-10-10 12:53:07 +03:00
|
|
|
{
|
2018-10-16 14:59:28 +03:00
|
|
|
return max(size_t(4), capacity + (capacity / 4) + 4);
|
2018-10-10 12:53:07 +03:00
|
|
|
}
|
|
|
|
|
2018-11-01 01:19:15 +03:00
|
|
|
VectorImpl<T, Allocator>* m_impl { nullptr };
|
2018-10-10 12:53:07 +03:00
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
using AK::Vector;
|
2018-11-01 01:19:15 +03:00
|
|
|
using AK::KmallocEternalAllocator;
|
|
|
|
using AK::KmallocAllocator;
|