[Sync] Move //sync to //components/sync.

components/sync/base/node_ordinal_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/node_ordinal.h"
+#include "components/sync/base/node_ordinal.h"
 
 #include <stdint.h>
 
 #include <algorithm>
 #include <cstddef>
 #include <functional>
 #include <limits>
 #include <vector>
 
 #include "base/macros.h"
@@ skipping 77 matching lines @@
 // value should be equal to the original value.
 TEST(NodeOrdinalTest, PositionToOrdinalToPosition) {
   for (size_t i = 0; i < kNumTestValues; ++i) {
     const int64_t expected_value = kTestValues[i];
     const NodeOrdinal ordinal = Int64ToNodeOrdinal(expected_value);
     const int64_t value = NodeOrdinalToInt64(ordinal);
     EXPECT_EQ(expected_value, value) << "i = " << i;
   }
 }
 
-template <typename T, typename LessThan = std::less<T> >
+template <typename T, typename LessThan = std::less<T>>
 class IndexedLessThan {
  public:
   explicit IndexedLessThan(const T* values) : values_(values) {}
 
   bool operator()(int i1, int i2) {
     return less_than_(values_[i1], values_[i2]);
   }
 
  private:
   const T* values_;
@@ skipping 26 matching lines @@
 TEST(NodeOrdinalTest, CreateBetween) {
   const NodeOrdinal ordinal1("\1\1\1\1\1\1\1\1");
   const NodeOrdinal ordinal2("\1\1\1\1\1\1\1\3");
   EXPECT_EQ("\1\1\1\1\1\1\1\2",
             ordinal1.CreateBetween(ordinal2).ToInternalValue());
 }
 
 }  // namespace
 
 }  // namespace syncer