utils.h

Go to the documentation of this file.

/*
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#pragma once
 
#include "../lib/cJSON/cJSON.h"
#include "../lib/dSFMT/dSFMT.h"
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
 
double
rand_normal(const double mu, const double sigma);
 
double
rand_uniform(const double min, const double max);
 
int
rand_uniform_int(const int min, const int max);
 
void
rand_init(void);
 
void
rand_init_seed(const uint32_t seed);
 
void
utils_json_parse_check(const cJSON *json);
 
static inline double
clamp(const double a, const double min, const double max)
{
    return (a < min) ? min : (a > max) ? max : a;
}
 
static inline int
clamp_int(const int a, const int min, const int max)
{
    return (a < min) ? min : (a > max) ? max : a;
}
 
static inline int
argmax(const double *X, const int N)
{
    if (N < 1) {
        printf("argmax() error: N < 1\n");
        exit(EXIT_FAILURE);
    }
    int max_i = 0;
    double max = X[0];
    for (int i = 1; i < N; ++i) {
        if (X[i] > max) {
            max_i = i;
            max = X[i];
        }
    }
    return max_i;
}
 
static inline void
float_to_binary(const double f, char *binary, const int bits)
{
    if (f >= 1) {
        for (int i = 0; i < bits; ++i) {
            binary[i] = '1';
        }
    } else if (f <= 0) {
        for (int i = 0; i < bits; ++i) {
            binary[i] = '0';
        }
    } else {
        int a = (int) (f * pow(2, bits));
        for (int i = 0; i < bits; ++i) {
            binary[bits - 1 - i] = (a % 2) + '0';
            a /= 2;
        }
    }
}
 
static inline void
catch_error(const char *ret)
{
    if (ret != NULL) {
        printf("%s\n", ret);
        exit(EXIT_FAILURE);
    }
}
 
static inline bool
check_array_eq(const double *arr1, const double *arr2, int size)
{
    const double tol = 1e-5;
    for (int i = 0; i < size; ++i) {
        if (arr1[i] < arr2[i] - tol || arr1[i] > arr2[i] + tol) {
            return false;
        }
    }
    return true;
}
 
static inline bool
check_array_eq_int(const int *arr1, const int *arr2, int size)
{
    for (int i = 0; i < size; ++i) {
        if (arr1[i] != arr2[i]) {
            return false;
        }
    }
    return true;
}