IndexedDB: Coding conventions and cleanup

content/browser/indexed_db/leveldb/leveldb_transaction.cc

 // Copyright (c) 2013 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 "content/browser/indexed_db/leveldb/leveldb_transaction.h"
 
 #include "base/logging.h"
 #include "content/browser/indexed_db/leveldb/leveldb_database.h"
 #include "content/browser/indexed_db/leveldb/leveldb_write_batch.h"
 #include "third_party/leveldatabase/src/include/leveldb/db.h"
 
 using base::StringPiece;
 
 namespace content {
 
-scoped_refptr<LevelDBTransaction> LevelDBTransaction::Create(
-    LevelDBDatabase* db) {
-  return make_scoped_refptr(new LevelDBTransaction(db));
-}
-
 LevelDBTransaction::LevelDBTransaction(LevelDBDatabase* db)
     : db_(db), snapshot_(db), comparator_(db->Comparator()), finished_(false) {
   tree_.abstractor().comparator_ = comparator_;
 }
 
 LevelDBTransaction::AVLTreeNode::AVLTreeNode() {}
 LevelDBTransaction::AVLTreeNode::~AVLTreeNode() {}
 
 void LevelDBTransaction::ClearTree() {
   TreeType::Iterator iterator;
@@ skipping 219 matching lines @@
 }
 
 void LevelDBTransaction::TransactionIterator::Next() {
   DCHECK(IsValid());
   if (tree_changed_)
     RefreshTreeIterator();
 
   if (direction_ != FORWARD) {
     // Ensure the non-current iterator is positioned after Key().
 
-    LevelDBIterator* non_current =
-        (current_ == db_iterator_.get()) ? tree_iterator_.get()
-                                         : db_iterator_.get();
+    LevelDBIterator* non_current = (current_ == db_iterator_.get())
+                                       ? tree_iterator_.get()
+                                       : db_iterator_.get();
 
     non_current->Seek(Key());
     if (non_current->IsValid() &&
         !comparator_->Compare(non_current->Key(), Key()))
       non_current->Next();  // Take an extra step so the non-current key is
                             // strictly greater than Key().
 
     DCHECK(!non_current->IsValid() ||
            comparator_->Compare(non_current->Key(), Key()) > 0);
 
     direction_ = FORWARD;
   }
 
   current_->Next();
   HandleConflictsAndDeletes();
   SetCurrentIteratorToSmallestKey();
 }
 
 void LevelDBTransaction::TransactionIterator::Prev() {
   DCHECK(IsValid());
   if (tree_changed_)
     RefreshTreeIterator();
 
   if (direction_ != REVERSE) {
     // Ensure the non-current iterator is positioned before Key().
 
-    LevelDBIterator* non_current =
-        (current_ == db_iterator_.get()) ? tree_iterator_.get()
-                                         : db_iterator_.get();
+    LevelDBIterator* non_current = (current_ == db_iterator_.get())
+                                       ? tree_iterator_.get()
+                                       : db_iterator_.get();
 
     non_current->Seek(Key());
     if (non_current->IsValid()) {
       // Iterator is at first entry >= Key().
       // Step back once to entry < key.
       // This is why we don't check for the keys being the same before
       // stepping, like we do in Next() above.
       non_current->Prev();
     } else {
       non_current->SeekToLast();  // Iterator has no entries >= Key(). Position
@@ skipping 170 matching lines @@
 
   if (!db_->Write(*write_batch_))
     return false;
 
   finished_ = true;
   write_batch_->Clear();
   return true;
 }
 
 }  // namespace content