StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POTask to create flexible (dynamic memory allocation) array
primarykey
Id
10434832
data
AcceptedAnswerId
10435054
AnswerCount
3
ClosedDate
CommentCount
4
CommunityOwnedDate
CreationDate
2012-05-03T15:46:21.990
FavoriteCount
0
LastActivityDate
2012-09-18T15:38:09.597
LastEditDate
2012-09-18T15:38:09.597
LastEditorUserId
3340
OwnerUserId
828867
ParentId
0
PostTypeId
1
Score
0
ViewCount
362
LastEditorDisplayName
text
Body
We've been given a task to write a dynamic data structure in C. I'm still incredibly new to C and I would really appreciate it if someone could give me some pointers (lol) on what I'm doing wrong / what I should read more about. Here's what I have so far: flexarray.h <pre><code>#ifndef FLEXARRAY_H #define FLEXARRAY_H typedef struct flexarrayrec flexarray; flexarray *flexarray_new(); extern void flexarray_add(flexarray *a, char item); extern void flexarray_set(flexarray *a, char item, int index); extern char flexarray_get(flexarray *a, int index); extern void flexarray_trim(flexarray *a); extern void flexarray_print(flexarray *a); #endif /* FLEXARRAY_H */ </code></pre> flexarray.c <pre><code>#include "flexarray.h" #include "mylib.h" #define DEFAULT_CAPACITY 10 typedef struct flexarray{ int size; int capacity; char *array; }; flexarray *flexarray_new(){ flexarray a; a->capacity = DEFAULT_CAPACITY; a->size = 0; a->array = (char*) erealloc (a ,a->capacity * sizeof(char)); return a; } void grow(flexarray a){ a->capacity = a->capacity * 2; a->array = (int*) erealloc (a ,a->capacity * sizeof(int)); } void flexarray_add(flexarray a, char item){ if(a->size == a->capacity) grow(a); a->array[a->size - 1] = item; a->size++; } void set(flexarray a, char c, int index){ if(index < 0 || index > a->size) return; a->array[index] = c; } char get(flexarray a, int index){ if(index < 0 || index > a->size) return; return a->array[index]; } void flexarray_trim(flexarray a){ if(a->size == a->capacity) return; a->capacity = a->size; a->array = (char*) erealloc (a, a->capacity * sizeof(char)); } void flexarray_print(flexarray a){ int i; printf("["); for(i = 0; i < a->size - 1; i++){ printf("%c,", a->array[i]); } printf("%c]\n", a->array[i + 1]); } </code></pre> Thank you EDIT Current compile log: <pre><code>flexarray.c:10:1: warning: useless storage class specifier in empty declaration [enabled by default] flexarray.c: In function 'flexarray_new': flexarray.c:13:15: error: storage size of 'a' isn't known flexarray.c: At top level: flexarray.c:20:21: error: parameter 1 ('a') has incomplete type flexarray.c:25:30: error: parameter 1 ('a') has incomplete type flexarray.c:31:20: error: parameter 1 ('a') has incomplete type make[2]: *** [build/Debug/MinGW_Actual-Windows/flexarray.o] Error 1 make[1]: *** [.build-conf] Error 2 make: *** [.build-impl] Error 2 BUILD FAILED (exit value 2, total time: 1s) </code></pre>
Tags
<c>
Title
Task to create flexible (dynamic memory allocation) array
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USJacob Schoen
UserOwnerUserId
1. USrtheunissen
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
2. PO
 singulars
 PostTypePostTypeId
 PTAnswer
3. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.