5 #ifndef _BITCOIN_PREVECTOR_H_
6 #define _BITCOIN_PREVECTOR_H_
34 template<
unsigned int N,
typename T,
typename Size = u
int32_t,
typename Diff =
int32_t>
163 if (new_capacity <= N) {
181 char* new_indirect =
static_cast<char*
>(malloc(((
size_t)
sizeof(T)) * new_capacity));
182 assert(new_indirect);
184 T* dst =
reinterpret_cast<T*
>(new_indirect);
208 template<
typename InputIterator>
209 void assign(InputIterator first, InputIterator last) {
215 while (first != last) {
217 new(
static_cast<void*
>(
item_ptr(
size() - 1))) T(*first);
236 template<
typename InputIterator>
240 while (first != last) {
242 new(
static_cast<void*
>(
item_ptr(
size() - 1))) T(*first);
250 while (it != other.
end()) {
262 if (&other ==
this) {
268 while (it != other.
end()) {
316 if (
size() > new_size) {
322 while (
size() < new_size) {
350 new(
static_cast<void*
>(
item_ptr(p))) T(value);
363 new(
static_cast<void*
>(
item_ptr(p + i))) T(value);
367 template<
typename InputIterator>
377 while (first != last) {
378 new(
static_cast<void*
>(
item_ptr(p))) T(*first);
385 return erase(pos, pos + 1);
390 char* endp = (
char*)&(*
end());
396 memmove(&(*first), &(*last), endp - ((
char*)(&(*last))));
450 if ((*b1) != (*b2)) {
460 return !(*
this == other);
bool operator==(const_iterator x) const
bool operator<(const_iterator x) const
std::random_access_iterator_tag iterator_category
const_iterator operator--(int)
bool operator<=(const_iterator x) const
const_iterator & operator++()
const_iterator operator++(int)
const_iterator & operator--()
const_iterator(const T *ptr_)
difference_type friend operator-(const_iterator a, const_iterator b)
bool operator!=(const_iterator x) const
const_iterator operator+(size_type n)
const_iterator & operator-=(size_type n)
bool operator>=(const_iterator x) const
const_iterator operator-(size_type n)
const T & operator*() const
const T & operator[](size_type pos) const
const_iterator & operator+=(size_type n)
const T * operator->() const
bool operator>(const_iterator x) const
const_iterator(iterator x)
const_reverse_iterator & operator++()
const_reverse_iterator & operator--()
const T & operator*() const
const T * operator->() const
const_reverse_iterator operator--(int)
const_reverse_iterator operator++(int)
const_reverse_iterator(T *ptr_)
std::bidirectional_iterator_tag iterator_category
const_reverse_iterator(reverse_iterator x)
bool operator!=(const_reverse_iterator x) const
bool operator==(const_reverse_iterator x) const
bool operator<(iterator x) const
const T & operator[](size_type pos) const
bool operator==(iterator x) const
difference_type friend operator-(iterator a, iterator b)
bool operator!=(iterator x) const
iterator operator-(size_type n)
bool operator<=(iterator x) const
bool operator>=(iterator x) const
iterator & operator-=(size_type n)
iterator & operator+=(size_type n)
bool operator>(iterator x) const
std::random_access_iterator_tag iterator_category
T & operator[](size_type pos)
iterator operator+(size_type n)
std::bidirectional_iterator_tag iterator_category
reverse_iterator operator++(int)
const T * operator->() const
reverse_iterator & operator++()
const T & operator*() const
bool operator!=(reverse_iterator x) const
reverse_iterator & operator--()
reverse_iterator(T *ptr_)
bool operator==(reverse_iterator x) const
reverse_iterator operator--(int)
Implements a drop-in replacement for std::vector<T> which stores up to N elements directly (without h...
prevector(size_type n, const T &val=T())
T & operator[](size_type pos)
prevector(prevector< N, T, Size, Diff > &&other)
void change_capacity(size_type new_capacity)
iterator erase(iterator first, iterator last)
prevector(InputIterator first, InputIterator last)
T * direct_ptr(difference_type pos)
const T & operator[](size_type pos) const
void swap(prevector< N, T, Size, Diff > &other)
prevector & operator=(const prevector< N, T, Size, Diff > &other)
union prevector::direct_or_indirect _union
const value_type & const_reference
const T * indirect_ptr(difference_type pos) const
const T * item_ptr(difference_type pos) const
T * item_ptr(difference_type pos)
const T * direct_ptr(difference_type pos) const
bool operator==(const prevector< N, T, Size, Diff > &other) const
iterator erase(iterator pos)
const_iterator end() const
void assign(InputIterator first, InputIterator last)
void insert(iterator pos, InputIterator first, InputIterator last)
bool operator<(const prevector< N, T, Size, Diff > &other) const
const value_type * data() const
bool operator!=(const prevector< N, T, Size, Diff > &other) const
void reserve(size_type new_capacity)
prevector(const prevector< N, T, Size, Diff > &other)
const_reverse_iterator rbegin() const
void resize(size_type new_size)
size_t allocated_memory() const
iterator insert(iterator pos, const T &value)
reverse_iterator rbegin()
const_reverse_iterator rend() const
const value_type * const_pointer
T * indirect_ptr(difference_type pos)
void assign(size_type n, const T &val)
prevector & operator=(prevector< N, T, Size, Diff > &&other)
void insert(iterator pos, size_type count, const T &value)
void push_back(const T &value)
const_iterator begin() const
void * memcpy(void *a, const void *b, size_t c)
void * memmove(void *a, const void *b, size_t c)
char direct[sizeof(T) *N]