Revision 595:3b1f2aa8d36b
| src/may/bits/VectorBits.java | ||
|---|---|---|
| 58 | 58 |
} |
| 59 | 59 |
return out; |
| 60 | 60 |
} |
| 61 |
|
|
| 62 |
public static double euclideanDistance(double[] v1, double[] v2) {
|
|
| 63 |
checkLengths(v1, v2); |
|
| 64 |
double sum = 0.0; |
|
| 65 |
for (int i = 0; i < v1.length; ++i) {
|
|
| 66 |
double d = v1[i] - v2[i]; |
|
| 67 |
sum += d * d; |
|
| 68 |
} |
|
| 69 |
return Math.sqrt(sum); |
|
| 70 |
} |
|
| 61 | 71 |
} |
| 62 | 72 |
|
| src/may/vector.yeti | ||
|---|---|---|
| 292 | 292 |
v; |
| 293 | 293 |
fi); |
| 294 | 294 |
|
| 295 |
euclideanDistance v1 v2 is ~double[] -> ~double[] -> number = |
|
| 296 |
VectorBits#euclideanDistance(v1, v2); |
|
| 297 |
|
|
| 295 | 298 |
zipped vv is list?<~double[]> -> ~double[] = |
| 296 | 299 |
case vv of |
| 297 | 300 |
[v]: v; |
| ... | ... | |
| 366 | 369 |
maxindex, |
| 367 | 370 |
minindex, |
| 368 | 371 |
unityNormalised, |
| 372 |
euclideanDistance, |
|
| 369 | 373 |
zipped, |
| 370 | 374 |
unzipped, |
| 371 | 375 |
} as {
|
| ... | ... | |
| 411 | 415 |
maxindex is vector_t -> number, |
| 412 | 416 |
minindex is vector_t -> number, |
| 413 | 417 |
unityNormalised is vector_t -> vector_t, |
| 418 |
euclideanDistance is vector_t -> vector_t -> number, |
|
| 414 | 419 |
zipped is list?<vector_t> -> vector_t, |
| 415 | 420 |
unzipped is number -> vector_t -> array<vector_t>, |
| 416 | 421 |
} |
Also available in: Unified diff