Go to the documentation of this file.
35 ::operator
delete(
start);
67 const void* first,
const size_t n);
79 const size_t n = position -
start;
109 template<>
inline void
113 if (positions.
size() == 0)
118 while (pos != lastpos)
125 if (positions.
size() != values.
size())
126 throw BCP_fatal_error(
"BCP_vec::update() called with unequal sizes.\n");
141 const size_t len = last - first;
142 memmove(
start, first, len *
sizeof(
int));
164 if (position + 1 !=
finish)
165 memmove(position, position + 1, ((
finish-position) - 1) *
sizeof(
int));
171 if (first != last && last !=
finish)
172 memmove(first, last, (
finish - last) *
sizeof(
int));
BCP_vec< T > & operator=(const BCP_vec< T > &x)
Copy the contents of x into the object and return a reference the the object itself.
void unchecked_update(const BCP_vec< int > &positions, const BCP_vec< T > &values)
Same as the previous method but without sanity checks.
The class BCP_vec serves the same purpose as the vector class in the standard template library.
void assign(const void *x, const size_t num)
Copy num entries of type T starting at the memory location x into the object.
void unchecked_push_back(const_reference x)
Append x to the end of the vector.
size_t size() const
Return the current number of entries.
void erase(iterator pos)
Erase the entry pointed to by pos.
iterator begin()
Return an iterator to the beginning of the object.
iterator start
Iterator pointing to the beginning of the memory array where the vector is stored.
void push_back(const_reference x)
Append x to the end of the vector.
void update(const BCP_vec< int > &positions, const BCP_vec< T > &values)
Update those entries listed in positions to the given values.
void deallocate()
Destroy the entries in the vector and free the memory allocated for the vector.
void reserve(const size_t n)
Reallocate the object to make space for n entries.
void BCP_vec_sanity_check(BCP_vec< int >::const_iterator firstpos, BCP_vec< int >::const_iterator lastpos, const int maxsize)
A helper function to test whether a set positions is sane for a vector.
void insert_aux(iterator position, const_reference x)
insert x into the given position in the vector.
iterator finish
Iterator pointing to right after the last entry in the vector.
void keep(iterator pos)
Keep only the entry pointed to by pos.
void insert(iterator position, const void *first, const size_t num)
Insert num entries starting from memory location first into the vector from position pos.
const typedef T * const_iterator
iterator end_of_storage
Iterator pointing to right after the last memory location usable by the vector without reallocation.
reference operator[](const size_t i)
Return a reference to the i-th entry.
BCP_vec()
The default constructor initializes the data members as 0 pointers.
void pop_back()
Delete the last entry.
iterator end()
Return an iterator to the end of the object.
Currently there isn't any error handling in BCP.