Changed DB to store node positions as Ordinals.

sync/syncable/mutable_entry.h

 // 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.
 
 #ifndef SYNC_SYNCABLE_MUTABLE_ENTRY_H_
 #define SYNC_SYNCABLE_MUTABLE_ENTRY_H_
 
+#include "sync/internal_api/public/base/node_ordinal.h"
 #include "sync/syncable/entry.h"
 #include "sync/syncable/metahandle_set.h"
 
 namespace syncer {
 class WriteNode;
 
 namespace syncable {
 
 class WriteTransaction;
 
@@ skipping 24 matching lines @@
     return write_transaction_;
   }
 
   // Field Accessors.  Some of them trigger the re-indexing of the entry.
   // Return true on success, return false on failure, which means
   // that putting the value would have caused a duplicate in the index.
   // TODO(chron): Remove some of these unecessary return values.
   bool Put(Int64Field field, const int64& value);
   bool Put(TimeField field, const base::Time& value);
   bool Put(IdField field, const Id& value);
+  bool Put(OrdinalField field, const NodeOrdinal& value);
 
   // Do a simple property-only update if the PARENT_ID field.  Use with caution.
   //
   // The normal Put(IS_PARENT) call will move the item to the front of the
   // sibling order to maintain the linked list invariants when the parent
   // changes.  That's usually what you want to do, but it's inappropriate
   // when the caller is trying to change the parent ID of a the whole set
   // of children (e.g. because the ID changed during a commit).  For those
   // cases, there's this function.  It will corrupt the sibling ordering
   // if you're not careful.
@@ skipping 47 matching lines @@
   DISALLOW_COPY_AND_ASSIGN(MutableEntry);
 };
 
 // This function sets only the flags needed to get this entry to sync.
 bool MarkForSyncing(syncable::MutableEntry* e);
 
 }  // namespace syncable
 }  // namespace syncer
 
 #endif  // SYNC_SYNCABLE_MUTABLE_ENTRY_H_