template.h

Go to the documentation of this file.

 
#include <stddef.h>
#include <stdint.h>
#include <string.h>
 
#include <derive-c/core/helpers.h>
#include <derive-c/core/panic.h>
 
#include <derive-c/core/self/def.h>
 
#if !defined ITEM
    #if !defined __clang_analyzer__
        #error "ITEM must be defined"
    #endif
typedef struct {
    int x;
} item_t;
    #define ITEM item_t
static void item_delete(item_t* UNUSED(self)) {}
    #define ITEM_DELETE item_delete
static item_t item_clone(item_t const* self) { return *self; }
    #define ITEM_CLONE item_clone
#endif
 
#if !defined ITEM_DELETE
    #define ITEM_DELETE(value)
#endif
 
#if !defined ITEM_CLONE
    #define ITEM_CLONE(value) (*(value))
#endif
 
#if !defined INPLACE_CAPACITY
    #if !defined __clang_analyzer__
        #error "The number of elements to store in-place must be defined"
    #endif
    #define INPLACE_CAPACITY 8
#endif
 
#if INPLACE_CAPACITY <= 255
    #define INPLACE_TYPE uint8_t
#elif INPLACE_CAPACITY <= 65535
    #define INPLACE_TYPE uint16_t
#else
    #error "INPLACE_CAPACITY must be less than or equal to 65535"
    #define INPLACE_TYPE size_t
#endif
 
typedef struct {
    INPLACE_TYPE size;
    ITEM data[INPLACE_CAPACITY];
    gdb_marker derive_c_staticvec;
} SELF;
 
static SELF NS(SELF, new)() { return (SELF){.size = 0}; }
 
static const INPLACE_TYPE NS(SELF, max_size) = INPLACE_CAPACITY;
 
static SELF NS(SELF, clone)(SELF const* self) {
    SELF new_self = NS(SELF, new)();
    new_self.size = self->size;
    for (INPLACE_TYPE i = 0; i < self->size; i++) {
        new_self.data[i] = ITEM_CLONE(&self->data[i]);
    }
    return new_self;
}
 
static ITEM const* NS(SELF, try_read)(SELF const* self, INPLACE_TYPE index) {
    DEBUG_ASSERT(self);
    if (LIKELY(index < self->size)) {
        return &self->data[index];
    }
    return NULL;
}
 
static ITEM const* NS(SELF, read)(SELF const* self, INPLACE_TYPE index) {
    ITEM const* value = NS(SELF, try_read)(self, index);
    ASSERT(value);
    return value;
}
 
static ITEM* NS(SELF, try_write)(SELF* self, INPLACE_TYPE index) {
    DEBUG_ASSERT(self);
    if (LIKELY(index < self->size)) {
        return &self->data[index];
    }
    return NULL;
}
 
static ITEM* NS(SELF, write)(SELF* self, INPLACE_TYPE index) {
    ITEM* value = NS(SELF, try_write)(self, index);
    ASSERT(value);
    return value;
}
 
static ITEM* NS(SELF, try_push)(SELF* self, ITEM item) {
    DEBUG_ASSERT(self);
    if (self->size < INPLACE_CAPACITY) {
        ITEM* slot = &self->data[self->size];
        *slot = item;
        self->size++;
        return slot;
    }
    return NULL;
}
 
static bool NS(SELF, try_insert_at)(SELF* self, size_t at, ITEM const* items, size_t count) {
    DEBUG_ASSERT(self);
    DEBUG_ASSERT(items);
    ASSERT(at <= self->size);
 
    if (self->size + count > INPLACE_CAPACITY) {
        return false;
    }
 
    memmove(&self->data[at + count], &self->data[at], (self->size - at) * sizeof(ITEM));
    memcpy(&self->data[at], items, count * sizeof(ITEM));
    self->size += count;
    return true;
}
 
static void NS(SELF, remove_at)(SELF* self, size_t at, size_t count) {
    DEBUG_ASSERT(self);
    ASSERT(at + count <= self->size);
 
    if (count == 0) {
        return;
    }
 
    for (size_t i = at; i < at + count; i++) {
        ITEM_DELETE(&self->data[i]);
    }
 
    memmove(&self->data[at], &self->data[at + count], (self->size - (at + count)) * sizeof(ITEM));
    self->size -= count;
}
 
static ITEM* NS(SELF, push)(SELF* self, ITEM item) {
    ITEM* slot = NS(SELF, try_push)(self, item);
    ASSERT(slot);
    return slot;
}
 
static bool NS(SELF, try_pop)(SELF* self, ITEM* destination) {
    DEBUG_ASSERT(self);
    if (LIKELY(self->size > 0)) {
        self->size--;
        *destination = self->data[self->size];
        return true;
    }
    return false;
}
 
static ITEM NS(SELF, pop)(SELF* self) {
    ITEM entry;
    ASSERT(NS(SELF, try_pop)(self, &entry));
    return entry;
}
 
static size_t NS(SELF, size)(SELF const* self) {
    DEBUG_ASSERT(self);
    return self->size;
}
 
static void NS(SELF, delete)(SELF* self) {
    DEBUG_ASSERT(self);
    for (INPLACE_TYPE i = 0; i < self->size; i++) {
        ITEM_DELETE(&self->data[i]);
    }
}
 
#define ITER NS(SELF, iter)
 
typedef struct {
    SELF* vec;
    size_t pos;
} ITER;
 
static ITEM* NS(ITER, next)(ITER* iter) {
    DEBUG_ASSERT(iter);
    if (iter->pos < iter->vec->size) {
        ITEM* item = &iter->vec->data[iter->pos];
        iter->pos++;
        return item;
    }
    return NULL;
}
 
static size_t NS(ITER, position)(ITER const* iter) {
    DEBUG_ASSERT(iter);
    return iter->pos;
}
 
static bool NS(ITER, empty)(ITER const* iter) {
    DEBUG_ASSERT(iter);
    return iter->pos >= iter->vec->size;
}
 
static ITER NS(SELF, get_iter)(SELF* self) {
    DEBUG_ASSERT(self);
    return (ITER){
        .vec = self,
        .pos = 0,
    };
}
 
#undef ITER
 
#define ITER_CONST NS(SELF, iter_const)
 
typedef struct {
    SELF const* vec;
    size_t pos;
} ITER_CONST;
 
static ITEM const* NS(ITER_CONST, next)(ITER_CONST* iter) {
    DEBUG_ASSERT(iter);
    if (iter->pos < iter->vec->size) {
        ITEM const* item = &iter->vec->data[iter->pos];
        iter->pos++;
        return item;
    }
    return NULL;
}
 
static size_t NS(ITER_CONST, position)(ITER_CONST const* iter) {
    DEBUG_ASSERT(iter);
    return iter->pos;
}
 
static bool NS(ITER_CONST, empty)(ITER_CONST const* iter) {
    DEBUG_ASSERT(iter);
    return iter->pos >= iter->vec->size;
}
 
static ITER_CONST NS(SELF, get_iter_const)(SELF const* self) {
    DEBUG_ASSERT(self);
    return (ITER_CONST){
        .vec = self,
        .pos = 0,
    };
}
 
#undef ITER_CONST
 
#undef INPLACE_TYPE
#undef INPLACE_CAPACITY
 
#undef ITEM
#undef ITEM_DELETE
#undef ITEM_CLONE
 
#include <derive-c/core/self/undef.h>