erase() function should be fairly good
This commit is contained in:
+35
-12
@@ -12,16 +12,17 @@
|
||||
* > at() Returns an indexed element from a vector
|
||||
* > back() Returns the last element of a vector
|
||||
* > begin() Returns an iterator pointing to the beginning of a vector
|
||||
* > capacity() Returns the number of elements that a vector's reserved memory
|
||||
* is able to store > front() Returns the first element of a vector > end()
|
||||
* Returns an iterator pointing to the end of a vector > push_back() Adds an
|
||||
* element to the end of a vector > size() Returns the number of elements
|
||||
* in a vector
|
||||
* > capacity() Returns the number of elements that a vector's reserved memory is able to store
|
||||
* > front() Returns the first element of a vector
|
||||
* > end() Returns an iterator pointing to the end of a vector
|
||||
* > push_back() Adds an element to the end of a vector
|
||||
* > size() Returns the number of elements in a vector
|
||||
* > clear() Removes all of the contents of a vector
|
||||
* > empty() Checks whether a vector is empty or not
|
||||
*
|
||||
* assign() Fills a vector with multiple values
|
||||
* clear() Removes all of the contents of a vector
|
||||
* data() Returns a pointer to the block of memory where a vector's elements are
|
||||
* stored empty() Checks whether a vector is empty or not erase() Removes
|
||||
* stored erase() Removes
|
||||
* a number of elements from a vector insert() Inserts a number of elements
|
||||
* into a vector max_size() Returns the maximum number of elements that a
|
||||
* vector can have pop_back() Removes the last element of a vector rbegin()
|
||||
@@ -124,6 +125,19 @@ at(const Vec8_t* vec, const int idx)
|
||||
return -1;
|
||||
}
|
||||
|
||||
Vec8_t*
|
||||
erase(Vec8_t* vec, const int iter) {
|
||||
/*
|
||||
* Clear the value at iter to 0
|
||||
* shift all the values in the vector over to the left one
|
||||
* */
|
||||
if(vec == nullptr) return nullptr;
|
||||
if(vec->arr == nullptr) return nullptr;
|
||||
vec->arr[iter] = 0;
|
||||
memmove(&vec[iter], &vec[iter + 1], (vec->size * sizeof(char)) -1);
|
||||
return vec;
|
||||
}
|
||||
|
||||
void
|
||||
print_vec(const Vec8_t* vec)
|
||||
{
|
||||
@@ -173,6 +187,15 @@ back(const Vec8_t* vec)
|
||||
return -1;
|
||||
}
|
||||
|
||||
int
|
||||
empty(const Vec8_t* vec) {
|
||||
|
||||
if(vec->size > 0) {
|
||||
return 1;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
|
||||
Vec8_t
|
||||
add_back(Vec8_t* vec, const char val)
|
||||
{
|
||||
@@ -201,11 +224,11 @@ main()
|
||||
vec = add_back(&vec, '6');
|
||||
vec = add_back(&vec, '8');
|
||||
vec = add_back(&vec, '6');
|
||||
clear(&vec);
|
||||
for(int i = 0; i < vec.size; i++) {
|
||||
printf("%i\n", at(&vec, i));
|
||||
}
|
||||
// print_vec(&vec);
|
||||
vec = *erase(&vec, begin(&vec) + 2);
|
||||
// for(int i = 0; i < vec.size; i++) {
|
||||
// printf("%i\n", at(&vec, i));
|
||||
// }
|
||||
print_vec(&vec);
|
||||
// printf("%c", at(nullptr, 0));
|
||||
|
||||
delete(&vec);
|
||||
|
||||
Reference in New Issue
Block a user