#include "common.h"
#include <alloc.h>
#include <stdlib.h>


Sort::Sort(int count, ptr2func *fptr, char **desc) {
    init(count, fptr, desc);
}

Sort::~Sort() {
    free(fptr);
    int i;
    for(i=0;i<numfuncs;i++){
        free(descriptions[i]);
    }
    free(descriptions);
}

void Sort::init(int count, ptr2func *f, char **desc){
    fptr = (ptr2func *) calloc((size_t) sizeof(ptr2func *), (size_t) count);
    descriptions = (char **) calloc((size_t) sizeof(char *), (size_t) count);
    int i;
    for(i=0;i<count;i++){
        fptr[i] = f[i];
        descriptions[i] = strdup(desc[i]);
    }
    numfuncs = count;
}

     
void Sort::sort_for_x(double x) {
    int i, j;
    for(j=numfuncs-1;j>=0;j--){
        for(i=0;i<j;i++){
            if(compare(fptr[i], fptr[i+1], x) > 0) {
                swap(fptr, descriptions, i, i+1);
            }
        }
    }
    cout << "Performed sort for x = " << x << ":\n";
    for(i=0;i<numfuncs;i++){
        cout << "  " << descriptions[i] << "  = " << fptr[i](x) << "\n";
    }
}

int Sort::compare(ptr2func a, ptr2func b, double x) {
    if(a(x) > b(x)) return 1;
    if(a(x) < b(x)) return -1;
    return 0;
}    

void Sort::swap(ptr2func *f, char **desc, int a, int b) {
    ptr2func tmpf = f[a];
    f[a] = f[b];
    f[b] = tmpf;
    char * tmpd = desc[a];
    desc[a] = desc[b];
    desc[b] = tmpd;
}