Revert of Replace all occurrences of RELEASE_ASSERT in wtf with CHECK.

third_party/WebKit/Source/wtf/Deque.h

 /*
  * Copyright (C) 2007, 2008 Apple Inc. All rights reserved.
  * Copyright (C) 2009 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1.  Redistributions of source code must retain the above copyright
  *     notice, this list of conditions and the following disclaimer.
@@ skipping 66 matching lines @@
     T& first() { ASSERT(m_start != m_end); return m_buffer.buffer()[m_start]; }
     const T& first() const { ASSERT(m_start != m_end); return m_buffer.buffer()[m_start]; }
     T takeFirst();
 
     T& last() { ASSERT(m_start != m_end); return *(--end()); }
     const T& last() const { ASSERT(m_start != m_end); return *(--end()); }
     T takeLast();
 
     T& at(size_t i)
     {
-        CHECK_LT(i, size());
+        RELEASE_ASSERT(i < size());
         size_t right = m_buffer.capacity() - m_start;
         return i < right ? m_buffer.buffer()[m_start + i] : m_buffer.buffer()[i - right];
     }
     const T& at(size_t i) const
     {
-        CHECK_LT(i, size());
+        RELEASE_ASSERT(i < size());
         size_t right = m_buffer.capacity() - m_start;
         return i < right ? m_buffer.buffer()[m_start + i] : m_buffer.buffer()[i - right];
     }
 
     T& operator[](size_t i) { return at(i); }
     const T& operator[](size_t i) const { return at(i); }
 
     template <typename U> void append(U&&);
     template <typename U> void prepend(U&&);
     void removeFirst();
@@ skipping 465 matching lines @@
     ASSERT(m_deque->m_buffer.capacity());
     if (!m_index)
         m_index = m_deque->m_buffer.capacity() - 1;
     else
         --m_index;
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 inline T* DequeIteratorBase<T, inlineCapacity, Allocator>::after() const
 {
-    CHECK_NE(m_index, m_deque->m_end);
+    RELEASE_ASSERT(m_index != m_deque->m_end);
     return &m_deque->m_buffer.buffer()[m_index];
 }
 
 template <typename T, size_t inlineCapacity, typename Allocator>
 inline T* DequeIteratorBase<T, inlineCapacity, Allocator>::before() const
 {
-    CHECK_NE(m_index, m_deque->m_start);
+    RELEASE_ASSERT(m_index != m_deque->m_start);
     if (!m_index)
         return &m_deque->m_buffer.buffer()[m_deque->m_buffer.capacity() - 1];
     return &m_deque->m_buffer.buffer()[m_index - 1];
 }
 
 // This is only called if the allocator is a HeapAllocator. It is used when
 // visiting during a tracing GC.
 template <typename T, size_t inlineCapacity, typename Allocator>
 template <typename VisitorDispatcher>
 void Deque<T, inlineCapacity, Allocator>::trace(VisitorDispatcher visitor)
@@ skipping 28 matching lines @@
 struct NeedsTracing<Deque<T, N>> {
     static const bool value = false;
 };
 #endif
 
 } // namespace WTF
 
 using WTF::Deque;
 
 #endif // WTF_Deque_h