Skip to content

Commit

Permalink
Additional Windows fixups for Fast Kmeans
Browse files Browse the repository at this point in the history
.. std::max needs <algorithm> and don't need <unistd> at all.
  • Loading branch information
liversedge committed Sep 28, 2021
1 parent 5fb2dfb commit 4c6c8e6
Show file tree
Hide file tree
Showing 2 changed files with 1 addition and 1 deletion.
1 change: 1 addition & 0 deletions contrib/kmeans/hamerly_kmeans.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -7,6 +7,7 @@
#include "hamerly_kmeans.h"
#include "kmeans_general_functions.h"
#include <cmath>
#include <algorithm>

/* Hamerly's algorithm that is a 'simplification' of Elkan's, in that it keeps
* the following bounds:
Expand Down
1 change: 0 additions & 1 deletion contrib/kmeans/kmeans_general_functions.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,6 @@
#include <numeric>
#include <cstring>
#include <cstdio>
#include <unistd.h>

void addVectors(double *a, double const *b, int d) {
double const *end = a + d;
Expand Down

0 comments on commit 4c6c8e6

Please sign in to comment.