squiggle.c/examples/02_many_samples/example.c

61 lines
1.1 KiB
C
Raw Normal View History

2023-06-26 17:44:41 +00:00
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
#include "../../squiggle.h"
// Estimate functions
double sample_0(uint64_t* seed)
2023-06-26 17:44:41 +00:00
{
return 0;
}
double sample_1(uint64_t* seed)
2023-06-26 17:44:41 +00:00
{
return 1;
}
double sample_few(uint64_t* seed)
2023-06-26 17:44:41 +00:00
{
return sample_to(1, 3, seed);
2023-06-26 17:44:41 +00:00
}
double sample_many(uint64_t* seed)
2023-06-26 17:44:41 +00:00
{
return sample_to(2, 10, seed);
2023-06-26 17:44:41 +00:00
}
int main(){
// set randomness seed
2023-07-23 10:47:47 +00:00
uint64_t* seed = malloc(sizeof(uint64_t));
2023-06-26 17:44:41 +00:00
*seed = 1000; // xorshift can't start with 0
double p_a = 0.8;
double p_b = 0.5;
double p_c = p_a * p_b;
2023-06-26 17:44:41 +00:00
int n_dists = 4;
double weights[] = { 1 - p_c, p_c / 2, p_c / 4, p_c / 4 };
double (*samplers[])(uint64_t*) = { sample_0, sample_1, sample_few, sample_many };
2023-06-26 17:44:41 +00:00
int n_samples = 1000000;
double* result_many = (double *) malloc(n_samples * sizeof(double));
2023-06-26 17:44:41 +00:00
for(int i=0; i<n_samples; i++){
result_many[i] = sample_mixture(samplers, weights, n_dists, seed);
2023-06-26 17:44:41 +00:00
}
printf("result_many: [");
for(int i=0; i<100; i++){
printf("%.2f, ", result_many[i]);
}
printf("]\n");
2023-07-23 08:09:34 +00:00
free(seed);
2023-06-26 17:44:41 +00:00
}
/*
Aggregation mechanisms:
- Quantiles (requires a sort)
- Sum
- Average
- Std
*/