cc: Switch to Chromium DCHECKs LOGs

cc/scoped_ptr_hash_map.h

 // Copyright 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 CC_SCOPED_PTR_HASH_MAP_H_
 #define CC_SCOPED_PTR_HASH_MAP_H_
 
 #include "base/basictypes.h"
 #include "base/hash_tables.h"
+#include "base/logging.h"
 #include "base/stl_util.h"
 #include "base/memory/scoped_ptr.h"
 
 namespace cc {
 
 // This type acts like a hash_map<K, scoped_ptr<V> >, based on top of
 // std::hash_map. The ScopedPtrHashMap has ownership of all values in the data
 // structure.
 template <typename Key, typename Value>
 class ScopedPtrHashMap {
@@ skipping 39 matching lines @@
 
   size_t erase(const Key& k) {
     iterator it = data_.find(k);
     if (it == data_.end())
       return 0;
     erase(it);
     return 1;
   }
 
   scoped_ptr<Value> take(iterator it) {
-    ASSERT(it != data_.end());
+    DCHECK(it != data_.end());
     if (it == data_.end())
       return scoped_ptr<Value>(NULL);
 
     Key key = it->first;
     scoped_ptr<Value> ret(it->second);
     data_.erase(it);
     data_.insert(std::pair<Key, Value*>(key, static_cast<Value*>(NULL)));
     return ret.Pass();
   }
 
   scoped_ptr<Value> take(const Key& k) {
     iterator it = find(k);
     if (it == data_.end())
       return scoped_ptr<Value>(NULL);
 
     return take(it);
   }
 
   scoped_ptr<Value> take_and_erase(iterator it) {
-    ASSERT(it != data_.end());
+    DCHECK(it != data_.end());
     if (it == data_.end())
       return scoped_ptr<Value>(NULL);
 
     scoped_ptr<Value> ret(it->second);
     data_.erase(it);
     return ret.Pass();
   }
 
   scoped_ptr<Value> take_and_erase(const Key& k) {
     iterator it = find(k);
@@ skipping 43 matching lines @@
 
  private:
   Container data_;
 
   DISALLOW_COPY_AND_ASSIGN(ScopedPtrHashMap);
 };
 
 }  // namespace cc
 
 #endif  // CC_SCOPED_PTR_HASH_MAP_H_