From cf17e4e425fe88f6d97d87e2d8eacf930b327e36 Mon Sep 17 00:00:00 2001
From: Thomas Fischer <thomas.fischer@ufz.de>
Date: Tue, 8 Sep 2015 10:47:57 +0200
Subject: [PATCH] [BL] Quicksort: Use arrays directly instead of references.
---
BaseLib/quicksort.h | 3 ++-
1 file changed, 2 insertions(+), 1 deletion(-)
diff --git a/BaseLib/quicksort.h b/BaseLib/quicksort.h
index f2ec2cd2a43..75cbf4e51d6 100644
--- a/BaseLib/quicksort.h
+++ b/BaseLib/quicksort.h
@@ -77,7 +77,7 @@ void quicksort(std::vector<T1*>& array, std::size_t beg, std::size_t end, std::v
}
template <typename T1, typename T2 = std::size_t>
-void quicksort(T1* & array, std::size_t beg, std::size_t end, T2* & perm)
+void quicksort(T1* array, std::size_t beg, std::size_t end, T2* perm)
{
// Zip input arrays.
std::vector<std::pair<T1, T2>> data;
@@ -103,6 +103,7 @@ void quicksort(T1* & array, std::size_t beg, std::size_t end, T2* & perm)
perm[beg+i] = data[i].second;
}
}
+
} // end namespace BaseLib
#endif /* QUICKSORT_H_ */
--
GitLab