[Courgette] Fix sorting in QSufSort's split().

courgette/third_party/qsufsort_unittest.cc

Index: courgette/third_party/qsufsort_unittest.cc
diff --git a/courgette/third_party/qsufsort_unittest.cc b/courgette/third_party/qsufsort_unittest.cc
index 204a09cd1cfa49456cc772b58cf472ce68dd5e0f..81a2c7210c794e2ba714d2376d92a4cd9e4b6ac9 100644
--- a/courgette/third_party/qsufsort_unittest.cc
+++ b/courgette/third_party/qsufsort_unittest.cc
@@ -38,7 +38,7 @@ TEST(QSufSortTest, Sort) {
     // Generate the suffix array as I.
     std::vector<int> I(len + 1);
     std::vector<int> V(len + 1);
-    courgette::qsuf::qsufsort<int*>(&I[0], &V[0], s, len);
+    courgette::qsuf::qsufsort<std::vector<int>&>(I, V, s, len);
 
     // Expect that I[] is a permutation of [0, len].
     std::vector<int> I_sorted(I);
@@ -71,7 +71,7 @@ TEST(QSufSortTest, Search) {
         reinterpret_cast<const unsigned char*>(old_str);
   std::vector<int> I(old_size + 1);
   std::vector<int> V(old_size + 1);
-  courgette::qsuf::qsufsort<int*>(&I[0], &V[0], old_buf, old_size);
+  courgette::qsuf::qsufsort<std::vector<int>&>(I, V, old_buf, old_size);
 
   // Test queries.
   const struct {