Legofit
infers population history from nucleotide site patterns.
idsetset.h
1#ifndef IDSETSET_H
2#define IDSETSET_H
3
4#include "typedefs.h"
5
6int IdSetSet_add(IdSetSet * self, IdSet *idset);
11IdSetSet *IdSetSet_new(int dim);
13int IdSetSet_reserve(IdSetSet *self, int m);
14int IdSetSet_rewind(IdSetSet *self);
15void IdSetSet_sanityCheck(IdSetSet *self, const char *file, int line);
16int IdSetSet_size(IdSetSet * self);
17int IdSetSet_toArray(IdSetSet *self, unsigned size, IdSet *v[size]);
18
19#endif
void IdSetSet_empty_deep(IdSetSet *self)
Empty IdSetSet, including IdSet pointers.
Definition: idsetset.c:204
int IdSetSet_toArray(IdSetSet *self, unsigned size, IdSet *v[size])
Put idset pointers into array "v".
Definition: idsetset.c:243
IdSet * IdSetSet_next(IdSetSet *self)
Return the next IdSet pointer, or NULL if there are no more.
Definition: idsetset.c:325
int IdSetSet_reserve(IdSetSet *self, int m)
Make sure hash table is large enough to hold m additional elements.
Definition: idsetset.c:352
IdSetSet * IdSetSet_new(int n)
Constructor reserves space for n elements.
Definition: idsetset.c:160
int IdSetSet_add(IdSetSet *self, IdSet *idset)
Add a value to the table, resizing if necessary.
Definition: idsetset.c:215
int IdSetSet_size(IdSetSet *self)
Return the number of elements.
Definition: idsetset.c:237
int IdSetSet_rewind(IdSetSet *self)
Move curr to first filled bucket in hash table.
Definition: idsetset.c:306
void IdSetSet_free_shallow(IdSetSet *self)
Shallow destructor does not free IdSet objects.
Definition: idsetset.c:179
void IdSetSet_free_deep(IdSetSet *self)
Deep destructor frees IdSet objects.
Definition: idsetset.c:187
void IdSetSet_empty_shallow(IdSetSet *self)
Empty IdSetSet. Does not free the IdSet pointers.
Definition: idsetset.c:195
Definition: idset.c:24
The hash table.
Definition: idsetset.c:53