vector
parent
6bea6f87f5
commit
e320355d62
|
@ -14,6 +14,7 @@
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
#include <string_view>
|
#include <string_view>
|
||||||
#include "memory.h"
|
#include "memory.h"
|
||||||
|
#include "vector.h"
|
||||||
#include <variant>
|
#include <variant>
|
||||||
|
|
||||||
namespace blt::string
|
namespace blt::string
|
||||||
|
|
|
@ -21,6 +21,7 @@
|
||||||
|
|
||||||
#include <iterator>
|
#include <iterator>
|
||||||
#include <blt/std/memory_util.h>
|
#include <blt/std/memory_util.h>
|
||||||
|
#include "ranges.h"
|
||||||
|
|
||||||
namespace blt
|
namespace blt
|
||||||
{
|
{
|
||||||
|
@ -145,7 +146,7 @@ namespace blt
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
template<typename T, typename ALLOC>
|
template<typename T, typename ALLOC = std::allocator<T>>
|
||||||
class vector
|
class vector
|
||||||
{
|
{
|
||||||
private:
|
private:
|
||||||
|
@ -154,6 +155,14 @@ namespace blt
|
||||||
size_t capacity_ = 0;
|
size_t capacity_ = 0;
|
||||||
size_t size_ = 0;
|
size_t size_ = 0;
|
||||||
|
|
||||||
|
using value_type = T;
|
||||||
|
using allocator_type = ALLOC;
|
||||||
|
using size_type = size_t;
|
||||||
|
using difference_type = std::ptrdiff_t;
|
||||||
|
using reference = value_type&;
|
||||||
|
using const_reference = const value_type&;
|
||||||
|
using pointer = value_type*;
|
||||||
|
using const_pointer = const pointer;
|
||||||
using iterator = T*;
|
using iterator = T*;
|
||||||
using const_iterator = const T*;
|
using const_iterator = const T*;
|
||||||
using reverse_iterator = std::reverse_iterator<iterator>;
|
using reverse_iterator = std::reverse_iterator<iterator>;
|
||||||
|
@ -182,6 +191,28 @@ namespace blt
|
||||||
buffer_ = allocator.allocate(capacity_);
|
buffer_ = allocator.allocate(capacity_);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
template<typename G, std::enable_if_t<std::is_convertible_v<G, T>, bool> = true>
|
||||||
|
constexpr vector(std::initializer_list<G>&& list): size_(list.size()), capacity_(list.size())
|
||||||
|
{
|
||||||
|
buffer_ = allocator.allocate(capacity_);
|
||||||
|
for (auto e : blt::enumerate(list))
|
||||||
|
buffer_[e.first] = e.second;
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename G, std::enable_if_t<std::is_same_v<blt::vector<T>, G> || std::is_same_v<std::vector<T>, G>, bool> = true>
|
||||||
|
constexpr explicit vector(const G& copy): size_(copy.size()), capacity_(copy.capacity())
|
||||||
|
{
|
||||||
|
buffer_ = allocator.allocate(capacity_);
|
||||||
|
for (auto e : blt::enumerate(copy))
|
||||||
|
buffer_[e.first] = e.second;
|
||||||
|
}
|
||||||
|
|
||||||
|
template<typename G, std::enable_if_t<std::is_same_v<blt::vector<T>, G> || std::is_same_v<std::vector<T>, G>, bool> = true>
|
||||||
|
constexpr explicit vector(G&& move): size_(move.size()), capacity_(move.capacity()), buffer_(move.buffer_)
|
||||||
|
{
|
||||||
|
move.buffer_ = nullptr;
|
||||||
|
}
|
||||||
|
|
||||||
~vector()
|
~vector()
|
||||||
{
|
{
|
||||||
allocator.deallocate(buffer_, capacity_);
|
allocator.deallocate(buffer_, capacity_);
|
||||||
|
@ -206,7 +237,7 @@ namespace blt
|
||||||
{
|
{
|
||||||
if (size_ >= capacity_)
|
if (size_ >= capacity_)
|
||||||
expand();
|
expand();
|
||||||
buffer_[size_++] = T{std::forward<Args>(args)...};
|
new(&buffer_[size_++]) T(std::forward<Args>(args)...);
|
||||||
}
|
}
|
||||||
|
|
||||||
constexpr inline T& at(size_t index)
|
constexpr inline T& at(size_t index)
|
||||||
|
@ -217,6 +248,14 @@ namespace blt
|
||||||
return buffer_[index];
|
return buffer_[index];
|
||||||
}
|
}
|
||||||
|
|
||||||
|
constexpr inline const T& at(size_t index) const
|
||||||
|
{
|
||||||
|
if (index >= capacity_)
|
||||||
|
throw std::runtime_error(
|
||||||
|
"Array index " + std::to_string(index) + " out of bounds! (Max size: " + std::to_string(capacity_) + ')');
|
||||||
|
return buffer_[index];
|
||||||
|
}
|
||||||
|
|
||||||
constexpr inline T& operator[](size_t index)
|
constexpr inline T& operator[](size_t index)
|
||||||
{
|
{
|
||||||
return buffer_[index];
|
return buffer_[index];
|
||||||
|
|
Loading…
Reference in New Issue