Convert ARRAYSIZE_UNSAFE -> arraysize in components/.

components/query_parser/snippet_unittest.cc

 // Copyright 2014 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/query_parser/snippet.h"
 
 #include <algorithm>
 
 #include "base/strings/string_split.h"
 #include "base/strings/string_util.h"
@@ skipping 223 matching lines @@
     { "0 0 1 4 0 0 2 1",                    1,     { 1, 5 } },
     { "0 0 4 1 0 0 2 1",                    2,     { 2, 3, 4, 5 } },
     { "0 0 0 1",                            1,     { 0, 1 } },
     { "0 0 0 1 0 0 0 2",                    1,     { 0, 2 } },
     { "0 0 1 1 0 0 1 2",                    1,     { 1, 3 } },
     { "0 0 1 2 0 0 4 3 0 0 3 1",            1,     { 1, 7 } },
     { "0 0 1 4 0 0 2 5",                    1,     { 1, 7 } },
     { "0 0 1 2 0 0 1 1",                    1,     { 1, 3 } },
     { "0 0 1 1 0 0 5 2 0 0 10 1 0 0 3 10",  2,     { 1, 2, 3, 13 } },
   };
-  for (size_t i = 0; i < ARRAYSIZE_UNSAFE(data); ++i) {
+  for (size_t i = 0; i < arraysize(data); ++i) {
     Snippet::MatchPositions matches;
     Snippet::ExtractMatchPositions(data[i].offsets_string, "0", &matches);
     EXPECT_EQ(data[i].expected_match_count, matches.size());
     for (size_t j = 0; j < data[i].expected_match_count; ++j) {
       EXPECT_EQ(data[i].expected_matches[2 * j], matches[j].first);
       EXPECT_EQ(data[i].expected_matches[2 * j + 1], matches[j].second);
     }
   }
 }
 
 }  // namespace query_parser