LRbin.c

Go to the documentation of this file.

/*
 * Copyright    2019    R.K. Owen, Ph.D.
 * License      see lgpl.md (Gnu Lesser General Public License)
 */
#ifdef __cplusplus
extern "C" {
#endif

#include <stdlib.h>
#include <math.h>       /* isnan() */
#include "libran.h"

LR_bin *LR_bin_new(int n) {
        LR_bin *ptr = (void *) NULL;

        if (!(ptr = (LR_bin *) malloc(sizeof(LR_bin))))
                return ptr;
        ptr->n  = n;
        ptr->nn = 1;    /* always start with one bin */
        ptr->c  = 0;
        ptr->errno = 0;

        if (!(ptr->bdrs = (double *) calloc(n, sizeof(double))))
                goto bad0;

        if (!(ptr->bins = (long *) calloc(n, sizeof(long))))
                goto bad1;

        return ptr;

bad1:
        free((void *) ptr->bdrs);

bad0:
        free((void *) ptr);
        return (void *) NULL;
}

int LR_bin_rm(LR_bin **b) {
        if (b && *b) {
                free((void *) (*b)->bins);
                free((void *) (*b)->bdrs);
                free((void *) *b);
                *b = (LR_bin *) NULL;
                return LRerr_OK;
        }
        return LRerr_BinGeneric;
}

int LR_bin_set(LR_bin *b, double x) {
        int i = 0;
        double t;
        if (b->n < b->nn + 1) {
                /* too many values given */
                return b->errno = LRerr_TooManyValues;
        }
        t = b->bdrs[0];
        for (int i = 0, i1 = 1; i <= b->nn; i++,i1++) {
                if (b->nn == i1) {              /* got to top entry */
                        b->bdrs[i] = x;
                        b->nn++;
                        return LRerr_OK;
                }
                if (x > t) {
                        /* compare to next one, next round */
                        t = b->bdrs[i1];
                } else {
                        /* insert here, but keep current */
                        t = b->bdrs[i];
                        b->bdrs[i] = x;
                        /* use current for comparison */
                        x = t;
                        t = b->bdrs[i1];
                }
        }
        b->nn++;

        return LRerr_OK;
}

int LR_bin_add(LR_bin *b, double x) {
        int i = 0;

        if (isnan(x))                   
                return  b->errno = LRerr_InvalidInputValue;

        while (i <= b->nn - 1) {
                if (x < b->bdrs[i]
                ||  i == b->nn - 1) {
                        b->bins[i]++;
                        break;
                }
                i++;
        }
        if (i >= b->nn)
                return  b->errno = LRerr_InvalidRange;
        b->c++;

        return LRerr_OK;
}

#ifdef __cplusplus
}
#endif