Flash/misc.cpp at master · RUSH-LAB/Flash · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
#include<math.h>
#include"MatMul.h"
#include<string>


intreadGraph(std::string fileName, int *A, int *B, unsignedint bufferlen) {
	std::ifstream infile(fileName);

int a, b;
unsigned ct = 0;
while (infile >> a >> b)
	{
if (ct >= bufferlen) break;
if (ct % 10000000 == 0) std::cout << "Already read " << ct << "lines ..." << std::endl;
 A[ct] = a;
 B[ct] = b;
 ct++;
	}
return ct;
}


unsignedintgetLog2(unsignedint x) {
if (x < 2) {
return0;
	}

unsignedint y = 1;
do {
 x /= 2;
 y++;
	} while (x > 1);

return y;
}

// http://stackoverflow.com/questions/364985/algorithm-for-finding-the-smallest-power-of-two-thats-greater-or-equal-to-a-giv
intsmallestPow2(int x) {
if (x < 0) {
return0;
	}

	--x;
	x |= x >> 1;
	x |= x >> 2;
	x |= x >> 4;
	x |= x >> 8;
	x |= x >> 16;

return x + 1;
}

floatmean(float values[], int n) {
float sum = 0;
for (int i = 0; i < n; i++)
	{
 sum += values[i];
	}
return sum / n;
}

floatvar(float values[], int n, float valuesMean) {
float sum = 0;
for (int i = 0; i < n; i++)
	{
 sum += (values[i] - valuesMean) * (values[i] - valuesMean);
	}
return sum / (n - 1);
}

/*
Z-score standardize the result.
Minus mean, then divide by std.
*/
voidzCentering(float *values, int n) {
float valuesMean = mean(values, n);
float valuesStd = sqrtf(var(values, n, valuesMean));
for (int i = 0; i < n; i++) {
 values[i] = (values[i] - valuesMean) / valuesStd;
	}
}

floatcosineDist(float *A, float *B, unsignedint n) {

float up = 0;
for (int i = 0; i < n; i++) up += A[i] * B[i];

float a = 0;
for (int i = 0; i < n; i++) a += A[i] * A[i];

float b = 0;
for (int i = 0; i < n; i++) b += B[i] * B[i];
	a = sqrtf(a);
	b = sqrtf(b);

return up / (a * b);
}

floatcosineDist(int *indiceA, float *valA, int nonzerosA, int *indiceB, float *valB, int nonzerosB) {

float up = 0;
float a = 0;
float b = 0;
unsignedint startA, endA, startB, endB;

	up = SparseVecMul(indiceA, valA, nonzerosA, indiceB, valB, nonzerosB);
	a = SparseVecMul(indiceA, valA, nonzerosA, indiceA, valA, nonzerosA);
	b = SparseVecMul(indiceB, valB, nonzerosB, indiceB, valB, nonzerosB);
	a = sqrtf(a);
	b = sqrtf(b);
if (a == 0 || b == 0) {
return0;
	}
return up / (a * b);
}

floatsmartrp(int *indiceA, float *valA, int nonzerosA, short *randBits) {

float result = 0; // The final hash result.

unsignedint ctA = 0;
unsignedint iA;

// Go through non-zeros of A.
while (ctA < nonzerosA) {
 iA = indiceA[ctA];
if (randBits[iA] == 1) {
 result += valA[ctA];
 }
elseif (randBits[iA] == -1) {
 result -= valA[ctA];
 }
 ctA++;
	}
return result;
}

voidsmartrp_batch(int numRP, int dimension, int *indiceA, float *valA, int nonzerosA, short *randBits, float *outputs) {
for (int i = 0; i < numRP; i++) {
 outputs[i] = 0;
	}

unsignedint ctA = 0;
unsignedint iA;

// Go through non-zeros of A.
while (ctA < nonzerosA) {
 iA = indiceA[ctA];
for (int i = 0; i < numRP; i++) {
if (randBits[i * dimension + iA] == 1) {
 outputs[i] += valA[ctA];
 }
elseif (randBits[i * dimension + iA] == -1) {
 outputs[i] -= valA[ctA];
 }
 }
 ctA++;
	}
}