blob: f5648b93b78b74a2f7272fb63a33f9519a635336 (
plain) (
tree)
|
|
#ifndef SYNTH_TYPES_H
#define SYNTH_TYPES_H
typedef struct {
void * data;
int size;
int cap;
} list_t;
list_t a[128];
/* void */
/* ll_add(llist * l, void * data) { */
/* llist * tmp = l; */
/* int i = 0; */
/* do { */
/* if (!tmp->data) { */
/* break; */
/* } */
/* i++; */
/* tmp = l->next; */
/* } while (d); */
/* tmp->data = data; */
/* tmp->id = i; */
/* } */
/*
I need a list
- O(1) length calculation
- O(1) access for each element
*/
#endif /* SYNTH_TYPES_H */
|