118 lines
3.4 KiB
C
118 lines
3.4 KiB
C
/**
|
|
* @file Vector_impl.h
|
|
* @author Ambroz Bizjak <ambrop7@gmail.com>
|
|
*
|
|
* @section LICENSE
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the author nor the
|
|
* names of its contributors may be used to endorse or promote products
|
|
* derived from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
|
|
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
* DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
|
|
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
|
|
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "Vector_header.h"
|
|
|
|
static int Vector_Init (Vector *o, size_t capacity)
|
|
{
|
|
if (capacity == 0) {
|
|
o->elems = NULL;
|
|
} else {
|
|
o->elems = BAllocArray(capacity, sizeof(VectorElem));
|
|
if (!o->elems) {
|
|
return 0;
|
|
}
|
|
}
|
|
o->capacity = capacity;
|
|
o->count = 0;
|
|
return 1;
|
|
}
|
|
|
|
static void Vector_Free (Vector *o)
|
|
{
|
|
BFree(o->elems);
|
|
}
|
|
|
|
static size_t Vector_Count (Vector *o)
|
|
{
|
|
return o->count;
|
|
}
|
|
|
|
static VectorElem * Vector_Get (Vector *o, size_t index)
|
|
{
|
|
ASSERT(index < o->capacity)
|
|
|
|
return &o->elems[index];
|
|
}
|
|
|
|
static int Vector_Reserve (Vector *o, size_t capacity)
|
|
{
|
|
if (capacity > o->capacity) {
|
|
size_t new_capacity = o->capacity;
|
|
do {
|
|
if (new_capacity > SIZE_MAX / 2) {
|
|
return 0;
|
|
}
|
|
new_capacity = (new_capacity == 0) ? 1 : (2 * new_capacity);
|
|
} while (capacity > new_capacity);
|
|
|
|
VectorElem *new_elems = BAllocArray(new_capacity, sizeof(VectorElem));
|
|
if (!new_elems) {
|
|
return 0;
|
|
}
|
|
|
|
if (o->count > 0) {
|
|
memcpy(new_elems, o->elems, o->count * sizeof(VectorElem));
|
|
}
|
|
|
|
BFree(o->elems);
|
|
|
|
o->elems = new_elems;
|
|
o->capacity = new_capacity;
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
|
|
static VectorElem * Vector_Push (Vector *o, size_t *out_index)
|
|
{
|
|
if (o->count == SIZE_MAX || !Vector_Reserve(o, o->count + 1)) {
|
|
return NULL;
|
|
}
|
|
if (out_index) {
|
|
*out_index = o->count;
|
|
}
|
|
VectorElem *ptr = &o->elems[o->count];
|
|
o->count++;
|
|
return ptr;
|
|
}
|
|
|
|
static VectorElem * Vector_Pop (Vector *o, size_t *out_index)
|
|
{
|
|
ASSERT(o->count > 0)
|
|
|
|
o->count--;
|
|
if (out_index) {
|
|
*out_index = o->count;
|
|
}
|
|
return &o->elems[o->count];
|
|
}
|
|
|
|
#include "Vector_footer.h"
|