emileclarkb/hammer
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Renamed more types

Browse source
This commit is contained in:
Dan Hirsch 2012-05-26 13:01:23 +02:00
parent b10ef575e2
commit 199cde7058
9 changed files with 377 additions and 379 deletions
Download patch file Download diff file Expand all files Collapse all files

10
src/datastructures.c
View file

@ -6,8 +6,8 @@
// {{{ counted arrays
counted_array_t *carray_new_sized(arena_t arena, size_t size) {
counted_array_t *ret = arena_malloc(arena, sizeof(counted_array_t));
HCountedArray *carray_new_sized(HArena * arena, size_t size) {
HCountedArray *ret = arena_malloc(arena, sizeof(HCountedArray));
assert(size > 0);
ret->used = 0;
ret->capacity = size;
@ -15,13 +15,13 @@ counted_array_t *carray_new_sized(arena_t arena, size_t size) {
ret->elements = arena_malloc(arena, sizeof(void*) * size);
return ret;
}
counted_array_t *carray_new(arena_t arena) {
HCountedArray *carray_new(HArena * arena) {
return carray_new_sized(arena, 4);
}
void carray_append(counted_array_t *array, void* item) {
void carray_append(HCountedArray *array, void* item) {
if (array->used >= array->capacity) {
parsed_token_t **elements = arena_malloc(array->arena, (array->capacity *= 2) * sizeof(counted_array_t*));
HParsedToken **elements = arena_malloc(array->arena, (array->capacity *= 2) * sizeof(HCountedArray*));
for (size_t i = 0; i < array->used; i++)
elements[i] = array->elements[i];
for (size_t i = array->used; i < array->capacity; i++)