DO NOT COMMIT: Results of running old (current) clang-format on Blink

third_party/WebKit/Source/wtf/HashTable.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights
  * reserved.
  * Copyright (C) 2008 David Levin <levin@chromium.org>
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Library
  * General Public License for more details.
  *
  * You should have received a copy of the GNU Library General Public License
  * along with this library; see the file COPYING.LIB.  If not, write to
  * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  * Boston, MA 02110-1301, USA.
  *
  */
 
 #ifndef WTF_HashTable_h
 #define WTF_HashTable_h
 
+#include <memory>
 #include "wtf/Alignment.h"
 #include "wtf/Allocator.h"
 #include "wtf/Assertions.h"
 #include "wtf/ConditionalDestructor.h"
 #include "wtf/HashTraits.h"
 #include "wtf/PtrUtil.h"
 #include "wtf/allocator/PartitionAllocator.h"
-#include <memory>
 
 #define DUMP_HASHTABLE_STATS 0
 #define DUMP_HASHTABLE_STATS_PER_TABLE 0
 
 #if DUMP_HASHTABLE_STATS
 #include "wtf/Atomics.h"
 #include "wtf/Threading.h"
 #endif
 
 #if DUMP_HASHTABLE_STATS_PER_TABLE
+#include <type_traits>
 #include "wtf/DataLog.h"
-#include <type_traits>
 #endif
 
 #if DUMP_HASHTABLE_STATS
 #if DUMP_HASHTABLE_STATS_PER_TABLE
 
 #define UPDATE_PROBE_COUNTS()                                    \
   ++probeCount;                                                  \
   HashTableStats::instance().recordCollisionAtCount(probeCount); \
   ++perTableProbeCount;                                          \
   m_stats->recordCollisionAtCount(perTableProbeCount)
@@ skipping 2040 matching lines @@
                                       KeyTraits, Allocator>::process);
   }
   // If the backing store will be moved by sweep compaction, register the
   // table reference pointing to the backing store object, so that the
   // reference is updated upon object relocation. A no-op if not enabled
   // by the visitor.
   Allocator::registerBackingStoreReference(visitor, &m_table);
   if (!IsTraceableInCollectionTrait<Traits>::value)
     return;
   if (Traits::weakHandlingFlag == WeakHandlingInCollections) {
-    // If we have both strong and weak pointers in the collection then
-    // we queue up the collection for fixed point iteration a la
-    // Ephemerons:
-    // http://dl.acm.org/citation.cfm?doid=263698.263733 - see also
-    // http://www.jucs.org/jucs_14_21/eliminating_cycles_in_weak
+// If we have both strong and weak pointers in the collection then
+// we queue up the collection for fixed point iteration a la
+// Ephemerons:
+// http://dl.acm.org/citation.cfm?doid=263698.263733 - see also
+// http://www.jucs.org/jucs_14_21/eliminating_cycles_in_weak
 #if DCHECK_IS_ON()
     DCHECK(!enqueued() || Allocator::weakTableRegistered(visitor, this));
 #endif
     if (!enqueued()) {
       Allocator::registerWeakTable(
           visitor, this,
           WeakProcessingHashTableHelper<
               Traits::weakHandlingFlag, Key, Value, Extractor, HashFunctions,
               Traits, KeyTraits, Allocator>::ephemeronIteration,
           WeakProcessingHashTableHelper<
@@ skipping 149 matching lines @@
   CollectionIterator end(toBeRemoved.end());
   for (CollectionIterator it(toBeRemoved.begin()); it != end; ++it)
     collection.erase(*it);
 }
 
 }  // namespace WTF
 
 #include "wtf/HashIterators.h"
 
 #endif  // WTF_HashTable_h