util.h

Go to the documentation of this file.

/*
 * util.h
 *
 * Copyright (C) 2013-2016 Fabian Gieseke <fabian.gieseke@di.ku.dk>
 *               1976 Niklaus Wirth
 * License: GPL v2
 *
 */
#ifndef INCLUDE_UTIL_H_
#define INCLUDE_UTIL_H_

#include "float.h"

#include <stdlib.h>
#include <assert.h>
#include <float.h>
#include <math.h>
#include <stdio.h>
#include <time.h>
#include <sys/resource.h>
#include <sys/time.h>
#include <pthread.h>
#include <sched.h>
#include <errno.h>
#include <string.h>
#include <ctype.h>

void transpose_array_float(float* array,
        int n,
        int d,
        float* array_transposed);

void transpose_array_double(double* array, 
        int n, 
        int d, 
        double* array_transposed);

void transpose_array_int(int* array, 
        int n, 
        int d, 
        int* array_transposed);

int compare_floats(const void *p1,
        const void *p2);

int compare_ints(const void *p1, 
        const void *p2);

typedef FLOAT_TYPE elem_type;

#define ELEM_SWAP(a,b) { register elem_type t=(a);(a)=(b);(b)=t; }
#define median(a,n) kth_smallest(a,n,((n)/2))

/*---------------------------------------------------------------------------
 Function :   kth_smallest()
 In       :   array of elements, # of elements in the array, rank k
 Out      :   one element
 Job      :   find the kth smallest element in the array
 Notice   :   use the median() macro defined below to get the median.

 Reference:

 Author: Wirth, Niklaus
 Title: Algorithms + data structures = programs
 Publisher: Englewood Cliffs: Prentice-Hall, 1976
 Physical description: 366 p.
 Series: Prentice-Hall Series in Automatic Computation

 ---------------------------------------------------------------------------*/
elem_type kth_smallest(elem_type a[], int n, int k);

int kth_smallest_idx(elem_type a[],
        int n,
        int k);

#endif /* INCLUDE_UTIL_H_ */