[Courgette Experimental] Replace QSufSort with libdivsufsort

courgette/third_party/bsdiff/bsdiff_search.h

 // Copyright 2003, 2004 Colin Percival
 // All rights reserved
 //
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted providing that the following conditions
 // are met:
 // 1. Redistributions of source code must retain the above copyright
 //    notice, this list of conditions and the following disclaimer.
 // 2. Redistributions in binary form must reproduce the above copyright
 //    notice, this list of conditions and the following disclaimer in the
@@ skipping 29 matching lines @@
 // Copyright 2016 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef COURGETTE_THIRD_PARTY_BSDIFF_BSDIFF_SEARCH_H_
 #define COURGETTE_THIRD_PARTY_BSDIFF_BSDIFF_SEARCH_H_
 
 #include <algorithm>
 #include <cstring>
 
-namespace courgette {
+namespace bsdiff {
 
 // Similar to ::memcmp(), but returns match length instead.
 inline int matchlen(const unsigned char* old,
                     int oldsize,
                     const unsigned char* newbuf,
                     int newsize) {
   int i;
 
   for (i = 0; (i < oldsize) && (i < newsize); i++)
     if (old[i] != newbuf[i])
@@ skipping 28 matching lines @@
   int x = matchlen(old + I[lo], oldsize - I[lo], newbuf, newsize);
   int y = matchlen(old + I[hi], oldsize - I[hi], newbuf, newsize);
   if (x > y) {
     *pos = I[lo];
     return x;
   }
   *pos = I[hi];
   return y;
 }
 
-}  // namespace courgette
+}  // namespace bsdiff
 
 #endif  // COURGETTE_THIRD_PARTY_BSDIFF_BSDIFF_SEARCH_H_