Make base::Base64Encode() return void

sync/internal_api/public/base/unique_position_unittest.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 "sync/internal_api/public/base/unique_position.h"
 
 #include <algorithm>
 #include <string>
 
 #include "base/base64.h"
@@ skipping 374 matching lines @@
       : cache_guid_(cache_guid),
         next_id_(-65535) {
   }
 
   std::string NextSuffix() {
     // This is not entirely realistic, but that should be OK.  The current
     // suffix format is a base64'ed SHA1 hash, which should be fairly close to
     // random anyway.
     std::string input = cache_guid_ + base::Int64ToString(next_id_--);
     std::string output;
-    CHECK(base::Base64Encode(base::SHA1HashString(input), &output));
+    base::Base64Encode(base::SHA1HashString(input), &output);
     return output;
   }
 
  private:
   const std::string cache_guid_;
   int64 next_id_;
 };
 
 // Cache guids generated in the same style as real clients.
 static const char kCacheGuidStr1[] = "tuiWdG8hV+8y4RT9N5Aikg==";
@@ skipping 265 matching lines @@
 // This requires values in the test harness to be hard-coded in ascending order.
 TEST_F(CompressedPositionTest, OrderingTest) {
   for (size_t i = 0; i < positions_.size()-1; ++i) {
     EXPECT_PRED_FORMAT2(LessThan, positions_[i], positions_[i+1]);
   }
 }
 
 }  // namespace
 
 }  // namespace syncer