legofit/html/idset_8h_source.html

#ifndef ARR_IDSET_H

#  define ARR_IDSET_H


#  include "typedefs.h"

#  include "eventlst.h"

#  include <stdio.h>

#  include <stdlib.h>


IdSet *IdSet_addSamples(IdSet *old, int nsamples, tipId_t *samples);

void   IdSet_addEvent(IdSet *self, unsigned event, unsigned outcome,

                      long double pr);

IdSet *IdSet_join(IdSet *left, IdSet *right, int nsamples,

                  tipId_t *samples);

void   IdSet_copyEventLst(IdSet *self, const IdSet *old);

IdSet *IdSet_dup(const IdSet *old);

EventLst *IdSet_dupEventLst(const IdSet *self);

IdSet *IdSet_join(IdSet *left, IdSet *right, int nsamples,

                  tipId_t samples[nsamples]);

IdSet *IdSet_new(int nIds, const tipId_t *tid, EventLst *evlst);

IdSet *IdSet_newTip(tipId_t tid);

void   IdSet_print(IdSet *self, FILE *fp);

void   IdSet_sanityCheck(IdSet *self, const char *file, int lineno);

void   IdSet_free(IdSet *self);

int    IdSet_nIds(IdSet *self);

long double IdSet_prob(IdSet *self);

int    IdSet_cmp(const IdSet *left, const IdSet *right);

#ifdef __clang__

uint32_t IdSet_hash(const IdSet *self) __attribute__((no_sanitize("integer")));

#else

uint32_t IdSet_hash(const IdSet *self);

#endif

tipId_t IdSet_union(IdSet *self, int n, int *ndx);

void   IdSet_partition(IdSet *self, unsigned k, tipId_t part[k],

                       unsigned n, unsigned a[n]);

IdSet *IdSet_subset(const IdSet *self, int n, int *ndx);

int    IdSet_get(const IdSet *self, int i);


#endif

IdSet_newTip
IdSet * IdSet_newTip(tipId_t tid)
Allocate a new IdSet with a single tipId_t value and probability 1.
Definition: idset.c:244

IdSet_addSamples
IdSet * IdSet_addSamples(IdSet *old, int nsamples, tipId_t *samples)
Return pointer to new IdSet and free old one.
Definition: idset.c:225

IdSet_get
int IdSet_get(const IdSet *self, int i)
Return i'th tipId_t value.
Definition: idset.c:417

IdSet_partition
void IdSet_partition(IdSet *self, unsigned k, tipId_t part[k], unsigned n, unsigned a[n])
On entry, k is the number of parts into which this IdSet will be subdivided, n must equal self->nIds,...
Definition: idset.c:373

IdSet_dupEventLst
EventLst * IdSet_dupEventLst(const IdSet *self)
Return a duplicate of the EventLst of this IdSet.
Definition: idset.c:387

IdSet_union
tipId_t IdSet_union(IdSet *self, int n, int *ndx)
Return a tipId_t value representing the union of the values within this IdSet object whose indices ar...
Definition: idset.c:356

IdSet_join
IdSet * IdSet_join(IdSet *left, IdSet *right, int nsamples, tipId_t *samples)
Join two IdSet objects, left and right, along with all the tipId_t values in the "samples" array.
Definition: idset.c:149

IdSet_subset
IdSet * IdSet_subset(const IdSet *self, int n, int *ndx)
Return a pointer to an IdSet representing a subset of "self".
Definition: idset.c:401

IdSet_new
IdSet * IdSet_new(int nIds, const tipId_t *tid, EventLst *evlst)
Allocate a new IdSet object with given values of nIds, tid, and evlst.
Definition: idset.c:104

EventLst
This structure handles bookkeeping associated with events of two types: (1) partitions of the set of ...
Definition: eventlst.h:33

IdSet
Definition: idset.c:24