Changed DB to store node positions as Ordinals.

sync/internal_api/public/base/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 "base/basictypes.h"
 #include "sync/internal_api/public/base/ordinal.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 #include <algorithm>
 #include <cctype>
@@ skipping 113 matching lines @@
   ASSERT_TRUE(ordinal1.IsValid());
   ASSERT_TRUE(ordinal2.IsValid());
   EXPECT_TRUE(ordinal1.Equals(TestOrdinal("2")));
   EXPECT_TRUE(ordinal2.Equals(LongOrdinal("50000")));
 }
 
 // Create an invalid and a valid Ordinal.  EqualsOrBothInvalid should
 // return true if called reflexively and false otherwise.
 TEST(Ordinal, EqualsOrBothInvalid) {
   const TestOrdinal& valid_ordinal = TestOrdinal::CreateInitialOrdinal();
-  const TestOrdinal invalid_ordinal;
+  const TestOrdinal invalid_ordinal("");

[akalin, 2012/10/05 22:40:27]

revert

[vishwath, 2012/10/08 20:17:49]

Done.

 
   EXPECT_TRUE(valid_ordinal.EqualsOrBothInvalid(valid_ordinal));
   EXPECT_TRUE(invalid_ordinal.EqualsOrBothInvalid(invalid_ordinal));
   EXPECT_FALSE(invalid_ordinal.EqualsOrBothInvalid(valid_ordinal));
   EXPECT_FALSE(valid_ordinal.EqualsOrBothInvalid(invalid_ordinal));
 }
 
 // Create three Ordinals in order.  LessThan should return values
 // consistent with that order.
 TEST(Ordinal, LessThan) {
@@ skipping 222 matching lines @@
   std::vector<LongOrdinal> ordinals = sorted_ordinals;
   std::random_shuffle(ordinals.begin(), ordinals.end());
   std::sort(ordinals.begin(), ordinals.end(), LongOrdinal::LessThanFn());
   EXPECT_TRUE(std::equal(ordinals.begin(), ordinals.end(),
                          sorted_ordinals.begin(), LongOrdinal::EqualsFn()));
 }
 
 }  // namespace
 
 }  // namespace syncer