clean up compilation of C example
This commit is contained in:
parent
eaf1915bdb
commit
f0493f6955
|
@ -1,15 +0,0 @@
|
||||||
#!/bin/bash
|
|
||||||
root="$1"
|
|
||||||
gcc -std=c99 -Wall -lm "$root".c -o "$root" -I/usr/local/include -L/usr/local/lib -lgsl -lgslcblas -lm -g
|
|
||||||
|
|
||||||
# Link libraries, for good measure
|
|
||||||
LD_LIBRARY_PATH=/usr/local/lib
|
|
||||||
export LD_LIBRARY_PATH
|
|
||||||
|
|
||||||
# Increase stack size limit
|
|
||||||
ulimit -Ss 256000
|
|
||||||
# -Ss: the soft limit. If you set the hard limit, you then can't raise it
|
|
||||||
# 256000: around 250Mbs, if I'm reading it correctly.
|
|
||||||
|
|
||||||
# run
|
|
||||||
./samples
|
|
|
@ -1,13 +0,0 @@
|
||||||
#!/bin/bash
|
|
||||||
root="$1"
|
|
||||||
gcc -std=c99 -Wall -lm "$root".c -o "$root" -I/usr/local/include -L/usr/local/lib -lgsl -lgslcblas -lm -g
|
|
||||||
|
|
||||||
# Link libraries, for good measure
|
|
||||||
LD_LIBRARY_PATH=/usr/local/lib
|
|
||||||
export LD_LIBRARY_PATH
|
|
||||||
|
|
||||||
# Increase stack size limit
|
|
||||||
ulimit -Ss 256000
|
|
||||||
# -Ss: the soft limit. If you set the hard limit, you then can't raise it
|
|
||||||
# 256000: around 250Mbs, if I'm reading it correctly.
|
|
||||||
|
|
50
C/samples/makefile
Normal file
50
C/samples/makefile
Normal file
|
@ -0,0 +1,50 @@
|
||||||
|
# Interface:
|
||||||
|
# make
|
||||||
|
# make build
|
||||||
|
# make format
|
||||||
|
# make run
|
||||||
|
|
||||||
|
# Compiler
|
||||||
|
CC=gcc
|
||||||
|
# CC=tcc # <= faster compilation
|
||||||
|
|
||||||
|
# Main file
|
||||||
|
SRC=samples.c
|
||||||
|
OUTPUT=samples
|
||||||
|
|
||||||
|
## Dependencies
|
||||||
|
DEPS='gsl'
|
||||||
|
|
||||||
|
## Flags
|
||||||
|
INCS=`pkg-config --cflags ${DEPS}`
|
||||||
|
LIBS=`pkg-config --libs ${DEPS}`
|
||||||
|
DEBUG= #'-g'
|
||||||
|
STANDARD=-std=c99
|
||||||
|
WARNINGS=-Wall
|
||||||
|
|
||||||
|
## Formatter
|
||||||
|
STYLE_BLUEPRINT=webkit
|
||||||
|
FORMATTER=clang-format -i -style=$(STYLE_BLUEPRINT)
|
||||||
|
|
||||||
|
## make build
|
||||||
|
build: $(SRC)
|
||||||
|
$(CC) $(DEBUG) $(INCS) $(PLUGS) $(SRC) -o samples $(LIBS)
|
||||||
|
|
||||||
|
format: $(SRC)
|
||||||
|
$(FORMATTER) $(SRC)
|
||||||
|
|
||||||
|
run: $(SRC) $(OUTPUT)
|
||||||
|
echo "Increasing stack size limit, because we are dealing with 1M samples"
|
||||||
|
ulimit -Ss 256000
|
||||||
|
# ^ Increase stack size limit
|
||||||
|
# -Ss: the soft limit. If you set the hard limit, you then can't raise it
|
||||||
|
# 256000: around 250Mbs, if I'm reading it correctly.
|
||||||
|
./$(OUTPUT)
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
# Old:
|
||||||
|
# Link libraries, for good measure
|
||||||
|
# LD_LIBRARY_PATH=/usr/local/lib
|
||||||
|
# export LD_LIBRARY_PATH
|
||||||
|
|
Binary file not shown.
219
C/samples/samples.c
Executable file → Normal file
219
C/samples/samples.c
Executable file → Normal file
|
@ -1,8 +1,8 @@
|
||||||
#include <stdlib.h>
|
|
||||||
#include <stdio.h>
|
|
||||||
#include <math.h>
|
|
||||||
#include <gsl/gsl_rng.h>
|
|
||||||
#include <gsl/gsl_randist.h>
|
#include <gsl/gsl_randist.h>
|
||||||
|
#include <gsl/gsl_rng.h>
|
||||||
|
#include <math.h>
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
|
||||||
#define N 1000000
|
#define N 1000000
|
||||||
/*
|
/*
|
||||||
|
@ -12,129 +12,138 @@
|
||||||
*/
|
*/
|
||||||
|
|
||||||
/* Helpers */
|
/* Helpers */
|
||||||
void print(double *ys){
|
void print(double* ys)
|
||||||
for(int i=0; i<N; i++){
|
{
|
||||||
printf("%f\n", ys[i]);
|
for (int i = 0; i < N; i++) {
|
||||||
}
|
printf("%f\n", ys[i]);
|
||||||
printf("\n");
|
}
|
||||||
|
printf("\n");
|
||||||
}
|
}
|
||||||
|
|
||||||
void fill(double *ys, float f){
|
void fill(double* ys, float f)
|
||||||
for(int i=0; i<N; i++){
|
{
|
||||||
ys[i] = f;
|
for (int i = 0; i < N; i++) {
|
||||||
}
|
ys[i] = f;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
double sum(double *ps, int n){
|
double sum(double* ps, int n)
|
||||||
double result = 0;
|
{
|
||||||
for(int i=0; i<n; i++){
|
double result = 0;
|
||||||
result += ps[i];
|
for (int i = 0; i < n; i++) {
|
||||||
}
|
result += ps[i];
|
||||||
return(result);
|
}
|
||||||
|
return (result);
|
||||||
}
|
}
|
||||||
|
|
||||||
void cumsum(double *ps, double *rs, int n){
|
void cumsum(double* ps, double* rs, int n)
|
||||||
double counter = 0;
|
{
|
||||||
for(int i=0; i<n; i++){
|
double counter = 0;
|
||||||
counter += ps[i];
|
for (int i = 0; i < n; i++) {
|
||||||
rs[i] = counter;
|
counter += ps[i];
|
||||||
}
|
rs[i] = counter;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Distributions*/
|
/* Distributions*/
|
||||||
void normal(gsl_rng * r, double *ys, double mean, double std){
|
void normal(gsl_rng* r, double* ys, double mean, double std)
|
||||||
for(int i=0; i<N; i++){
|
{
|
||||||
ys[i] = mean + gsl_ran_gaussian(r, std);
|
for (int i = 0; i < N; i++) {
|
||||||
}
|
ys[i] = mean + gsl_ran_gaussian(r, std);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
void lognormal(gsl_rng * r, double *ys, double zeta, double sigma){
|
void lognormal(gsl_rng* r, double* ys, double zeta, double sigma)
|
||||||
for(int i=0; i<N; i++){
|
{
|
||||||
ys[i] = gsl_ran_lognormal(r, zeta, sigma);
|
for (int i = 0; i < N; i++) {
|
||||||
}
|
ys[i] = gsl_ran_lognormal(r, zeta, sigma);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
void to(gsl_rng * r, double *ys, double low, double high){
|
void to(gsl_rng* r, double* ys, double low, double high)
|
||||||
double normal95confidencePoint = 1.6448536269514722;
|
{
|
||||||
double log_low = log(low);
|
double normal95confidencePoint = 1.6448536269514722;
|
||||||
double log_high = log(high);
|
double log_low = log(low);
|
||||||
double zeta = (log_low + log_high)/2;
|
double log_high = log(high);
|
||||||
double sigma = (log_high - log_low) / (2.0 * normal95confidencePoint);
|
double zeta = (log_low + log_high) / 2;
|
||||||
lognormal(r, ys, zeta, sigma);
|
double sigma = (log_high - log_low) / (2.0 * normal95confidencePoint);
|
||||||
|
lognormal(r, ys, zeta, sigma);
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Mixture of distributions */
|
/* Mixture of distributions */
|
||||||
void mixture(gsl_rng * r, double *dists[], double *weights, int n, double *results){
|
void mixture(gsl_rng* r, double* dists[], double* weights, int n, double* results)
|
||||||
/* Get cummulative, normalized weights */
|
{
|
||||||
double sum_weights = sum(weights, n);
|
/* Get cummulative, normalized weights */
|
||||||
double normalized_weights[n];
|
double sum_weights = sum(weights, n);
|
||||||
for(int i=0; i<n; i++){
|
double normalized_weights[n];
|
||||||
normalized_weights[i] = weights[i]/sum_weights;
|
for (int i = 0; i < n; i++) {
|
||||||
}
|
normalized_weights[i] = weights[i] / sum_weights;
|
||||||
double cummulative_weights[n];
|
|
||||||
cumsum(normalized_weights, cummulative_weights, n);
|
|
||||||
|
|
||||||
/* Get N samples, drawn from the different distributions in proportion to their weights. */
|
|
||||||
for(int i=0; i<N; i++){
|
|
||||||
double p_1 = gsl_rng_uniform(r);
|
|
||||||
double p_2 = gsl_rng_uniform(r);
|
|
||||||
|
|
||||||
int index_found = 0;
|
|
||||||
int index_counter = 0;
|
|
||||||
while ((index_found == 0) && (index_counter < n) ){
|
|
||||||
if(p_1 < cummulative_weights[index_counter]){
|
|
||||||
index_found = 1;
|
|
||||||
}else{
|
|
||||||
index_counter++;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
if(index_found == 0) {
|
double cummulative_weights[n];
|
||||||
printf("\nThis shouldn't be able to happen");
|
cumsum(normalized_weights, cummulative_weights, n);
|
||||||
// gsl_rng_free (r);
|
|
||||||
// abort(); // this shouldn't have happened.
|
/* Get N samples, drawn from the different distributions in proportion to their weights. */
|
||||||
|
for (int i = 0; i < N; i++) {
|
||||||
}else{
|
double p_1 = gsl_rng_uniform(r);
|
||||||
int sample_index = (int) floor(p_2 * N);
|
double p_2 = gsl_rng_uniform(r);
|
||||||
results[i] = dists[index_counter][sample_index];
|
|
||||||
|
int index_found = 0;
|
||||||
|
int index_counter = 0;
|
||||||
|
while ((index_found == 0) && (index_counter < n)) {
|
||||||
|
if (p_1 < cummulative_weights[index_counter]) {
|
||||||
|
index_found = 1;
|
||||||
|
} else {
|
||||||
|
index_counter++;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
if (index_found == 0) {
|
||||||
|
printf("\nThis shouldn't be able to happen");
|
||||||
|
// gsl_rng_free (r);
|
||||||
|
// abort(); // this shouldn't have happened.
|
||||||
|
|
||||||
|
} else {
|
||||||
|
int sample_index = (int)floor(p_2 * N);
|
||||||
|
results[i] = dists[index_counter][sample_index];
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
/* Main */
|
/* Main */
|
||||||
int main(void){
|
int main(void)
|
||||||
/* Initialize GNU Statistical Library (GSL) stuff */
|
{
|
||||||
const gsl_rng_type * T;
|
/* Initialize GNU Statistical Library (GSL) stuff */
|
||||||
gsl_rng * r;
|
const gsl_rng_type* T;
|
||||||
// gsl_rng_env_setup();
|
gsl_rng* r;
|
||||||
T = gsl_rng_default;
|
// gsl_rng_env_setup();
|
||||||
r = gsl_rng_alloc (T);
|
T = gsl_rng_default;
|
||||||
|
r = gsl_rng_alloc(T);
|
||||||
/* Toy example */
|
|
||||||
/* Declare variables in play */
|
|
||||||
double p_a, p_b, p_c;
|
|
||||||
double dist_none[N], dist_one[N], dist_few[N], dist_many[N], dist_mixture[N];
|
|
||||||
|
|
||||||
/* Initialize variables */
|
|
||||||
p_a = 0.8;
|
|
||||||
p_b = 0.5;
|
|
||||||
p_c = p_a * p_b;
|
|
||||||
|
|
||||||
fill(dist_none, 0);
|
|
||||||
fill(dist_one, 1);
|
|
||||||
to(r, dist_few, 1, 3);
|
|
||||||
to(r, dist_many, 2, 10);
|
|
||||||
|
|
||||||
/* Generate mixture */
|
/* Toy example */
|
||||||
int n = 4;
|
/* Declare variables in play */
|
||||||
double weights[] = { 1 - p_c, p_c/2, p_c/4, p_c/4 };
|
double p_a, p_b, p_c;
|
||||||
double *dists[] = { dist_none, dist_one, dist_few, dist_many };
|
double dist_none[N], dist_one[N], dist_few[N], dist_many[N], dist_mixture[N];
|
||||||
|
|
||||||
mixture(r, dists, weights, n, dist_mixture);
|
|
||||||
printf("%f\n", sum(dist_mixture, N)/N);
|
|
||||||
|
|
||||||
/* Clean up GSL */
|
/* Initialize variables */
|
||||||
gsl_rng_free (r);
|
p_a = 0.8;
|
||||||
|
p_b = 0.5;
|
||||||
|
p_c = p_a * p_b;
|
||||||
|
|
||||||
/* Return success*/
|
fill(dist_none, 0);
|
||||||
return EXIT_SUCCESS;
|
fill(dist_one, 1);
|
||||||
|
to(r, dist_few, 1, 3);
|
||||||
|
to(r, dist_many, 2, 10);
|
||||||
|
|
||||||
|
/* Generate mixture */
|
||||||
|
int n = 4;
|
||||||
|
double weights[] = { 1 - p_c, p_c / 2, p_c / 4, p_c / 4 };
|
||||||
|
double* dists[] = { dist_none, dist_one, dist_few, dist_many };
|
||||||
|
|
||||||
|
mixture(r, dists, weights, n, dist_mixture);
|
||||||
|
printf("%f\n", sum(dist_mixture, N) / N);
|
||||||
|
|
||||||
|
/* Clean up GSL */
|
||||||
|
gsl_rng_free(r);
|
||||||
|
|
||||||
|
/* Return success*/
|
||||||
|
return EXIT_SUCCESS;
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue
Block a user