| | |
| | | #include <stdlib.h> |
| | | #include <string.h> |
| | | #include <math.h> |
| | | #include <unistd.h> |
| | | #include <float.h> |
| | | #include <limits.h> |
| | | |
| | | #include "utils.h" |
| | | |
| | | |
| | | char *basecfg(char *cfgfile) |
| | | { |
| | | char *c = cfgfile; |
| | | char *next; |
| | | while((next = strchr(c, '/'))) |
| | | { |
| | | c = next+1; |
| | | } |
| | | c = copy_string(c); |
| | | next = strchr(c, '.'); |
| | | if (next) *next = 0; |
| | | return c; |
| | | } |
| | | |
| | | int alphanum_to_int(char c) |
| | | { |
| | | return (c < 58) ? c - 48 : c-87; |
| | | } |
| | | char int_to_alphanum(int i) |
| | | { |
| | | if (i == 36) return '.'; |
| | | return (i < 10) ? i + 48 : i + 87; |
| | | } |
| | | |
| | | void pm(int M, int N, float *A) |
| | | { |
| | | int i,j; |
| | |
| | | void top_k(float *a, int n, int k, int *index) |
| | | { |
| | | int i,j; |
| | | for(j = 0; j < k; ++j) index[j] = 0; |
| | | for(j = 0; j < k; ++j) index[j] = -1; |
| | | for(i = 0; i < n; ++i){ |
| | | int curr = i; |
| | | for(j = 0; j < k; ++j){ |
| | | if(a[curr] > a[index[j]]){ |
| | | if((index[j] < 0) || a[curr] > a[index[j]]){ |
| | | int swap = curr; |
| | | curr = index[j]; |
| | | index[j] = swap; |
| | |
| | | return line; |
| | | } |
| | | |
| | | void read_all(int fd, char *buffer, size_t bytes) |
| | | { |
| | | size_t n = 0; |
| | | while(n < bytes){ |
| | | int next = read(fd, buffer + n, bytes-n); |
| | | if(next <= 0) error("read failed"); |
| | | n += next; |
| | | } |
| | | } |
| | | |
| | | void write_all(int fd, char *buffer, size_t bytes) |
| | | { |
| | | size_t n = 0; |
| | | while(n < bytes){ |
| | | size_t next = write(fd, buffer + n, bytes-n); |
| | | if(next <= 0) error("write failed"); |
| | | n += next; |
| | | } |
| | | } |
| | | |
| | | |
| | | char *copy_string(char *s) |
| | | { |
| | | char *copy = malloc(strlen(s)+1); |
| | |
| | | return variance; |
| | | } |
| | | |
| | | float constrain(float a, float max) |
| | | float constrain(float min, float max, float a) |
| | | { |
| | | if(a > abs(max)) return abs(max); |
| | | if(a < -abs(max)) return -abs(max); |
| | | if (a < min) return min; |
| | | if (a > max) return max; |
| | | return a; |
| | | } |
| | | |
| | |
| | | } |
| | | } |
| | | |
| | | float mag_array(float *a, int n) |
| | | { |
| | | int i; |
| | | float sum = 0; |
| | | for(i = 0; i < n; ++i){ |
| | | sum += a[i]*a[i]; |
| | | } |
| | | return sqrt(sum); |
| | | } |
| | | |
| | | void scale_array(float *a, int n, float s) |
| | | { |
| | | int i; |