components: Use stl utilities from the base namespace

components/sync/base/unique_position.cc

 // Copyright (c) 2012 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.
 
 #include "components/sync/base/unique_position.h"
 
 #include <stddef.h>
 #include <stdint.h>
 
 #include <algorithm>
@@ skipping 48 matching lines @@
   if (proto.has_custom_compressed_v1()) {
     return UniquePosition(proto.custom_compressed_v1());
   } else if (proto.has_value() && !proto.value().empty()) {
     return UniquePosition(Compress(proto.value()));
   } else if (proto.has_compressed_value() && proto.has_uncompressed_length()) {
     uLongf uncompressed_len = proto.uncompressed_length();
     std::string un_gzipped;
 
     un_gzipped.resize(uncompressed_len);
     int result = uncompress(
-        reinterpret_cast<Bytef*>(string_as_array(&un_gzipped)),
+        reinterpret_cast<Bytef*>(base::string_as_array(&un_gzipped)),
         &uncompressed_len,
         reinterpret_cast<const Bytef*>(proto.compressed_value().data()),
         proto.compressed_value().size());
     if (result != Z_OK) {
       DLOG(ERROR) << "Unzip failed " << result;
       return UniquePosition::CreateInvalid();
     }
     if (uncompressed_len != proto.uncompressed_length()) {
       DLOG(ERROR) << "Uncompressed length " << uncompressed_len
                   << " did not match specified length "
@@ skipping 531 matching lines @@
         return false;
       }
     }
   }
   // We don't bother looking for the existence or checking the validity of
   // any partial blocks.  There's no way they could be invalid anyway.
   return true;
 }
 
 }  // namespace syncer