From d6fbe86e7a8c1bc389902c90c57ee7e80f5475b9 Mon Sep 17 00:00:00 2001
From: Joseph Redmon <pjreddie@gmail.com>
Date: Tue, 16 Dec 2014 19:40:05 +0000
Subject: [PATCH] updates?
---
src/utils.c | 221 ++++++++++++++++++++++++++++++++++++++++++++++++-------
1 files changed, 192 insertions(+), 29 deletions(-)
diff --git a/src/utils.c b/src/utils.c
index 9848d08..365faeb 100644
--- a/src/utils.c
+++ b/src/utils.c
@@ -1,12 +1,52 @@
-#include "utils.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
+#include <float.h>
+
+#include "utils.h"
+
+char *find_replace(char *str, char *orig, char *rep)
+{
+ static char buffer[4096];
+ char *p;
+
+ if(!(p = strstr(str, orig))) // Is 'orig' even in 'str'?
+ return str;
+
+ strncpy(buffer, str, p-str); // Copy characters from 'str' start to 'orig' st$
+ buffer[p-str] = '\0';
+
+ sprintf(buffer+(p-str), "%s%s", rep, p+strlen(orig));
+
+ return buffer;
+}
+
+float sec(clock_t clocks)
+{
+ return (float)clocks/CLOCKS_PER_SEC;
+}
+
+void top_k(float *a, int n, int k, int *index)
+{
+ int i,j;
+ for(j = 0; j < k; ++j) index[j] = 0;
+ for(i = 0; i < n; ++i){
+ int curr = i;
+ for(j = 0; j < k; ++j){
+ if(a[curr] > a[index[j]]){
+ int swap = curr;
+ curr = index[j];
+ index[j] = swap;
+ }
+ }
+ }
+}
void error(char *s)
{
- fprintf(stderr, "Error: %s\n", s);
+ perror(s);
+ //fprintf(stderr, "Error: %s\n", s);
exit(0);
}
@@ -66,7 +106,7 @@
char *fgetl(FILE *fp)
{
if(feof(fp)) return 0;
- int size = 512;
+ unsigned long size = 512;
char *line = malloc(size*sizeof(char));
if(!fgets(line, size, fp)){
free(line);
@@ -74,11 +114,14 @@
}
int curr = strlen(line);
-
+
while(line[curr-1]!='\n'){
size *= 2;
line = realloc(line, size*sizeof(char));
- if(!line) malloc_error();
+ if(!line) {
+ printf("%ld\n", size);
+ malloc_error();
+ }
fgets(&line[curr], size-curr, fp);
curr = strlen(line);
}
@@ -113,35 +156,155 @@
int count_fields(char *line)
{
- int count = 0;
- int done = 0;
+ int count = 0;
+ int done = 0;
char *c;
- for(c = line; !done; ++c){
- done = (*c == '\0');
- if(*c == ',' || done) ++count;
- }
- return count;
+ for(c = line; !done; ++c){
+ done = (*c == '\0');
+ if(*c == ',' || done) ++count;
+ }
+ return count;
}
-double *parse_fields(char *line, int n)
+float *parse_fields(char *line, int n)
{
- double *field = calloc(n, sizeof(double));
- char *c, *p, *end;
- int count = 0;
- int done = 0;
- for(c = line, p = line; !done; ++c){
- done = (*c == '\0');
- if(*c == ',' || done){
- *c = '\0';
- field[count] = strtod(p, &end);
- if(p == c) field[count] = nan("");
- if(end != c && (end != c-1 || *end != '\r')) field[count] = nan(""); //DOS file formats!
- p = c+1;
- ++count;
- }
- }
- return field;
+ float *field = calloc(n, sizeof(float));
+ char *c, *p, *end;
+ int count = 0;
+ int done = 0;
+ for(c = line, p = line; !done; ++c){
+ done = (*c == '\0');
+ if(*c == ',' || done){
+ *c = '\0';
+ field[count] = strtod(p, &end);
+ if(p == c) field[count] = nan("");
+ if(end != c && (end != c-1 || *end != '\r')) field[count] = nan(""); //DOS file formats!
+ p = c+1;
+ ++count;
+ }
+ }
+ return field;
}
+float sum_array(float *a, int n)
+{
+ int i;
+ float sum = 0;
+ for(i = 0; i < n; ++i) sum += a[i];
+ return sum;
+}
+float mean_array(float *a, int n)
+{
+ return sum_array(a,n)/n;
+}
+
+float variance_array(float *a, int n)
+{
+ int i;
+ float sum = 0;
+ float mean = mean_array(a, n);
+ for(i = 0; i < n; ++i) sum += (a[i] - mean)*(a[i]-mean);
+ float variance = sum/n;
+ return variance;
+}
+
+float constrain(float a, float max)
+{
+ if(a > abs(max)) return abs(max);
+ if(a < -abs(max)) return -abs(max);
+ return a;
+}
+
+void normalize_array(float *a, int n)
+{
+ int i;
+ float mu = mean_array(a,n);
+ float sigma = sqrt(variance_array(a,n));
+ for(i = 0; i < n; ++i){
+ a[i] = (a[i] - mu)/sigma;
+ }
+ mu = mean_array(a,n);
+ sigma = sqrt(variance_array(a,n));
+}
+
+void translate_array(float *a, int n, float s)
+{
+ int i;
+ for(i = 0; i < n; ++i){
+ a[i] += s;
+ }
+}
+
+void scale_array(float *a, int n, float s)
+{
+ int i;
+ for(i = 0; i < n; ++i){
+ a[i] *= s;
+ }
+}
+int max_index(float *a, int n)
+{
+ if(n <= 0) return -1;
+ int i, max_i = 0;
+ float max = a[0];
+ for(i = 1; i < n; ++i){
+ if(a[i] > max){
+ max = a[i];
+ max_i = i;
+ }
+ }
+ return max_i;
+}
+
+// From http://en.wikipedia.org/wiki/Box%E2%80%93Muller_transform
+#define TWO_PI 6.2831853071795864769252866
+float rand_normal()
+{
+ static int haveSpare = 0;
+ static double rand1, rand2;
+
+ if(haveSpare)
+ {
+ haveSpare = 0;
+ return sqrt(rand1) * sin(rand2);
+ }
+
+ haveSpare = 1;
+
+ rand1 = rand() / ((double) RAND_MAX);
+ if(rand1 < 1e-100) rand1 = 1e-100;
+ rand1 = -2 * log(rand1);
+ rand2 = (rand() / ((double) RAND_MAX)) * TWO_PI;
+
+ return sqrt(rand1) * cos(rand2);
+}
+
+/*
+ float rand_normal()
+ {
+ int n = 12;
+ int i;
+ float sum= 0;
+ for(i = 0; i < n; ++i) sum += (float)rand()/RAND_MAX;
+ return sum-n/2.;
+ }
+ */
+
+float rand_uniform()
+{
+ return (float)rand()/RAND_MAX;
+}
+
+float **one_hot_encode(float *a, int n, int k)
+{
+ int i;
+ float **t = calloc(n, sizeof(float*));
+ for(i = 0; i < n; ++i){
+ t[i] = calloc(k, sizeof(float));
+ int index = (int)a[i];
+ t[i][index] = 1;
+ }
+ return t;
+}
--
Gitblit v1.10.0