Use std::distance to find distance between two iterators.

1 files changed, 3 insertions, 2 deletions

diff --git a/vdslib/src/tests/distribution/distributiontest.cpp b/vdslib/src/tests/distribution/distributiontest.cpp
index 432e791f3ec..b5c756aece9 100644
--- a/vdslib/src/tests/distribution/distributiontest.cpp
+++ b/vdslib/src/tests/distribution/distributiontest.cpp
@@ -17,8 +17,9 @@
 #include <vespa/vespalib/util/size_literals.h>
 #include <gmock/gmock.h>
 #include <chrono>
-#include <thread>
 #include <fstream>
+#include <iterator>
+#include <thread>
 
 using namespace ::testing;
 
@@ -434,7 +435,7 @@ TEST(DistributionTest, test_distribution)
                 _distribution[i].second = distr.getIdealStorageNodes(
                         systemState, document::BucketId(26, i));
                 sort(_distribution[i].second.begin(), _distribution[i].second.end());
-                auto unique_nodes = unique(_distribution[i].second.begin(), _distribution[i].second.end()) - _distribution[i].second.begin();
+                auto unique_nodes = std::distance(_distribution[i].second.begin(), unique(_distribution[i].second.begin(), _distribution[i].second.end()));
                 _distribution[i].second.resize(unique_nodes);
 
                 for (unsigned j = 0; j < _distribution[i].second.size(); j++) {